Abstract
This paper studies the Split Delivery Vehicle Routing problem (SDVRP), a variant of the VRP in which multiple visits to customers are allowed. This NP-hard problem is solved by a recent metaheuristic called Memetic Algorithm with Population Management or MA|PM (Sörensen, 2003). It consists in a genetic algorithm, combined with a local search procedure for intensification and a distance measure to control population diversity. Special moves dedicated to split deliveries are introduced in the local search. This solution approach is evaluated and compared with the tabu search algorithm of Archetti et al. (2006) and with lower bounds designed by Belenguer et al. (2000). Our method outperforms the tabu search both in solution quality and running time. On a set of 49 instances, it improves the best-known solution 32 times. The savings obtained confirm the interest and the power of the MA|PM.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 40(1), 64–73 (2006)
Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40(2), 226–234 (2006)
Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: To split or not to split: that is the question. Transportation Research Economics (to appear)
Belenguer, J.M., Martinez, M.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Operations Research 48(5), 801–810 (2000)
Campos, V., MartÃ, R., Laguna, M.: Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing 17, 111–122 (2005)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistic systems: design and optimization, pp. 279–298. Wiley, Chichester (2005)
Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discrete Applied Mathematics 50, 239–254 (1994)
Dror, M., Trudeau, P.: Savings by split delivery routing. Transportation Science 23, 141–145 (1989)
Dror, M., Trudeau, P.: Split delivery routing. Naval Research Logistics 37, 383–402 (1990)
Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: Vehicle routing with time windows and split deliveries. In: Proceedings of Odysseus 2003, Palermo (May 2003)
Frizzell, P.W., Giffin, J.W.: The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research 22(6), 655–667 (1995)
Fukasawa, R., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491–511 (2006)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)
Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research 22, 340–349 (1974)
Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimization, pp. 219–234. McGraw-Hill, New York (1999)
Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routing heuristics in livestock feed distribution. Journal of Operational Research Society 48, 107–116 (1997)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)
Prins, C., Sevaux, M., Sörensen, K.: A genetic algorithm with population management (GA|PM) for the CARP. In: 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (2004)
Reinelt, G.: Tsplib-travelling salesman problem library. ORSAJ. Comput. 3, 376–384 (1991)
Sörensen, K.: A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. PhD thesis, University of Antwerp, Belgium (2003)
Sörensen, K., Sevaux, M.: MA|PM: memetic algorithms with population management. Computers and Operations Research 33, 1214–1225 (2006)
Toth, P., Vigo, D.: The vehicle routing problem. SIAM, Philadelphia (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boudia, M., Prins, C., Reghioui, M. (2007). An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-75514-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75513-5
Online ISBN: 978-3-540-75514-2
eBook Packages: Computer ScienceComputer Science (R0)