A Lagrangean relaxation heuristic for vehicle routing

DOI10.1016/0377-2217(84)90050-XzbMath0525.90092OpenAlexW2167679255MaRDI QIDQ593987

William R. jun. Stewart, Bruce L. Golden

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90050-x

zbMATH Keywords

vehicle routingLagrangean relaxationheuristic algorithmmodified m- traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, A TSSP+1 decomposition strategy for the vehicle routing problem, Routing problems: A bibliography, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem, Comparison of dynamic routeing techniques for automated guided vehicle system, A generalized exchange heuristic for the capacitated vehicle routing problem, A comparison of techniques for solving the fleet size and mix vehicle routing problem

Uses Software

• VRP

Cites Work

• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem