论文信息 - A generalized threshold algorithm for the shortest path problem with time windows

A generalized threshold algorithm for the shortest path problem with time windows

In this paper, we present a new labeling algorithm for the shortest path problem with time windows (SPPTW). It is generalized from the threshold algorithm for the unconstrained shortest path problem. Our computational experiments show that this generalized threshold algorithm outperforms a label setting algorithm for the SPPTW on a set of randomly generated test problems. The average running time of the new algorithm is about 40% less than the label setting algorithm, which is today the best algorithm based on published experimental evidence.

Warren B. Powell | Zhi-Long Chen

[1] Dimitri P. Bertsekas,et al. A simple and fast label correcting algorithm for shortest paths , 1993, Networks.

[2] Giorgio Gallo,et al. Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[3] M. Desrochers,et al. A reoptimization algorithm for the shortest path problem with time windows , 1988 .

[4] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.

[5] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[7] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .

[8] Moshe Dror,et al. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[9] U. Pape,et al. Algorithm 562: Shortest Path Lengths [H] , 1980, TOMS.

[10] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[11] M. Desrochers,et al. A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[12] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .