The Vehicle Routing Problem with Divisible Deliveries and Pickups

The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits. The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup and delivery quantities to be served separately with respect to the case where the quantities have to be served simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem structure and an average estimation of the savings due to the possibility of serving pickup and delivery quantities separately.

[1]  Emmanouil E. Zachariadis,et al.  A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service , 2009, Expert Syst. Appl..

[2]  Mauro Brunato,et al.  Reactive Search and Intelligent Optimization , 2008 .

[3]  Bülent Çatay,et al.  A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Expert Syst. Appl..

[4]  Roberto Baldacci,et al.  An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.

[5]  Anand Subramanian,et al.  Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery , 2011, Oper. Res. Lett..

[6]  Manuel Laguna,et al.  Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup , 2011, Int. J. Appl. Metaheuristic Comput..

[7]  Gilbert Laporte,et al.  General solutions to the single vehicle routing problem with pickups and deliveries , 2007, Eur. J. Oper. Res..

[8]  Subrata Mitra,et al.  An Algorithm for the generalized Vehicle Routing Problem with Backhauling , 2005, Asia Pac. J. Oper. Res..

[9]  Gábor Nagy,et al.  A Reactive Tabu Search Algorithm for the Vehicle Routing Problem with Simultaneous Deliveries and Pickups , 2008 .

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

[11]  M. Grazia Speranza,et al.  The split delivery vehicle routing problem , 2006 .

[12]  Yuvraj Gajpal,et al.  Multi-ant colony system (MACS) for a vehicle routing problem with backhauls , 2009, Eur. J. Oper. Res..

[13]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[14]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[15]  Shoshana Anily,et al.  The vehicle-routing problem with delivery and back-haul options , 1996 .

[16]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[17]  Said Salhi,et al.  An ant system algorithm for the mixed vehicle routing problem with backhauls , 2004 .

[18]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[19]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[20]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[21]  Ibrahim H. Osman,et al.  Tabu search variants for the mix fleet vehicle routing problem , 2002, J. Oper. Res. Soc..

[22]  José Brandão.  A new tabu search algorithm for the vehicle routing problem with backhauls , 2006, Eur. J. Oper. Res..

[23]  Marc Reimann,et al.  Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..

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

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

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

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

[28]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[29]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[30]  Arne Løkketangen,et al.  Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search , 2006, Central Eur. J. Oper. Res..

[31]  Chelsea C. White,et al.  An empirical study on the benefit of split loads with the pickup and delivery problem , 2009, Eur. J. Oper. Res..

[32]  Gilbert Laporte,et al.  The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..

[33]  Saïd Salhi,et al.  The vehicle routing problem with restricted mixing of deliveries and pickups , 2013, J. Sched..

[34]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[35]  Roberto Baldacci,et al.  An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..

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

[37]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[38]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[39]  Irina Gribkovskaia,et al.  MODELS FOR PICK-UP AND DELIVERIES FROM DEPOTS WITH LASSO SOLUTIONS , 2001 .

[40]  Shu-Chu Liu,et al.  A heuristic method for the vehicle routing problem with backhauls and inventory , 2009, J. Intell. Manuf..

[41]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[42]  Gilbert Laporte,et al.  Lasso solution strategies for the vehicle routing problem with pickups and deliveries , 2009, Eur. J. Oper. Res..

[43]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

[44]  Shoshana Anily.  The Vehicle-Routing Problem with Delivery and BackHaul Options , 2006 .

[45]  Gábor Nagy,et al.  A heuristic method for the vehicle routing problem with mixed deliveries and pickups , 2008, J. Sched..

[46]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..

[47]  Gur Mosheiov,et al.  The Travelling Salesman Problem with pick-up and delivery , 1994 .

[48]  Manar Hosny.  Vehicle Routing with Pickup and Delivery , 2012 .

[49]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[50]  김병인,et al.  Heuristic algorithms for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2009 .

[51]  Chelsea C. White,et al.  Pickup and Delivery with Split Loads , 2008, Transp. Sci..

[52]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[53]  Christos D. Tarantilis,et al.  Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns , 2013, Transp. Sci..

[54]  Yuvraj Gajpal,et al.  An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup , 2009, Comput. Oper. Res..

[55]  Sam R. Thangiah,et al.  Real-time split-delivery pickup and delivery time window problems with transfers , 2007, Central Eur. J. Oper. Res..

[56]  Anand Subramanian,et al.  A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2011 .

[57]  N. Wassan.  Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls , 2007, J. Oper. Res. Soc..

[58]  Emmanouil E. Zachariadis,et al.  An effective local search approach for the Vehicle Routing Problem with Backhauls , 2012, Expert Syst. Appl..