论文信息 - The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles

The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles

This paper deals with nding a lower and an upper bound for the minimum number of vehicles needed to serve all locations of the multiple traveling salesman problem with time windows. The two types of precedence graphs are introduced { the start-time precedence graph and the end-time precedence graph. The bounds are generated by covering the precedence graph with minimum number of paths. Instances for which bounds are tight are presented, as well as instances for which bounds can be arbitrary bad. The closeness of such instances is discussed.

Ramesh Krishnamurti | Ramesh Krishnamurti | Sne zana Mitrovi

[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[2] L. R. Foulds,et al. Digraphs: Theory and Techniques , 1980 .

[3] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[4] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .

[7] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[8] Marius M. Solomon,et al. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[9] W. Trotter,et al. Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[10] Gilbert Laporte,et al. The dynamic pickup and delivery problem with time windows , 2001 .