The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search

The cumulative capacitated vehicle routing problem (CCVRP) is a relatively new variant of the classical capacitated vehicle routing problem in which the objective is to minimise the sum of arrival times at customers (min-sum) instead of the total route distance. While the literature for the CCVRP is scarce, this problem has useful applications especially in the area of supplying humanitarian aid after a natural disaster. In this paper, a two-stage adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed. When tested on the benchmark data sets, the results show that the proposed AVNS is highly competitive in producing new best known solutions to more than half of the instances. An alternative but related objective that minimises the maximum arrival time (min-max) is also explored in this study demonstrating the flexibility and the effectiveness of the proposed metaheuristic. To the best of our knowledge, this is the first study that exploits the min-max objective of the CCVRP in addition to providing extensive computational results for a large number of instances for the min-sum. As a by-product of this study, managerial insights for decision making are also presented.

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

[2]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[3]  M. Kadri,et al.  Cumulative Vehicle Routing Problems , 2008 .

[4]  Ada M. Alvarez,et al.  A customer-centric routing problem with multiple trips of a single vehicle , 2015, J. Oper. Res. Soc..

[5]  Saïd Salhi,et al.  The continuous p-centre problem: An investigation into variable neighbourhood search with memory , 2015, Eur. J. Oper. Res..

[6]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[7]  Panos M. Pardalos,et al.  A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration , 2016, Expert Syst. Appl..

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

[9]  Bruce L. Golden,et al.  Vehicle Routing Applications in Disaster Relief , 2014, Vehicle Routing.

[10]  Frédéric Semet,et al.  Rich vehicle routing problems: From a taxonomy to a definition , 2015, Eur. J. Oper. Res..

[11]  Christian Prins,et al.  A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem , 2014, Computational Optimization and Applications.

[12]  Peter Goos,et al.  An efficient GRASP+VND metaheuristic for the traveling repairman problem , 2008 .

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

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

[15]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[16]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[17]  Christian Prins,et al.  Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem , 2016, Eur. J. Oper. Res..

[18]  Sanne Wøhlk,et al.  A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem , 2014, Eur. J. Oper. Res..

[19]  Emmanouil E. Zachariadis,et al.  The load-dependent vehicle routing problem and its pick-up and delivery extension , 2015 .

[20]  Isabel Méndez-Díaz,et al.  A new formulation for the Traveling Deliveryman Problem , 2008, Discret. Appl. Math..

[21]  Christian Prins,et al.  Multistart Evolutionary Local Search for a Disaster Relief Problem , 2013, Artificial Evolution.

[22]  Russell Bent,et al.  Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution , 2010, CPAIOR.

[23]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[24]  Paul H. Calamai,et al.  A multi-objective optimization approach to urban school bus routing: Formulation and solution method , 1995 .

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

[26]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

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

[28]  Daniele Vigo,et al.  A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem , 2014, Eur. J. Oper. Res..

[29]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[30]  Sad Salhi,et al.  Heuristic Search: The Emerging Science of Problem Solving , 2017 .

[31]  Zhixing Luo,et al.  Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints , 2014, Eur. J. Oper. Res..

[32]  Dominik Goeke,et al.  Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops , 2017 .

[33]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[34]  Byung-In Kim,et al.  The school bus routing problem: A review , 2010, Eur. J. Oper. Res..

[35]  Gerrit K. Janssens,et al.  Special issue on Rich Vehicle Routing Problems , 2006, Central Eur. J. Oper. Res..

[36]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[37]  Thibaut Vidal,et al.  A simple and effective metaheuristic for the Minimum Latency Problem , 2012, Eur. J. Oper. Res..

[38]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[39]  Satish Rao,et al.  The k-traveling repairmen problem , 2007, ACM Trans. Algorithms.

[40]  Volker Gruhn,et al.  A General Vehicle Routing Problem , 2008, Eur. J. Oper. Res..

[41]  Jin-Kao Hao,et al.  Artificial Evolution , 2013, Lecture Notes in Computer Science.

[42]  Saoussen Krichen,et al.  An adaptive variable neighborhood search for solving the multi-objective node placement problem , 2015, Electron. Notes Discret. Math..

[43]  Panos M. Pardalos,et al.  Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups , 2015, Expert Syst. Appl..

[44]  Andrew Lim,et al.  An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading Constraints , 2014, IEEE Computational Intelligence Magazine.

[45]  Gilbert Laporte,et al.  The impact of depot location, fleet composition and routing on emissions in city logistics , 2016 .

[46]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

[47]  Said Salhi,et al.  A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem , 2016, Expert Syst. Appl..

[48]  William J. Cook,et al.  Solution of a Min-Max Vehicle Routing Problem , 2002, INFORMS Journal on Computing.