In this article we present a branch-and-price-and-cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing problem, where each customer is visited exactly once, in the SDVRP a customer may be visited any number of times. The exact method we propose is based on a decomposition of the problem where the possible routes, with the delivery quantities, are generated in the subproblem. The generated routes are also used to find a heuristic solution to the problem. We consider both the case where the fleet of vehicles is unlimited and the case where the fleet is limited to the minimum possible number of vehicles. We solve to optimality instances with larger size with respect to previous approaches, find new best solutions to several benchmark instances and reduce the optimality gap on most of the benchmark instances.
A column generation approach for the split delivery vehicle routing problem / C. Archetti, N. Bianchessi, M.G. Speranza. - In: NETWORKS. - ISSN 0028-3045. - 58:4(2011), pp. 241-254.
|Titolo:||A column generation approach for the split delivery vehicle routing problem|
|Parole Chiave:||split delivery vehicle routing problem; unlimited and limited fleet; column generation; branch-and-price-and-cut method|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
Settore MAT/09 - Ricerca Operativa
|Data di pubblicazione:||2011|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1002/net.20467|
|Appare nelle tipologie:||01 - Articolo su periodico|
File in questo prodotto:
|A-Column-Generation-Approach-for-the-Split-Delivery-Vehicle-Routing-Problem_Networks-11_author-copy.pdf||Publisher's version/PDF||Administrator Richiedi una copia|