Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar inequalities.

[1]  Jacques Renaud,et al.  A sweep-based algorithm for the fleet size and mix vehicle routing problem , 2002, Eur. J. Oper. Res..

[2]  Said Salhi,et al.  Incorporating vehicle routing into the vehicle fleet composition problem , 1993 .

[3]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[4]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[5]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..

[6]  Laurence A. Wolsey,et al.  Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation , 1995, Discret. Appl. Math..

[7]  Ting-Yi Sung,et al.  An analytical comparison of different formulations of the travelling salesman problem , 1991, Math. Program..

[8]  Lou Caccetta,et al.  An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem , 2003, Transp. Sci..

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

[10]  Said Salhi,et al.  Adaptation of some Vehicle Fleet Mix heuristics , 1992 .

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

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

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

[14]  Martin Desrochers,et al.  A new heuristic for the fleet size and mix vehicle routing problem , 1991, Comput. Oper. Res..

[15]  S. S. Sengupta,et al.  The traveling salesman problem , 1961 .

[16]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

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

[18]  Ibrahim H. Osman,et al.  Tabu search variants for the mix fleet vehicle routing problem , 2002, J. Oper. Res. Soc..

[19]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[20]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

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

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

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

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

[25]  Luís Gouveia,et al.  The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints , 1999, Eur. J. Oper. Res..

[26]  Bruce L. Golden,et al.  A new heuristic for determining fleet size and composition , 1986 .

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

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

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

[30]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[31]  André Langevin,et al.  CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS , 1988 .

[32]  Hande Yaman.  The Integer Knapsack Cover Polyhedron , 2007, SIAM J. Discret. Math..

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