Parallel computation of best connections in public transportation networks

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010

Volumn , Issue , 2010, Pages

  Delling, Daniel ^a   Katz, Bastian ^b   Pajor, Thomas ^b  

^a MICROSOFT RESEARCH   (United States)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROBLEMS; LOS ANGELES; MULTI CORE; NOVEL ALGORITHM; PARALLEL COMPUTATION; PARALLELIZATIONS; PIECE-WISE LINEAR FUNCTIONS; PUBLIC TRANSPORTATION NETWORKS; ROUTE PLANNING; SEARCH PROBLEM; SETTING PROPERTIES; SPECIAL CLASS; SPEED-UPS; TIME FUNCTION; TIME-DEPENDENT; TIME-TABLE INFORMATION;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; PIECEWISE LINEAR TECHNIQUES; SERVERS;

TRANSPORTATION ROUTES;

EID: 77953990268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2010.5470345     Document Type: Conference Paper

References (29)

1. D. Delling, P. Sanders, D. Schultes, and D. Wagner, "Engineering Route Planning Algorithms," in Algorithmics of Large and Complex Networks, ser. Lecture Notes in Computer Science, J. Lerner, D. Wagner, and K. A. Zweig, Eds. Springer, 2009, vol.5515, pp. 117-139.
2. R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner, "Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm," in Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), ser. Lecture Notes in Computer Science, C. C. McGeoch, Ed., vol.5038. Springer, June 2008, pp. 303-318.
3. B. C. Dean, "Continuous-Time Dynamic Shortest Path Algorithms," Master's thesis, Massachusetts Institute of Technology, 1999.
4. E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, "Efficient Models for Timetable Information in Public Transportation Systems," ACM Journal of Experimental Algorithmics, vol.12, p. Article 2.4, 2007.
5. A. Orda and R. Rom, "Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length," Journal of the ACM, vol.37, no.3, pp. 607-625, 1990.
6. Y. Disser, M. Muller-Hannemann, and M. Schnee, "Multi- Criteria Shortest Paths in Time-Dependent Train Networks," in Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), ser. Lecture Notes in Computer Science, C. C. McGeoch, Ed., vol.5038. Springer, June 2008, pp. 347-361.
7. D. Delling, "Time-Dependent SHARC-Routing," Algorithmica, July 2009, special Issue: European Symposium on Algorithms 2008. [Online]. Available: http://www.springerlink.com/content/f464667j140jx36h
8. R. Bauer, D. Delling, and D. Wagner, "Experimental Study on Speed-Up Techniques for Timetable Information Systems," in Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07), C. Liebchen, R. K. Ahuja, and J. A. Mesa, Eds. Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany, 2007, pp. 209-225. [Online]. Available: http://drops. dagstuhl.de/opus/volltexte/2007/1169/
9. D. Delling, T. Pajor, and D. Wagner, "Engineering Time-Expanded Graphs for Faster Timetable Information," in Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (AT- MOS'08), ser. Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany, September 2008.
10. R. C. Paige and C. P. Kruskal, "Parallel algorithms for shortest path problems," 1985, pp. 553-556.
11. J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan, "Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation," Comm. ACM, vol.31, no.11, pp. 1343-1354, 1988.
12. K. M. Chandy and J. Misra, "Distributed computation on graphs: Shortest path algorithms," Comm. ACM, vol.25, no.11, pp. 833-837, 1982.
13. K. V. S. Ramarao and S. Venkatesan, "On finding and updating shortest paths distributively," J. Algorithms, vol.13, pp. 235-257, 1992.
14. P. Adamson and E. Tick, "Greedy partitioned algorithms for the shortest path problem," International Journal of Parallel Programming, vol.20, pp. 271-298, 1991.
15. J. L. Traff, "An experimental comparison of two distributed single-source shortest path algorithms," Parallel Computing, vol.21, pp. 1505-1532, 1995.
16. U. Meyer and P. Sanders, "A-Stepping : A Parallel Single Source Shortest Path Algorithm," in Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98), ser. Lecture Notes in Computer Science, vol.1461, 1998, pp. 393-404.
17. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak, "An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances," in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07). SIAM, 2007, pp. 23-35.
18. M. R. Hribar, V. E. Taylor, and D. E. Boyce, "Implementing parallel shortest path for parallel transportation applications," Parallel Computing, vol.27, pp. 1537-1568, 2001.
19. D. Delling and D. Wagner, "Time-Dependent Route Planning," in Robust and Online Large-Scale Optimization, ser. Lecture Notes in Computer Science, R. K. Ahuja, R. H. Mohring, and C. Zaroliagis, Eds. Springer, 2009, vol.5868, pp. 207-230.
20. D. Delling, T. Pajor, and D. Wagner, "Accelerating Multi- Modal Route Planning by Access-Nodes," in Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), ser. Lecture Notes in Computer Science, A. Fiat and P. Sanders, Eds., vol.5757. Springer, September 2009, pp. 587-598.
21. J. MacQueen, "Some Methods for Classification and Analysis of Multivariate Observations," in Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1967, pp. 281-297.
22. F. Schulz, D. Wagner, and K. Weihe, "Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport," in Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99), ser. Lecture Notes in Computer Science, vol.1668. Springer, 1999, pp. 110-123. [Online]. Available: http://portal.acm.org/citation.cfm?id=720630
23. R. Geisberger, P. Sanders, D. Schultes, and D. Delling, "Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks," in Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), ser. Lecture Notes in Computer Science, C. C. McGeoch, Ed., vol.5038. Springer, June 2008, pp. 319-333.
24. O'ahu Transit Services, Inc., "http://www.thebus.org," 1971.
25. Los Angeles County Metropolitan Transportation Authority, "http://www.metro.net," 1993.
26. Washington Metropolitan Area Transit Authority, "http:// www.wmata.com," 1967.
27. Google Transit Data Feed, "http://code.google.eom/p/ googletransitdatafeed/," 2009.
28. HaCon - Ingenieurgesellschaft mbH, "http://www.hacon.de," 2008.
29. M. Muller-Hannemann, M. Schnee, and L. Frede, "Efficient On-Trip Timetable Information in the Presence of Delays," in Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (AT- MOS'08), ser. Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany, September 2008.