A Lagrangean relaxation heuristic for vehicle routing
- 31 January 1984
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 15 (1) , 84-88
- https://doi.org/10.1016/0377-2217(84)90050-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- Set partitioning based heuristics for interactive routingNetworks, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- Multi-terminal vehicle-dispatch algorithmOmega, 1976
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964