Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
β Scribed by Hande Yaman
- Publisher
- Springer-Verlag
- Year
- 2005
- Tongue
- English
- Weight
- 261 KB
- Volume
- 106
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
## Abstract In the wellβknown vehicle routing problem (VRP), a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a mixed fleet of vehicles, charac