A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint

This paper introduces a branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint which appears as a subproblem in several column generation based algorithms, e.g., in the classical Dantzig-Wolfe decomposition of the capacitated vehicle routing problem. A mathematical model and valid inequalities are presented. Furthermore, a new family of inequalities denoted the generalized capacity inequalities are introduced. Experimental results are performed on a set of benchmark instances generated from well known benchmark instances for the capacitated vehicle routing problem. Until now, label algorithms have been the dominant solution method for this problem but experimental results show that the branch-and-cut algorithm clearly outperforms on all the generated instances. Secondly, it can be concluded that although the generalized capacity inequalities drastically improves the lower bound the high separation time makes their usefulness questionable in their current form.

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

[2]  G. Nemhauser,et al.  Integer Programming , 2020 .

[3]  Denis Naddef,et al.  Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities , 2002, Math. Program..

[4]  Stefan Irnich.  Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..

[5]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[6]  Denis Naddef,et al.  Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation , 2002, Math. Program..

[7]  Joakim Nivre.  AN EFFICIENT ALGORITHM , 2003 .

[8]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[9]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[10]  Martin W. P. Savelsbergh,et al.  A branch and cut approach to the cardinality constrained circuit problem , 2002, Math. Program..

[11]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[12]  Matteo Salani,et al.  Branch-and-Price Algorithms for Vehicle Routing Problems , 2006 .

[13]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[14]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[15]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[16]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[17]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

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

[19]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[20]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[21]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[22]  Irina Dumitrescu,et al.  Constrained path and cycle problems , 2002 .

[23]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

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

[25]  Simon Spoorendonk,et al.  A note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint , 2008 .

[26]  Egon Balas,et al.  The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.

[27]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[28]  Andrew V. Goldberg,et al.  The Shortest Path Problem , 2009 .

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

[30]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[31]  R. K. Wood,et al.  Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .