Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

Abstract This work presents an exact branch-cut-and-price algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It shows how these cutting planes affect the dominance criterion applied in the pricing algorithm, which is a labeling algorithm for solving resource-constrained elementary shortest path problems. The idea of using cutting planes defined on the master problem variables for the VRPTW has been recently developed: Chvaátal-Gomory rank-1 cuts were applied. However, to our knowledge, this is a first attempt at incorporating for the VRPTW a set of valid inequalities specialized for the set partitioning polytope. Computational results show that the use of clique inequalities improves the lower bound at the root node of the search tree and reduces the number of nodes in this tree.

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

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

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

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

[5]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

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

[7]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[8]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

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

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

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

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[13]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[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]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

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

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[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]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

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

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

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

[25]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..