Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- 1 December 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 41 (4) , 421-451
- https://doi.org/10.1007/bf02023004
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Parallel Savings Based Heuristics for the Delivery ProblemOperations Research, 1991
- Twenty Years of Routing and SchedulingOperations Research, 1990
- A set‐partitioning‐based exact algorithm for the vehicle routing problemNetworks, 1989
- Simulated annealing: An introductionStatistica Neerlandica, 1989
- Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling OptimizerInterfaces, 1983
- Route first—Cluster second methods for vehicle routingOmega, 1983
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Real-Time Dispatch of Petroleum Tank TrucksManagement Science, 1981
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969