Article ID Journal Published Year Pages File Type
1143466 Operations Research Letters 2006 10 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The multiple TSP with time windows: vehicle bounds based on precedence graphs
Authors
, ,