| Article ID: | iaor20061847 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 111 |
| End Page Number: | 120 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Krishnamurti Ramesh, Mitrovic-Minic Snetana |
| Keywords: | vehicle routing & scheduling |
Vehicle bounds for the multiple traveling salesman problem with time windows are found by covering two precedence graphs with the minimum number of paths. Instances with tight bounds are presented, as well as instances for which the bounds are loose. The similarity of these instances is discussed.