Limited memory Rank-1 Cuts for Vehicle Routing Problems

Pecin etal. (2016) introduced a limited memory technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational polyhedral study that determines the best possible sets of multipliers for cuts with up to 5 rows. Experiments with CVRP instances show that the new multipliers lead to significantly improved dual bounds and contributes decisively for solving an open instance with 420 customers.

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

[2]  Guy Desaulniers,et al.  Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows , 2010, INFOR Inf. Syst. Oper. Res..

[3]  Brian Kallehauge,et al.  Lagrangian duality applied to the vehicle routing problem with time windows , 2006, Comput. Oper. Res..

[4]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

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

[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]  Xia Li,et al.  A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem , 2015 .

[8]  Teodor Gabriel Crainic,et al.  A cooperative parallel metaheuristic for the capacitated vehicle routing problem , 2014, Comput. Oper. Res..

[9]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[10]  Luigi Di Puglia Pugliese,et al.  A survey of resource constrained shortest path problems: Exact solution approaches , 2013, Networks.

[11]  Matteo Fischetti,et al.  On the separation of maximally violated mod-k cuts , 1999, Math. Program..

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

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

[14]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[15]  Guy Desaulniers,et al.  Tabu Search, Generalized k-Path Inequalities, and Partial Elementarity for the Vehicle Routing Problem with Time Windows , 2006 .

[16]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[17]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[18]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

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

[20]  Marcus Poggi de Aragão,et al.  Improved Branch-Cut-and-Price for Capacitated Vehicle Routing , 2014, IPCO.

[21]  Manuel Laguna,et al.  Tabu Search , 1997 .

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

[23]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[24]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..

[25]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .