Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

This chapter presents techniques for constructing robust Branch-Cut-and-Price algorithms on a number of Vehicle Routing Problem variants. The word ‘‘robust’’ stresses the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the development of new families of cuts over large extended formulations. Computational experiments over benchmark instances from ACVRP, COVRP, CVRP and HFVRP variants are provided.

[1]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[2]  Natashia Boland,et al.  Path inequalities for the vehicle routing problem with time windows , 2007, Networks.

[3]  Giovanni Felici,et al.  Solving large MIP models in supply chain management by branch & cut , 2000 .

[4]  Sanjeeb Dash,et al.  On a Generalization of the Master Cyclic Group Polyhedron , 2007, IPCO.

[5]  Terry P. Harrison,et al.  Lot-Sizing with Start-Up Times , 1998 .

[6]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[7]  Jens Lysgaard.  Reachability cuts for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

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

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

[10]  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..

[11]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[12]  Thomas L. Magnanti,et al.  Capacitated trees, capacitated routing, and associated polyhedra , 1990 .

[13]  Luís Gouveia,et al.  Combined route capacity and route length models for unit demand vehicle routing problems , 2008, Discret. Optim..

[14]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[15]  Thomas L. Magnanti,et al.  A Polyhedral Intersection Theorem for Capacitated Spanning Trees , 1992, Math. Oper. Res..

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

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

[18]  M. Fischetti,et al.  A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs , 1994, Oper. Res..

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

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

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

[22]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[23]  Juan José Salazar González,et al.  Projection results for vehicle routing , 2005, Math. Program..

[24]  Adam N. Letchford,et al.  Multistars, partial multistars and the capacitated vehicle routing problem , 2002, Math. Program..

[25]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[26]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[27]  Cynthia Barnhart,et al.  Multimodal Express Package Delivery: A Service Network Design Application , 1999, Transp. Sci..

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

[29]  Gérard Cornuéjols,et al.  Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..

[30]  Roberto Baldacci,et al.  The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem , 2006, Comput. Oper. Res..

[31]  David Pisinger,et al.  A non-robust Branch-and-Cut-and-Price algorithm for the Vehicle Routing Problem with Time Windows , 2006 .

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

[33]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[34]  Adam N. Letchford,et al.  A branch-and-cut algorithm for the capacitated open vehicle routing problem , 2007, J. Oper. Res. Soc..

[35]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.