Towards realistic modeling of time-table information through the time-dependent approach

Electronic Notes in Theoretical Computer Science

Volumn 92, Issue , 2004, Pages 85-103

  Pyrga, Evangelia ^a,b   Schulz, Frank ^c   Wagner, Dorothea ^c   Zaroliagis, Christos ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Earliest arrival; Minimum number of transfers; Shortest path; Time dependent model; Time table information

Indexed keywords

ALGORITHMS; CALCULATIONS; CONSTRAINT THEORY; DATA ACQUISITION; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

EARLIEST ARRIVAL; MINIMUM NUMBER OF TRANSFERS; SHORTEST PATH; TIME-DEPENDENT MODEL; TIME-TABLE INFORMATION;

INFORMATION ANALYSIS;

EID: 18944385835     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.12.024     Document Type: Conference Paper

References (9)

1. Gerth Stølting Brodal and Riko Jacob. Time-dependent networks as models to achieve fast exact time-table queries. Technical Report ALCOMFT-TR-01-176, ALCOM-FT, September 2001
2. Fredman Michael, Sedgewick Robert, Sleator Daniel, Tarjan Robert. The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica. 1:1986;111-129
3. Müller-Hannemann Matthias, Weihe Karsten. Pareto shortest paths is often feasible in practice. Proceedings 5th Workshop on Algorithm Engineering. LNCS. volume 2141:2001;185-198 Springer
4. Nachtigal Karl. Time depending shortest-path problems with applications to railway networks. European Journal of Operations Research. 83:1995;154-166
5. Orda Ariel, Rom Raphael. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM. 37:(3):1990
6. Orda Ariel, Rom Raphael. Minimum weight paths in time-dependent networks. Networks. 21:1991
7. Pallottino Stefano, Scutellà Maria Grazia. Equilibrium and Advanced Transportation Modelling, chapter 11. 1998;Kluwer Academic Publishers
8. Schulz Frank, Wagner Dorothea, Weihe Karsten. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics. 5:(12):2000
9. Schulz Frank, Wagner Dorothea, Zaroliagis Christos. Using multi-level graphs for timetable information in railway systems. Proceedings 4th Workshop on Algorithm Engineering and Experiments (ALENEX 2002). LNCS. volume 2409:2001;43-59 Springer