Abstract
The basic Vehicle Routing Problem (VRP) consists of computing a set of trips of minimum total cost, to deliver fixed amounts of goods to customers with a fleet of identical vehicles. Few papers address the case with several types of vehicles (heterogeneous fleet). Most of them assume an unlimited number of vehicles of each type, to dimension the fleet from a strategic point of view. This paper tackles the more realistic tactical or operational case, with a fixed number of vehicles of each type, and the optional possibility for each vehicle to perform several trips. It describes several heuristics, including a very efficient one that progressively merges small starting trips, while ensuring that they can be performed by the fleet. This heuristic seeks to minimize the number of required vehicles as a secondary objective. It outperforms classical VRP heuristics, can easily handle various constraints, and gives very good initial solutions for a tabu search method. The real case of a French manufacturer of furniture with 775 destination stores is presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crainic, T. and Laporte, G.: Fleet Management and Logistics, Kluwer Acad. Publ., Dordrecht, 1998.
Laporte, G., Desrochers, M. and Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem, Networks 14 (1984), 161–172.
Laporte, G., Mercure, H. and Nobert, Y.: An exact algorithm for the asymmetrical capacitated vehicle routing problem, Networks 16 (1986), 33–46.
Cornuejols, G. and Harche, F.: Polyhedral study of the capacitated vehicle routing problem, Math. Programming 60 (1993), 21–52.
Bianco, L., Mingozzi, A. and Ricciardelli, S.: A set partitioning approach to the multiple depot vehicle scheduling problem, Optim. Meth. Software 3 (1994), 163–194.
Desrochers, M., Desrosiers, J. and Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40 (1992), 342–354.
Christofides, N., Mingozzi, A. and Toth, P.: The vehicle routing problem, In: N. Christofides et al. (eds), Combinatorial Optimization, Wiley, New York, 1979, pp. 315–338.
Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. 41 (1993), 421–451.
Gendreau, M., Hertz, A. and Laporte, G.: A tabu search algorithm for the vehicle routing problem, Manag. Sci. 40 (1994), 1276–1290.
Osman, I. H. and Salhi, S.: Local search strategies for the VFMP, In: V. J. Rayward-Smith et al. (eds), Modern Heuristic Search Methods, Wiley, Chichester, 1996, pp. 131–153.
Gendreau, M., Laporte, M., Musaraganyi, C. and Taillard, E. D.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem, Comput. Oper. Res. 26 (1999), 1153–1173.
Taillard, E. D.: A heuristic column generation method for the heterogeneous fleet VRP, RAIROOper. Res. 33 (1999), 1–14.
Cormen, T. H., Leiserson, C. L. and Rivest, R. L.: Introduction to Algorithms,MIT Press, 1990.
Brandão, J. C. S. and Mercer, A.: The multi-trip vehicle routing problem, J. Oper. Res. Soc. 49 (1998), 799–805.
Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Fransisco, 1979.
Martello, S. and Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Prins, C. Efficient Heuristics for the Heterogeneous Fleet Multitrip VRP with Application to a Large-Scale Real Case. Journal of Mathematical Modelling and Algorithms 1, 135–150 (2002). https://doi.org/10.1023/A:1016516326823
Issue Date:
DOI: https://doi.org/10.1023/A:1016516326823