Hierarchy decomposition for faster user equilibria on road networks

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

Volumn 6630 LNCS, Issue , 2011, Pages 242-253

  Luxen, Dennis ^a   Sanders, Peter ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA; DIJKSTRA'S ALGORITHMS; EQUILIBRIUM STATE; GRADIENT DESCENT METHOD; HANDY TOOLS; LARGER NETWORKS; NAVIGATION DEVICES; ROAD NETWORK; ROAD TRAFFIC; ROUTE PLANNING; SHORTEST PATHS COMPUTATION; SMALL NETWORKS; SPECIAL PROPERTIES; TRAFFIC INFORMATION; TRAFFIC PATTERN; TRAFFIC SITUATIONS; TWO-POINT; WEIGHTED GRAPH;

ALGORITHMS; GRAPH THEORY; ROADS AND STREETS; TRAFFIC CONTROL; MOTOR TRANSPORTATION;

MOTOR TRANSPORTATION; TRANSPORTATION;

EID: 79955830756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20662-7_21     Document Type: Conference Paper

References (31)

1. Bar-Gera, H.: Traffic assignment by paired alternative segments. Transportation Research Part B (2010)
2. Batz, V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97-105. SIAM, Philadelphia (2009)
3. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. In: ACM JEA special issue for WEA (2008)
4. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Yale University Press, New Haven (1959)
5. Branston, D.: Link capacity functions: A review. Transportation Research 10(4), 223-236 (1976)
6. Brieter, K., Eicher, C.C., Haart, V., Vigl, M.: Mit dem navi sicher in den stau. ADAC Motorwelt 3, 56-59 (2010)
7. Bruynooghe, M., Gilbert, A., Sakarovitch, M.: Une methode d'affectation du trafic. In: Proc. 4th Internat. Sympos. Theory Road Traffic (1969)
8. Bureau of Public Roads: Traffic Assignment Manual. U.S. Dept. Of Commerce,Washingtion D.C (1964)
9. Davidson, K.B.: A flow travel time relationship for use in transportation planning. Proceedings of the Australian Road Research Board 3, 183-194 (1966)
10. Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: Phast: Hardware-accelerated shortest path trees. In: 5th International Parallel and Distributed Processing Symposium, IPDPS 2011 (2011)
11. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J.,Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
12. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, STOC 2004, pp. 604-612. ACM, New York (2004)
13. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008)
14. Gentile, G.: Linear user cost equilibrium: a new algorithm for traffic assignment. submitted for publication in Transportation Research B (2010)
15. Jayakrishnan, R., Tsai,W.T., Prashker, J.N., Rajadhyaksha, S.: A faster path-based algorithm for traffic assignment. Transportation Research Record (1994)
16. Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed time-dependent contraction hierarchies. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 83-93. Springer, Heidelberg (2010)
17. Kirschner, M., Schengbier, P., Tscheuschner, T.: Speed-up techniques for the selfish step algorithm in network congestion games. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 173-184. Springer, Heidelberg (2009)
18. Marguerite, F., Wolfe, P.: An algorithm for quadratic programming. Naval Research Logistics Quaterly 3, 95-110 (1956)
19. Murchland, J.: Road network traffic distribution in equilibrium. Mathematical Models in the Social Sciences (1979)
20. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
21. Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands (1994)
22. Project OSRM, http://project-osrm.org
23. Ramming, S.M.: Network Knowledge and Route Choice. Ph.D. thesis, Massachusetts Institute of Technology (February 2002)
24. Rosenthal, R.W.: The network equilibrium problem in integers. Networks 3, 53-59 (1973)
25. Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)
26. Sheffi, Y.: Urban Transportation Networks: Equlibrium Analysis with Mathematical Programming. Prentice-Hall, Inc., Englewood Cliffs (1982)
27. Spiess, H.: Technical Note-Conical Volume-Delay Functions. Transportation Science 24(2), 153-158 (1990)
28. Sugiyama, Y., Fukui, M., Kikuchi, M., Hasebe, K., Nakayama, A., Nishinari, K., Ichi Tadaki, S., Yukawa, S.: Traffic jams without bottlenecks - experimental evidence for the physical mechanism of the formation of a jam. New Journal of Physics 10(3), 033001 (2008)
29. Unknown Authors: TMC-Stauumfahrung:Verkehrsprobleme durch Stauverlagerungen? Tech. rep., ADAC e.V (2010)
30. Vetter, C.: Fast and Exact Mobile Navigation with OpenStreetMap Data. Master's thesis, Karlsruhe Institute of Technology (2010)
31. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers 1, 325-378 (1952)