A new branch-and-cut algorithm for the capacitated vehicle routing problem

Abstract.We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity, generalized capacity, strengthened comb, multistar, partial multistar, extended hypotour inequalities, and classical Gomory mixed-integer cuts. For each of these classes of inequalities we describe our separation algorithms in detail. Also we describe the other important ingredients of our branch-and-cut algorithm, such as the branching rules, the node selection strategy, and the cut pool management. Computational results, for a large number of instances, show that the new algorithm is competitive. In particular, we solve three instances (B-n50-k8, B-n66-k9 and B-n78-k10) of Augerat to optimality for the first time.

[1]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[2]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[3]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[4]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[5]  Philippe Augerat,et al.  Approche polyèdrale du problème de tournées de véhicules. (Polyhedral approach of the vehicle routing problem) , 1995 .

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

[7]  Penousal Machado,et al.  GVR: A New Genetic Representation for the Vehicle Routing Problem , 2002, AICS.

[8]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

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

[11]  Christos D. Tarantilis,et al.  Combination of geographical information system and efficient routing algorithms for real life distribution operations , 2004, Eur. J. Oper. Res..

[12]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

[13]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[14]  L. Gouveia.  A result on projection for the vehicle routing ptoblem , 1995 .

[15]  Ulrich Blasum,et al.  Application of the Branch and Cut Method to the Vehicle Routing Problem , 2000 .

[16]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[17]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[18]  Ángel Corberán,et al.  Polyhedral results for a vehicle routing problem , 1991 .

[19]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[20]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[21]  Stefano Pallottino,et al.  Revisione del volume "Annotated Bibliographies in Combinatorial Optimization" (Dell'Amico, Maffioli, Martello Eds.) , 1997 .

[22]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

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

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

[25]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[26]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

[27]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[28]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[29]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

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

[31]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[32]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[33]  J. Araque.  Lots of combs of different sizes for vehicle routing , 1990 .

[34]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[35]  Nicos Christofides,et al.  A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..

[36]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[37]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

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

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

[40]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[41]  Donald L. Miller.  A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems , 1995, INFORMS J. Comput..

[42]  Thomas L. Morin,et al.  A branch-and-cut algorithm for vehicle routing problems , 1994, Ann. Oper. Res..

[43]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[44]  Ted K. Ralphs,et al.  Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..

[45]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[46]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

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

[48]  J. Picard,et al.  An optimal algorithm for the mixed Chinese postman problem , 1996 .

[49]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[50]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

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

[52]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[53]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .