The Split Delivery Vehicle Routing Problem: A Survey

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 chapter we present a survey of the state-of-the-art on the SDVRP.

[1]  Ángel Corberán,et al.  A New Metaheuristic for the Vehicle Routing Problem with Split Demands , 2007, EvoCOP.

[2]  B. Golden,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[3]  Mingzhou Jin,et al.  A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem , 2007 .

[4]  Moshe Dror,et al.  Split-delivery routeing heuristics in livestock feed distribution , 1997 .

[5]  Cyrille Gueguen.  Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .

[6]  Maria Grazia Speranza,et al.  Vehicle routing in the 1-skip collection problem , 2004, J. Oper. Res. Soc..

[7]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[8]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[9]  Claudia Archetti,et al.  To Split or not to Split: That is the Question , 2008 .

[10]  J. W. Giffin,et al.  The split delivery vehicle scheduling problem with time windows and grid network distances , 1995, Comput. Oper. Res..

[11]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[12]  Gerard Sierksma,et al.  Routing helicopters for crew exchanges on off-shore locations , 1998, Ann. Oper. Res..

[13]  Yavuz A. Bozer,et al.  A shortest path approach to the multiple-vehicle routing problem with split pick-ups , 2006 .

[14]  Roberto Baldacci,et al.  The Rollon-Rolloff Vehicle Routing Problem , 2000, Transp. Sci..

[15]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[16]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[17]  Moshe Dror,et al.  A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..

[18]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[19]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[20]  Maciek A. Nowak,et al.  The Pickup and Delivery Problem with Split Loads , 2005 .

[21]  Martin W. P. Savelsbergh,et al.  Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..

[22]  Maria Grazia Speranza,et al.  Complexity and Reducibility of the Skip Delivery Problem , 2005, Transp. Sci..

[23]  José-Manuel Belenguer,et al.  A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..

[24]  L. De Meulemeester,et al.  Optimal sequencing of skip collections and deliveries , 1997 .

[25]  M. Dror,et al.  Split delivery routing , 1990 .

[26]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..