We present a branch-and-cut-and-price algorithm for the exact solution of a variation of the vehicle routing problem with time windows in which the transportation fleet is made by vehicles with different capacities and fixed costs, based at different depots. We illustrate different pricing and cutting techniques and we present an experimental evaluation of their combinations. Computational results are reported on the use of the algorithm both for exact optimization and as a heuristic method.
A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows / A. Bettinelli, A. Ceselli, G. Righini. - In: TRANSPORTATION RESEARCH. PART C, EMERGING TECHNOLOGIES. - ISSN 0968-090X. - 19:5(2011 Aug), pp. 723-740. ((Intervento presentato al 4. convegno International Workshop on Freight Transportation and Logistics tenutosi a Cesme Izmir nel 2009.
A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
A. BettinelliPrimo
;A. CeselliSecondo
;G. RighiniUltimo
2011
Abstract
We present a branch-and-cut-and-price algorithm for the exact solution of a variation of the vehicle routing problem with time windows in which the transportation fleet is made by vehicles with different capacities and fixed costs, based at different depots. We illustrate different pricing and cutting techniques and we present an experimental evaluation of their combinations. Computational results are reported on the use of the algorithm both for exact optimization and as a heuristic method.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
