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.
A column generation algorithm for the vehicle routing problem with soft time windows / F. Liberatore, G. Righini, M. Salani. - In: 4OR. - ISSN 1619-4500. - 9:1(2011), pp. 49-82.
Titolo: | A column generation algorithm for the vehicle routing problem with soft time windows |
Autori: | RIGHINI, GIOVANNI (Secondo) SALANI, MATTEO (Ultimo) |
Parole Chiave: | Branch-and-price; Column generation; Combinatorial optimization; Soft time windows; Vehicle routing problem |
Settore Scientifico Disciplinare: | Settore MAT/09 - Ricerca Operativa |
Data di pubblicazione: | 2011 |
Rivista: | |
Tipologia: | Article (author) |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/s10288-010-0136-6 |
Appare nelle tipologie: | 01 - Articolo su periodico |