Routing a Heterogeneous Fleet of Vehicles
- 9.2k Downloads
In the well-known Vehicle Routing Problem (VRP) a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints.
An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs is available for distribution activities. The problem is known as the Mixed Fleet VRP or as the Heterogeneous Fleet VRP.
This chapter gives an overview of approaches from the literature to solve heterogeneous VRPs. In particular, we classify the different variants described in the literature and, as no exact algorithm has been presented for any variants of heterogeneous VRP, we review the lower bounds and the heuristic algorithms proposed. Computational results, comparing the performance of the different heuristic algorithms on benchmark instances, are also discussed.
Key wordsHeterogeneous vehicle routing problem
Unable to display preview. Download preview PDF.
- 2.M. Balinski and R. Quandt. On an integer program for a delivery problem.Operations Research, 12: 300–304, 1964.Google Scholar
- 6.O. Bräysy, M. Gendreau, G. Hasle, and A. Løkketangen. A survey of rich vehicle routing models and heuristic solution techniques. Technical report, SINTEF, 2002.Google Scholar
- 7.O. Bräysy, W. Dullaert, G. Hasle, D. Mester, and M. Gendreau. An effective multi-restart deterministic annealing methauristic for the fleet size and mix vehicle routing problem with time windows.Transportation Science, to appear, 2006.Google Scholar
- 8.I.M. Chao, B.L. Golden, and E. Wasil. A computational study of a new heuristic for the site-dependent vehicle routing problem.INFOR, 37:3: 319–336, 1999.Google Scholar
- 11.G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points.Operations Research, 12(4): 568–581, 1964.Google Scholar
- 12.J.-F. Cordeau and G. Laporte. A tabu search algorithm for the site dependent vehicle routing problem with time windows.INFOR, 39: 292–298, 2001.Google Scholar
- 14.J. F. Cordeau, G. Laporte, M. W. P. Savelsbergh, and D. Vigo. Vehicle routing. In C. Barnhart and G. Laporte, editors,Transportation, Handbooks in Operations Research and Management Science, volume 14, pages 367–428. Elsevier, Amsterdam, 2007.Google Scholar
- 16.M. Dell’Amico, M. Monaci, C. Pagani, and D. Vigo. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows.Transportation Science, 2007. To appear.Google Scholar
- 22.W.W. Garvin, H.W. Crandall, J.B. John, and R.A. Spellman. Applications of vehicle routing in the oil industry.Management Science, 3: 407–430, 1957.Google Scholar
- 23.T.J. Gaskell. Bases for vehicle fleet scheduling.Operational Research Quarterly, 18: 281–295, 1967.Google Scholar
- 24.B. Gavish and S.C. Graves. Scheduling and routing in transportation and distribution systems: formulations and new relaxations. Technical report, Graduate School of Management, University of Rochester, 1982.Google Scholar
- 26.F.G. Gheysens, B.L. Golden, and A.A. Assad. A relaxation heuristic for the fleet size and mix vehicle routing problem. InProceedings of SE AIDS Meeting, Williamsburg, Virginia, 1983.Google Scholar
- 27.F.G. Gheysens, B.L. Golden, and A.A. Assad. A comparison of techniques for solving the fleet size and mix vehicle routing problem.OR Spectrum, 6 (4): 207–216, 1984.Google Scholar
- 28.F.G. Gheysens, B.L. Golden, and Assad A.A. A new heuristic for determining fleet size and composition.Mathematical Programming Studies, 26: 233–236, 1986.Google Scholar
- 29.B. Gillett and L. Miller. A heuristic for the vehicle dispatching problem.Operations Research, 22: 340–349, 1974.Google Scholar
- 31.B.L. Golden, E. Wasil, J. Kelly, and I.M. Chao. The impact of metaheuristic on solving the vehicle routing problem: algorithms, problem sets, and computational results. In T. Crainic and G. Laporte, editors,Fleet Management and Logistics, pages 33–56. Kluwer, Boston, MA, 1998.Google Scholar
- 33.S. Lin. Computer solutions of the traveling salesman problem.Bell System Technical Journal, 44: 2245–2269, 1965.Google Scholar
- 36.B. Nag.Vehicle Routing in the Presence of Site/Vehicle Dependency Constraints. PhD thesis, College of Business and Management, University of Maryland, 1986.Google Scholar
- 37.B. Nag, B.L. Golden, and A. Assad. Vehicle routing with site dependencies. In B.L. Golden and A. Assad, editors,Vehicle Routing: Methods and Studies, pages 149–159. Elsevier, Amsterdam, Holland, 1988.Google Scholar
- 39.L.S. Ochi, D.S. Vianna, L.M.A. Drummond, and A.O. Victor. A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet.Parallel and Distributed Processing, 1388: 216–224, 1998.Google Scholar
- 40.I. Or.Traveling Salesman-type Combinatorial Optimization Problems and their Relation to the Logistics of Regional Blood Banking. PhD thesis, Department of Industrial Engineering and Management Sciences. Northwestern University, Evanston, IL, 1976.Google Scholar
- 41.I.H. Osman and S. Salhi. Local search strategies for the vehicle fleet mix problem. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors,Modern Heuristic Search Methods, pages 131–153. Wiley: Chichester, 1996.Google Scholar
- 49.M. Solomon. Algorithms for the vehicle routing and scheduling problems with the time window constraints.Operations Research, 35: 254–265, 1987.Google Scholar
- 55.P. Toth and D. Vigo, editors.The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA, 2002.Google Scholar
- 59.P. Yellow. A computational modification to the savings method of vehicle scheduling.Operational Research Quarterly, 21: 281–283, 1970.Google Scholar