Hamiltonian location problems

DOI10.1016/0377-2217(83)90182-0zbMath0502.90021OpenAlexW2025926043MaRDI QIDQ1173005

Gilbert Laporte, Paul Pelletier, Yves Nobert

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90182-0

zbMATH Keywords

heuristicstravelling salesman problemlogisticsexact algorithmslocation-routingconstraint relaxation procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (26)

Designing radio-mobile access networks based on synchronous digital hierarchy rings ⋮ Distribution network design on the battlefield ⋮ A compact model and tight bounds for a combined location-routing problem ⋮ Approximating minimum-cost graph problems with spanning tree edges ⋮ Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem ⋮ Location-routing: issues, models and methods ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Vehicle routing considerations in distribution system design ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem ⋮ A hybrid genetic algorithm for the Hamiltonian p‐median problem ⋮ The Hamiltonian p-median problem ⋮ Hamiltonian location problems ⋮ Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ Facility location models for distribution system design ⋮ Distribution network design: New problems and related models ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ New path elimination constraints for multi-depot routing problems ⋮ Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization ⋮ Approximation algorithms for group prize-collecting and location-routing problems ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem ⋮ Combined location-routing problems: A synthesis and future research directions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparative study of heuristics for a two-level routing-location problem
• An exact algorithm for minimizing routing and operating costs in depot location
• Hamiltonian location problems
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
• Using cutting planes to solve the symmetric Travelling Salesman problem
• Lagerstandortoptimierung und Fuhrparkeinsatzplanung in der Konsumgüter-Industrie
• Heuristic Methods for Location-Allocation Problems
• Matching, Euler tours and the Chinese postman
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Hamiltonian location problems