Abstract
In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this paper we present a survey of the state-of-the-art on this important problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Archetti C, Hertz A, Speranza MG (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 40: 64–73
Archetti C, Mansini R, Speranza MG (2005) Complexity and reducibility of the skip delivery problem. Transportation Science 39: 182–187
Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40: 226–234
Archetti C, Savelsbergh MWP, Speranza MG, To split or not to split: That is the question. Transportation Research E, to appear.
Archetti C, Savelsbergh MWP, Speranza MG, An optimization-based heuristic for the split delivery vehicle routing problem. Submitted
Archetti C, Speranza MG (2004) Vehicle routing in the 1-skip collection problem. Journal of the Operational Research Society 55: 717–727
Archetti C, Speranza MG, The split delivery vehicle routing problem: A survey. Submitted
Ball M, Bodin L, Baldacci R, Mingozzi A (2000) The rollon-rolloff vehicle routing problem. Transportation Science 34: 271–288
Belenguer JM, Martinez MC, Mota E (2000) A lower bound for the split delivery vehicle routing problem. Operations Research 48: 801–810
Chen S, Golden B, Wasil E, The split delivery vehicle routing problem: A new heuristic and benchmark problems. Presented at ROUTE 2005
De Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. Journal of the Operational Research Society 48: 57–64
Dror M, Laporte G, Trudeau G (1994) Vehicle routing with split deliveries. Discrete Applied Mathematics 50: 239–254
Dror M, Trudeau G (1989) Savings by split delivery routing. Transportation Science 23: 141–145
Dror M, Trudeau G (1990) Split delivery routing. Naval Research Logistics 37: 383–402
Frizzell PW, Giffin JW (1995) The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research 22: 655–667
Gendreau M, Dejax P, Feillet D, Gueguen C, Vehicle routing with time windows and split deliveries. Working paper
Gueguen C (1999) Méthodes de résolution exacte pour les problèmes de tournées de véhicules. PhD thesis, École Centrale Paris, Paris
Mullaseril PA, Dror M, Leung J (1997) Split-delivery routing in livestock feed distribution. Journal of the Operational Research Society 48: 107–116
Sierksma G, Tijssen GA (1998) Routing helicopters for crew exchanges on offshore locations. Annals of Operations Research 76: 261–286
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Archetti, C., Speranza, M.G. (2007). An Overview on the Split Delivery Vehicle Routing Problem. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)