| Article ID: | iaor20115217 |
| Volume: | 19 |
| Issue: | 5 |
| Start Page Number: | 723 |
| End Page Number: | 740 |
| Publication Date: | Aug 2011 |
| Journal: | Transportation Research Part C |
| Authors: | Righini Giovanni, Ceselli Alberto, Bettinelli Andrea |
| Keywords: | time windows, branch and price |
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.