Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

Authors:
Hande Yaman
Affiliations:
Department of Industrial Engineering, Bilkent University, 06800, Ankara, Turkey
Venue:
Mathematical Programming: Series A and B
Year:
2006

Citing 0
Cited 6

Two memetic algorithms for heterogeneous fleet vehicle routing problems

Engineering Applications of Artificial Intelligence
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Energy minimizing vehicle routing problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping

Transportation Science
An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.