A sweep-based algorithm for the fleet size and mix vehicle routing problem
Authors:
- Jacques RenaudJRJacques Renaud
- Fayez F. BoctorFBFayez F. Boctor
- 1 August 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 140 (3) , 618-628
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A heuristic column generation method for the heterogeneous fleet VRPRAIRO - Operations Research, 1999
- An Improved Petal Heuristic for the Vehicle Routeing ProblemJournal of the Operational Research Society, 1996
- Routing problems: A bibliographyAnnals of Operations Research, 1995
- A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxationsAnnals of Operations Research, 1995
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Extensions of the Petal Method for Vehicle RouteingJournal of the Operational Research Society, 1993
- Improvements to Vehicle Routeing HeuristicsJournal of the Operational Research Society, 1987
- A comparison of techniques for solving the fleet size and mix vehicle routing problemOR Spectrum, 1984
- Vehicle Fleet CompositionJournal of the Operational Research Society, 1983
- The Size and Composition of a Road Transport FleetJournal of the Operational Research Society, 1969