A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls
- 1 January 1996
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 12 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
- An additive bounding procedure for the asymmetric travelling salesman problemMathematical Programming, 1992
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- The vehicle routing problem with backhaulsEuropean Journal of Operational Research, 1989
- An O(N log N) planar travelling salesman heuristic based on spacefilling curvesOperations Research Letters, 1982
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- 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