A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts

We propose a new multi-start solution approach for the split-delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA). Initial solutions are generated by both node-insertion and route-addition procedures with a single parameter to control the restart. These solutions are then improved by a variable neighborhood descent metaheuristic with a novel search operator inspired by node-ejection chains. We test the proposed approach with 32 benchmark instances for four different minimum delivery fractions. Using the proposed algorithm, out of 128 cases tested, we find 81 best known solutions and 34 new best solutions; overall, we find 43 new best solutions.

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

[2]  Daniel J. Kleitman,et al.  A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts , 2013, Optim. Lett..

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

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

[5]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

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

[7]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[8]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

[10]  Sergio García,et al.  A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem , 2014, Ann. Oper. Res..

[11]  Damon Gulczynski,et al.  Integer Programming-Based Heuristics for Vehicle Routing Problems , 2010 .

[12]  Anand Subramanian,et al.  An iterated local search heuristic for the split delivery vehicle routing problem , 2015, Comput. Oper. Res..

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

[14]  Rafael E. Aleman,et al.  A tabu search with vocabulary building approach for the vehicle routing problem with split demands , 2010, Int. J. Metaheuristics.

[15]  Claudia Archetti,et al.  Branch-and-cut algorithms for the split delivery vehicle routing problem , 2014, Eur. J. Oper. Res..

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

[17]  Mohamed Reghioui,et al.  An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem , 2007, Hybrid Metaheuristics.

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

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

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

[21]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[23]  César Rego,et al.  Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms , 2001, Parallel Comput..

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

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

[26]  Xinhui Zhang,et al.  An adaptive memory algorithm for the split delivery vehicle routing problem , 2010, J. Heuristics.

[27]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

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

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

[30]  Bruce L. Golden,et al.  A Parallel Algorithm for the Vehicle Routing Problem , 2011, INFORMS J. Comput..

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

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

[33]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[34]  Vicente Campos,et al.  A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem , 2008 .

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

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