Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

Hande Yaman (hyamanbilkent.edu.tr)

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: Heterogeneous Vehicle Routing Problem, Mix Fleet, Valid Inequalities, Lifting, Projection

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: To appear in Mathematical Programming.

Download:

Entry Submitted: 11/18/2004
Entry Accepted: 11/18/2004
Entry Last Modified: 06/21/2005

Modify/Update this entry