Formulations and valid inequalities for the heterogeneous vehicle routing problem
Author(s)
Date
2006Source Title
Mathematical Programming
Print ISSN
0025-5610
Electronic ISSN
1436-4646
Publisher
Springer
Volume
106
Issue
2
Pages
365 - 390
Language
English
Type
ArticleItem Usage Stats
211
views
views
799
downloads
downloads
Abstract
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.
Keywords
Linear programmingProblem solving
Heterogeneous vehicle routing problem
Mix fleet
Valid inequalities
Lifting
Projection