Summary
In this chapter we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The quality of the obtained results is comparable to the best results known up to date on a set of instances previously published in the literature.
A preliminary version of this work was published in: Cotta, C. and van Hemert, J. (eds.), Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science 4446, pp. 121–129. Springer, Berlin (2007).
This is a preview of subscription content, log in via an institution to check access.
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, 64–73 (2006)
Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40, 226–234 (2006)
Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: To split or not to split: That is the question. Transportation Research E: Logistics and Transportation Review 44, 114–123 (2008)
Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science (to appear, 2008)
Belenguer, J.M., Martínez, M.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Operations Research 48, 801–810 (2000)
Chen, S., Golden, B., Wasil, E.: The split delivery vehicle routing problem: Applications, algorithms, test problems and computational results. Networks 49, 318–329 (2007)
Clarke, G., Wright, J.V.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
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)
Frizzell, P.W., Giffin, J.W.: The split delivery vehicle routing problem with time windows and grid network distances. Computers and Operations Research 22, 655–667 (1995)
Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the travelling salesman problem. Operations Research 40, 1086–1094 (1992)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)
Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13–54. Springer, Berlin (1998)
Laguna, M., Martí, R.: Scatter Search – Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)
Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: New test problems, algorithms and results. Computers and Operations Research 32, 1197–1212 (2005)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling salesman problem. Operations Research 21, 498–516 (1973)
Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routing in livestock feed distribution. Journal of the Operational Research Society 48, 107–116 (1997)
Sierksma, G., Tijssen, G.A.: Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research 76, 261–286 (1998)
Song, S., Lee, K., Kim, G.: A practical approach to solving a newspaper logistic problem using a digital map. Computers and Industrial Engineering 43, 315–330 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Campos, V., Corberán, A., Mota, E. (2008). A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem. In: Fink, A., Rothlauf, F. (eds) Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management. Studies in Computational Intelligence, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69390-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-69390-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69024-5
Online ISBN: 978-3-540-69390-1
eBook Packages: EngineeringEngineering (R0)