A new mixed integer linear model for a rich vehicle routing problem with docking constraints

A new mixed integer linear model for a rich vehicle routing problem with docking constraints

0.00 Avg rating0 Votes
Article ID: iaor20108908
Volume: 181
Issue: 1
Start Page Number: 337
End Page Number: 358
Publication Date: Dec 2010
Journal: Annals of Operations Research
Authors: ,
Keywords: time windows
Abstract:

In this paper we address a rich vehicle routing problem that arises in real-life applications. Among other aspects we consider time windows, simultaneous delivery and pick-up at customer locations and multiple use of vehicles. To guarantee a coordinated material flow at the depot, we include the timed allocation of vehicles to loading bays at which the loading and unloading activities can occur. The resulting vehicle routing problem is formulated as a two-index vehicle-flow model which integrates the routing under real-life conditions and the assignment of vehicles to loading bays at the depot. We use CPLEX 11.0 to solve medium-sized instances that are derived from the extended Solomon test set. The selective implementation of preprocessing techniques and cutting planes improves the solver performance significantly.

Reviews

Required fields are marked *. Your email address will not be published.