An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

We study a class of vehicle-routing problems (VRP) with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (i) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transportation vehicles, (ii) the VRPSPD with time windows (VRPSPDTW), which takes customer time windows into account, (iii) the VRP with divisible deliveries and pickups (VRPDDP), which allows for fulfilling the delivery and pickup requests of each customer in two separate visits, and (iv) the previously unstudied VRPDDP with time windows (VRPDDPTW). We develop a hybrid heuristic solution method which combines an adaptive large neighborhood search algorithm with a path relinking approach, called ALNS-PR, and we demonstrate the competitiveness of our algorithm on benchmark instances proposed in the literature.

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

[2]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[3]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[4]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

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

[6]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[7]  Michel Gendreau,et al.  A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

[8]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[9]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[11]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

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

[13]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[14]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[15]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

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

[17]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[18]  Hsiao-Fan Wang,et al.  A genetic algorithm for the simultaneous delivery and pickup problems with time window , 2012, Comput. Ind. Eng..

[19]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[20]  Can Berk Kalayci,et al.  An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery , 2016, Expert Syst. Appl..

[21]  Maria Grazia Speranza,et al.  The Vehicle Routing Problem with Divisible Deliveries and Pickups , 2015, Transp. Sci..

[22]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[23]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[24]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

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

[26]  Michael Schneider,et al.  A note on the time travel approach for handling time windows in vehicle routing problems , 2013, Comput. Oper. Res..

[27]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

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

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

[30]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[31]  Julian Hof,et al.  An adaptive VNS algorithm for vehicle routing problems with intermediate stops , 2015, OR Spectr..

[32]  Christian Prins,et al.  Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking , 2012, Eur. J. Oper. Res..

[33]  Ismail Karaoglan,et al.  A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..

[34]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

[35]  Chao Wang,et al.  A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows , 2015, Comput. Ind. Eng..

[36]  Lúcia Maria de A. Drummond,et al.  A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Comput. Oper. Res..

[37]  Olcay Polat,et al.  A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit , 2015, Eur. J. Oper. Res..

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

[39]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[40]  Olcay Polat,et al.  A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups , 2017, Comput. Oper. Res..

[41]  Emmanouil E. Zachariadis,et al.  An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries , 2010, Eur. J. Oper. Res..

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

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

[44]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..