Lower Bounds and an Exact Method for the Capacitated Vehicle Routing Problem

In this paper we consider the problem in which a fleet of M vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This problem is referred as the capacitated vehicle routing problem (CVRP). We present an exact algorithm for solving the CVRP based on a set partitioning formulation of the problem. We describe a procedure for computing a valid lower bound to the cost of the optimal CVRP solution that finds a feasible solution of the dual of the LP-relaxation of the set partitioning formulation without generating the entire set partitioning matrix. The dual solution obtained is then used to limit the set of the feasible routes containing the optimal CVRP solutions. The resulting set partitioning problem is solved by using a branch and bound algorithm. Computational results are presented for a number of problems derived from the literature. The results show the effectiveness of the proposed method in solving problems up to about 100 customers

[1]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

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

[3]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

[4]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[5]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

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

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

[8]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

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

[10]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

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

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

[13]  F. Kelly.  Network routing , 1991, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

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

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

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

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

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

[19]  Marshall L. Fisher,et al.  Chapter 1 Vehicle routing , 1995 .

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

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

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

[23]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[24]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

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

[26]  David Simchi-Levi,et al.  Set-Covering-Based Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

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

[28]  Paolo Toth,et al.  Branch-And-Bound Algorithms for the Capacitated VRP , 2002, The Vehicle Routing Problem.

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

[30]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[31]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[32]  Lawrence Bodin,et al.  Street Routing and Scheduling Problems , 2003 .

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

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

[35]  Roberto Baldacci,et al.  An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..

[36]  Howard Kleiman.  The Symmetric Traveling Salesman Problem , 2005, ArXiv.

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

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