Application of the Branch and Cut Method to the Vehicle Routing Problem

The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut implementation.

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

[2]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

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

[4]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

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

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

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

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

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

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

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

[12]  Michael Jünger,et al.  Introduction to ABACUS - a branch-and-cut system , 1998, Oper. Res. Lett..

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

[14]  L. Trotter,et al.  A new generic separation routine and its application in a branch and cut algorithm for the capacitated vehicle routing problem , 1999 .