A tutorial on column generation and branch-and-price for vehicle routing problems

This paper provides a tutorial on column generation and branch-and-price for vehicle routing problems. The main principles and the basic theory of the methods are first outlined. Some additional issues, including reinforcement of the relaxation or stabilization, complete the paper. For the sake of simplicity, this material is illustrated with the case of the vehicle routing problem with time windows.

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

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

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

[4]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

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

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

[7]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[8]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .

[9]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[10]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

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

[12]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[13]  Martin W. P. Savelsbergh,et al.  A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..

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

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

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

[17]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[18]  Jun-Yeon Lee,et al.  A descent method with linear programming subproblems for nondifferentiable convex optimization , 1995, Math. Program..

[19]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[20]  Paolo Toth,et al.  Recent advances in vehicle routing exact algorithms , 2007, 4OR.

[21]  Claude Lemaréchal,et al.  Comparison of bundle and classical column generation , 2008, Math. Program..

[22]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

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

[24]  Michel Gendreau,et al.  Interior point stabilization for column generation , 2007, Oper. Res. Lett..

[25]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[26]  François Vanderbeck,et al.  Implementing Mixed Integer Column Generation , 2005 .

[27]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[28]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

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

[30]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows , 2002, Transp. Sci..

[31]  Jacques Desrosiers,et al.  Cutting planes for branch‐and‐price algorithms , 2009, Networks.

[32]  Jesper Larsen,et al.  Lagrangean duality applied on vehicle routing with time windows , 2001 .

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

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

[35]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[36]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

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