论文信息 - FINDING ALTERNATIVES TO THE BEST PATH

FINDING ALTERNATIVES TO THE BEST PATH

Advanced Traveler Information Systems (ATIS) and Advanced Traffic Management Systems (ATMS) often require non-traditional path generation methods. The aim of this paper is to develop an algorithm for finding alternatives to the best path between a given origin and destination. It discusses a constrained shortest path problem that can be used to generate alternative paths. An efficient algorithm for generating such paths is also discussed and some initial computational studies are presented.

David Bernstein | K Scott | D. Bernstein | K. Scott

[1] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[2] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

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

[4] D E Kaufman,et al. FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION , 1993 .

[5] Hani S. Mahmassani,et al. Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[6] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[7] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[8] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.

[9] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.