Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems

Abstract This paper considers a family of Vehicle Routing Problem (VRP) variants that generalize the classical Capacitated VRP by taking into account the possibility that vehicles differ by capacity, costs, depot allocation, or even by the subset of customers that they can visit. This work proposes a Branch-Cut-and-Price algorithm that adapts advanced features found in the best performing exact algorithms for homogeneous fleet VRPs. The original contributions include: (i) the use of Extended Capacity Cuts, defined over a pseudo-polynomially large extended formulation, together with Rank-1 Cuts, defined over the Set Partitioning Formulation; (ii) the concept of vehicle-type dependent memory for Rank-1 Cuts; and (iii) a new family of lifted Extended Capacity Cuts that takes advantage of the vehicle-type dependent route enumeration. The algorithm was extensively tested in instances of the literature and was shown to be significantly better than previous exact algorithms, finding optimal solutions for many instances with up to 200 customers and also for some larger instances. A new set of benchmark instances is also proposed.

[1]  Bruce L. Golden,et al.  A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem , 1999 .

[2]  Thibaut Vidal,et al.  A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet , 2018, Ann. Oper. Res..

[3]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[4]  Thibaut Vidal,et al.  New benchmark instances for the Capacitated Vehicle Routing Problem , 2017, Eur. J. Oper. Res..

[5]  Marcus Poggi de Aragão,et al.  A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem , 2009 .

[6]  David Pisinger,et al.  Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows , 2008 .

[7]  Marielle Christiansen,et al.  Industrial aspects and literature survey: Fleet composition and routing , 2010, Comput. Oper. Res..

[8]  M. P. Aragão,et al.  Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms , 2003 .

[9]  Ruslan Sadykov,et al.  In-Out Separation and Column Generation Stabilization by Dual Price Smoothing , 2013, SEA.

[10]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[11]  Guy Desaulniers,et al.  New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows , 2016, INFORMS J. Comput..

[12]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[13]  José Brandão,et al.  A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem , 2011, Comput. Oper. Res..

[14]  Marcus Poggi de Aragão,et al.  Limited memory Rank-1 Cuts for Vehicle Routing Problems , 2017, Oper. Res. Lett..

[15]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[16]  Puca Huachi Vaz Penna,et al.  A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem , 2012, Eur. J. Oper. Res..

[17]  Daniele Vigo,et al.  Routing a Heterogeneous Fleet of Vehicles , 2008 .

[18]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[19]  Marcus Poggi de Aragão,et al.  Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation , 2007, Math. Program..

[20]  G. Laporte,et al.  A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .

[21]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[22]  Maud Göthe-Lundgren,et al.  Mathematical Formulations of the Heterogeneous Fleet Vehicle Routing Problem , 2003 .

[23]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[24]  A Assad,et al.  VEHICLE ROUTING WITH SITE DEPENDENCIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[25]  Rafael Martinelli,et al.  A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..

[26]  Marcus Poggi de Aragão,et al.  A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem , 2009, Networks.

[27]  Daniel D. Frey,et al.  Adaptive One-Factor-at-a-Time Experimentation and Expected Value of Improvement , 2006, Technometrics.

[28]  Marcus Poggi de Aragão,et al.  A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem , 2007, WEA.

[29]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[30]  Marcus Poggi de Aragão,et al.  Improved branch-cut-and-price for capacitated vehicle routing , 2016, Mathematical Programming Computation.

[31]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[32]  Dong-wan Tcha,et al.  A column generation approach to the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[33]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[34]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[35]  Oliver Kullmann,et al.  Fundaments of Branching Heuristics , 2021, Handbook of Satisfiability.

[36]  Hande Yaman.  Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem , 2006, Math. Program..