A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- 22 February 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 89 (1), 108-126
- https://doi.org/10.1016/s0377-2217(96)90060-0
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed GraphsOperations Research, 1994
- Optimal Solution of Vehicle Routing Problems Using Minimum K-TreesOperations Research, 1994
- Polyhedral study of the capacitated vehicle routing problemMathematical Programming, 1993
- An additive bounding procedure for the asymmetric travelling salesman problemMathematical Programming, 1992
- An Additive Bounding Procedure for Combinatorial Optimization ProblemsOperations Research, 1989
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964