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 bound
β¦ LIBER β¦
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.
π SIMILAR VOLUMES
Formulations and Valid Inequalities for
β
Hande Yaman
π
Article
π
2005
π
Springer-Verlag
π
English
β 261 KB
Valid inequalities for the fleet size an
β
Roberto Baldacci; Maria Battarra; Daniele Vigo
π
Article
π
2009
π
John Wiley and Sons
π
English
β 218 KB
## 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
New formulations and valid inequalities
β
Sophie Dewez; Martine LabbΓ©; Patrice Marcotte; Gilles Savard
π
Article
π
2008
π
Elsevier Science
π
English
β 179 KB
Path inequalities for the vehicle routin
β
Brian Kallehauge; Natashia Boland; Oli B.G. Madsen
π
Article
π
2007
π
John Wiley and Sons
π
English
β 233 KB
A robust branch-cut-and-price algorithm
β
Artur Pessoa; Eduardo Uchoa; Marcus Poggi de AragΓ£o
π
Article
π
2009
π
John Wiley and Sons
π
English
β 147 KB
π 1 views
Classical and modern heuristics for the
β
Gilbert Laporte; Michel Gendreau; Jean-Yves Potvin; FrΓ©dΓ©ric Semet
π
Article
π
2000
π
John Wiley and Sons
π
English
β 154 KB