| Article ID: | iaor20082534 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 374 |
| End Page Number: | 378 |
| Publication Date: | May 2007 |
| Journal: | Operations Research Letters |
| Authors: | Sexton Thomas R., Lewis Herbert F. |
| Keywords: | heuristics |
The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.