Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10359355 | Transportation Research Part C: Emerging Technologies | 2011 | 18 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Andrea Bettinelli, Alberto Ceselli, Giovanni Righini,