Dijkstra’s algorithm on-line: An empirical case study from public railroad transport

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1668, Issue , 1999, Pages 110-123

  Schulz, Frank ^a   Wagner, Dorothea ^a   Weihe, Karsten ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

RAILROADS; TRAVEL TIME;

CUSTOMER QUERIES; DIJKSTRA'S ALGORITHMS; EMPIRICAL CASE STUDIES; INFORMATION SERVERS; OPTIMIZATION CRITERIA; PILOT STUDIES; S-ALGORITHMS; SHORTEST PATH;

OPTIMIZATION;

EID: 22644448416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48318-7_11     Document Type: Conference Paper

References (14)

1. 7
2. K. Ishikawa, M. Ogawa, S. Azume, and T. Ito: Map Navigation Software of the Electro Multivision of the’91 Toyota Soarer. IEEE Int. Conf. Vehicle Navig. Inform. Syst. (VNIS’91), 463–473.
3. R. Agrawal and H. Jagadish: Algorithms for Searching Massive Graphs. IEEE Transact. Knowledge and Data Eng. 6 (1994), 225–238.
4. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: Network Flows. Prentice–Hall, 1993.
5. A. Car and A. Frank: Modelling a Hierarchy of Space Applied to Large Road Networks. Proc. Int. Worksh. Adv. Research Geogr. Inform. Syst. (IGIS’94), 15–24.
6. B.V. Cherkassky, A.V. Goldberg und T. Radzik: Shortest Paths Algorithms: Theory and Experimental Evaluation. Mathematical Programming 73 (1996), 129–174.
7. S. Shekhar, A. Kohli, and M. Coyle: Path Computation Algorithms for Advanced Traveler Information System (ATIS). Proc. 9th IEEE Int. Conf. Data Eng. (1993), 31–39.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest: Introduction to Algorithms. MIT Press and McGraw–Hill, 1994.
9. S. Jung and S. Pramanik: HiTi Graph Model of Topographical Road Maps in Navigation Systems. Proc. 12th IEEE Int. Conf. Data Eng. (1996), 76–84.
10. T. Lengauer: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, 1990.
11. J. Shapiro, J. Waxman, and D. Nir: Level Graphs and Approximate Shortest Path Algorithms. Network 22 (1992), 691–717.
12. T. Preuss and J.-H. Syrbe: An Integrated Traffic Information System. Proc. 6th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA’97).
13. K. Weihe: Reuse of Algorithms — Still a Challenge to Object–Oriented Programming. Proc. 12th ACM Symp. Object–Oriented Programming, Systems, Languages, and Applications (OOPSLA’97), 34–48.
14. K. Weihe, U. Brandes, A. Liebers, M. Müller–Hannemann, D. Wagner, and T. Willhalm: Empirical Design of Geometric Algorithms. To appear in the Proc. 15th ACM Symp. Comp. Geometry (SCG’99).