Multi-criteria Shortest Paths in Time-Dependent Train Networks-Reference-Cited by-同舟云学术

Multi-criteria Shortest Paths in Time-Dependent Train Networks

Published: Issue: Volume: Page:347-361
ISSN:
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Disser Yann,Müller–Hannemann Matthias,Schnee Mathias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-68552-4_26.pdf

Reference18 articles.

1. HaCon web-site (2007), http://www.hacon.de/hafas/konzept.shtml

2. Müller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Annals of Operations Research 147, 269–286 (2006)

3. Pallottino, S., Scutellà, M.G.: Shortest path algorithms in transportation models: Classical and innovative aspects. In: Equilibrium and Advanced Transportation Modelling, Kluwer Academic Publishers, Dordrecht (1998)

4. Schulz, F., Wagner, D., Weihe, K.: Dijkstra’s algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Experimental Algorithmics, Article 12, 5 (2000)

5. Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics (JEA) 12, 2.4 (2007)

Cited by 55 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Data to Routes: A Comprehensive Approach to Public Transport Line Routing;2024 Smart City Symposium Prague (SCSP);2024-05-23

2. Label Constrained Reachability Queries on Time Dependent Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Price optimal routing in public transportation;EURO Journal on Transportation and Logistics;2024

4. ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning;Transportation Science;2023-11

5. Optimisation of seat reservations on trains to minimise transfer distances;Operational Research;2023-07-17