Improvement of a shortest routes algorithm

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn , Issue , 2007, Pages 613-617

  Lassabe, Nicolas ^a   Berro, Alain ^a   Duthen, Yves ^a  

^a UNIVERSITY OF TOULOUSE CAPITOLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTELLIGENT SYSTEMS; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; MOTOR TRANSPORTATION; ROADS AND STREETS; ROUTING ALGORITHMS; TESTING; TRAFFIC CONTROL; VEHICLE LOCATING SYSTEMS;

A-COEFFICIENT; INTELLIGENT TRANSPORTATION SYSTEMS; ITS EVALUATION; ROAD NETWORKS; SHORT-PATH; SHORTEST-PATH ALGORITHMS;

HEURISTIC PROGRAMMING;

EID: 49249118366     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2007.4357802     Document Type: Conference Paper

References (17)

1. Ahja R.K., Magnanti T.L. and Orlin J.B., Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, (1993)
2. Ahuja R.K., Mehlhorn K., Orlin J. B. and Tarjan R.E., Faster Algorithms for the Shortest Path Problem, J. Assoc. Comput. Mach., 37(2):213-223 (1990).
3. Bellmain R. E., On a Routing Problen, Q. Applied Math. 16, 87-90 (1958)
4. Cherkassky B.V., Goldberg A.V. Shortest Paths Algorithms: Theory And Experimental Evaluation, SODA: ACM-SIAM Symposium on Discrete Algorithms, (1993).
5. Cormen T.H. Leiserson C.E and Rivest R.L., Introduction to algorithms, MIT Press, Cambridge, MA, (1990).
6. Delling D., Holzer M. and Müller K., Schulz F. and Wagner D., High-Performance Multi-Level Graphs, 9th DIMACS Challenge on Shortest Paths, (2006)
7. Dijkstra E.W., A Note on Two Problemes in Connection with Graphs, Numer. Math., 1:269-271, (1959).
8. Fredman, M. L. and Tarjan R.E., Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, JACM 34, 596-615 (1987)
9. Gallo G. and S. Pallottinon, Shortest Paths Algorithms, Ann. Oper. Res. 13, 3-79 (1988).
10. Glover F., Klingman D. and Philips N. A New Polynomially Bounded Shortest Paths Algotrithm, Operations Research, 33, 65-73. (1985)
11. Goldberg A.V. Selection Problems for Algorithm Evaluation, Algorithm Engineering, 1-11 (1999).
12. Jacob R., Marathe M. and Nagel K., A Computational Study of Routing Algorithms for Realistic Transportation Networks Journal of Experimental Algorithmics (JEA), vol. 4 art. 6 (1999).
13. Pape, U., Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem, Math Program. 7, 212-222 (1974).
14. Sanders P. and Schultes D., Robust, Almost Constant Time Shortest-Path Queries in Road Networks, 9th DIMACS Challenge on Shortest Paths, (2006)
15. Zhan, F. B., Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures, Journal of Geographic Information and Decision Analysis, 1(1), 69-82. (1997)
16. Zhan, F.B., and Noon C.E., Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transportation Science. 32, 65-73 (1998).
17. Zhan F. B. and Noon C.E., A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths, Journal of Geographic Information and Decision Analysis 4(2): 1-11, (2000)