The split delivery vehicle routing problem with minimum delivery amounts

In the vehicle routing problem, a fleet of vehicles must service the demands of customers in a least-cost way. By allowing multiple vehicles to service the same customer (i.e., splitting deliveries), substantial savings in travel costs are possible. However, split deliveries are often an inconvenience to the customer who would prefer to have demand serviced in a single visit. We consider the vehicle routing problem in which split deliveries are allowed only if a minimum fraction of a customer's demand is serviced by a vehicle. We develop a heuristic method for solving this problem and report computational results on a wide range of problem sets.

[1]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

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

[3]  Patrick J. Kaufmann.  Pizza hut, Inc. , 2002 .

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

[5]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

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

[7]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[8]  Bruce L. Golden,et al.  Recent Developments in Modeling and Solving the Split Delivery Vehicle Routing Problem , 2008 .

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

[10]  Subrata Mitra,et al.  A parallel clustering technique for the vehicle routing problem with split deliveries and pickups , 2008, J. Oper. Res. Soc..

[11]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

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

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

[14]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[15]  Kai Liu,et al.  A column generation approach for the split delivery vehicle routing problem , 2008, Oper. Res. Lett..

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

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

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

[19]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[20]  Vicente Campos Aucejo,et al.  Rutas de vehículos con demanda compartida , 2007 .

[21]  Maria Grazia Speranza,et al.  The Split Delivery Vehicle Routing Problem: A Survey , 2008 .

[22]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

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

[24]  Martin W. P. Savelsbergh,et al.  Inventory Routing in Practice , 2002, The Vehicle Routing Problem.

[25]  Olli Bräysy,et al.  Active-guided evolution strategies for large-scale capacitated vehicle routing problems , 2007, Comput. Oper. Res..

[26]  Reza Tavakkoli-Moghaddam,et al.  A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing , 2007, J. Frankl. Inst..

[27]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[28]  Bjørn Nygreen,et al.  Ship routing and scheduling with flexible cargo sizes , 2007, J. Oper. Res. Soc..

[29]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..