Loading...
research article
A column generation algorithm for the vehicle routing problem with soft time windows
The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visited in a specified time window. We consider the case in which time window constraints are relaxed into "soft" constraints, that is penalty terms are added to the solution cost whenever a vehicle serves a customer outside of his time window. We present a branch-and-price algorithm which is the first exact optimization algorithm for this problem
Type
research article
Web of Science ID
WOS:000288506700003
Authors
Publication date
2011
Published in
Volume
9
Issue
1
Start page
49
End page
82
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
September 30, 2010
Use this identifier to reference this record