Parallel iterative search methods for vehicle routing problems
- 1 December 1993
- Vol. 23 (8) , 661-673
- https://doi.org/10.1002/net.3230230804
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Solving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research, 1993
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- Hierarchical vehicle routing problemsNetworks, 1984
- The symmetric traveling salesman problem and edge exchanges in minimal 1-treesEuropean Journal of Operational Research, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- A Sequential Route-building Algorithm Employing a Generalised Savings CriterionJournal of the Operational Research Society, 1976
- A Heuristic Algorithm for the Vehicle-Dispatch ProblemOperations Research, 1974
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964