Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total cost of travel is minimized and all demands are met. This paper describes and compares four new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential-size sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented.

[1]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[2]  Leonidas S. Pitsoulis,et al.  Handbook on modelling for discrete optimization , 2006 .

[3]  Stephen C. Graves,et al.  The Travelling Salesman Problem and Related Problems , 1978 .

[4]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[5]  Gilbert Laporte,et al.  Modeling and Optimization of Vehicle Routing and Arc Routing Problems , 2006 .

[6]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[7]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

[8]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

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

[10]  Juan José Salazar González,et al.  Projection results for vehicle routing , 2005, Math. Program..

[11]  Tolga Bektaş,et al.  Generalized Vehicle Routing Problem , 2003 .

[12]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[13]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[14]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[15]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[16]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[17]  Matteo Fischetti,et al.  The symmetric generalized traveling salesman polytope , 1995, Networks.

[18]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[19]  Joaquín Bautista,et al.  Solving an urban waste collection problem using ants heuristics , 2008, Comput. Oper. Res..

[20]  Gilbert Laporte,et al.  Loop based facility planning and material handling , 2002, Eur. J. Oper. Res..

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

[22]  Gilbert Laporte,et al.  Some applications of the generalized vehicle routing problem , 2008, J. Oper. Res. Soc..

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

[24]  Imdat Kara.  Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem , 2003 .

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

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.