Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads

This paper addresses the routing problem with unpaired pickup and delivery with split loads. An interesting factor of our problem is that the quantity and place for pickup and delivery are decision variables in the network. We develop an easy-to-implement heuristic in order to gain an efficient and feasible solution quickly. Then, a local search algorithm based on the variable neighborhood search (VNS) method is developed to improve the performance of the heuristic. Computational results show that the proposed VNS method is able to obtain an optimal or near optimal solution in reasonable time for the formulated problem.

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

[2]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

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

[4]  Zuren Feng,et al.  A two-phase metaheuristic for the cumulative capacitated vehicle routing problem , 2013, Comput. Oper. Res..

[5]  Bruce L. Golden,et al.  The split delivery vehicle routing problem with minimum delivery amounts , 2010 .

[6]  Kjetil Fagerholt,et al.  Maritime crude oil transportation - A split pickup and split delivery problem , 2012, Eur. J. Oper. Res..

[7]  Goran Martinović,et al.  Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service , 2008 .

[8]  Fanggeng Zhao,et al.  Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Ind. Eng..

[9]  Inmaculada Rodríguez Martín,et al.  A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..

[10]  Kjetil Fagerholt,et al.  Production , Manufacturing and Logistics Maritime inventory routing with multiple products : A case study from the cement industry , 2010 .

[11]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[12]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[13]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[14]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[15]  T. M. Cavalier,et al.  A Construction Heuristic for the Split Delivery Vehicle Routing Problem , 2012 .

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

[17]  Dimitrios G. Pandelis,et al.  Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery , 2013, Eur. J. Oper. Res..

[18]  Douglas A. Popken.  Controlling order circuity in pickup and delivery problems , 2006 .

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

[20]  Bruce L. Golden,et al.  The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results , 2011, Comput. Ind. Eng..

[21]  Kjetil Fagerholt,et al.  A large neighbourhood search heuristic for ship routing and scheduling with split loads , 2010, Comput. Oper. Res..

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

[23]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[24]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[25]  Ulrich Derigs,et al.  Local search-based metaheuristics for the split delivery vehicle routing problem , 2010, J. Oper. Res. Soc..

[26]  C. K. Y. Lin,et al.  A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources , 2011, Comput. Oper. Res..

[27]  Dragan Urošević,et al.  A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem , 2011, Eur. J. Oper. Res..

[28]  Martin W. P. Savelsbergh,et al.  A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing , 2012, Oper. Res..

[29]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[30]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

[31]  Joseph Hubert Wilck,et al.  A Genetic Algorithm for the Split Delivery Vehicle Routing Problem , 2012 .

[32]  Kjetil Fagerholt,et al.  The Maritime Pickup and Delivery Problem with Time Windows and Split Loads , 2011, INFOR Inf. Syst. Oper. Res..

[33]  Andrew Lim,et al.  Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints , 2012, Eur. J. Oper. Res..

[34]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[35]  Faiz A. Al-Khayyal,et al.  Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model , 2005, Eur. J. Oper. Res..

[36]  Bjørn Nygreen,et al.  Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery , 2012 .

[37]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

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

[39]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[40]  Juan-José Salazar-González,et al.  The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .

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

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

[43]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[44]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

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

[46]  Marielle Christiansen,et al.  Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem , 1999, Transp. Sci..

[47]  Ruhul A. Sarker,et al.  Solving the ship inventory routing and scheduling problem with undedicated compartments , 2009, 2009 International Conference on Computers & Industrial Engineering.