Suitability Analysis of Routing Algorithms for Web-based Transportation Planning
Abstract
The routing of vehicles in complex urban or regional systems is a task that needs to be solved in numerous transportation-oriented applications. This paper describes the process and approaches used for routing algorithm analysis emphasizing transportation planning in interactive web-based planning, analysis and simulation solutions. The objectives of the presented research are to examine existing routing algorithms used for finding the shortest path between the nodes in transport networks and to analyse the implementation possibilities and efficiency of routing algorithms in web-based geographical information systems.
Keywords: |
Routing algorithms; transportation planning; web-based geographical information systems
|
Full Text: |
References
T. Toledo, O. Cats, W. Burghout, and H. N. Koutsopoulos, “Mesoscopic Simulation for Transit Operations,” Transp. Res. Part C Emerg. Technol., vol. 18, no. 6, pp. 896–908, Dec. 2010.
D. Joyner, M. Van Nguyen, and D. Phillips, Algorithmic Graph Theory and Sage, Version 0.8-r1991, 2013, p. 304. [E-book] Available: https://code.google.com/p/graphbook/.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths,” Syst. Sci. Cybern. IEEE Trans., vol. 4, no. 2, pp. 100–107, 1968.
R. Bellman, “On a Routing Problem,” Q. Appl. Math., vol. 16, pp. 87– 90, 1958.
R. W. Floyd, “Algorithm 97: Shortest path,” Commun. ACM, vol. 5, no. 6, p. 345–, 1962.
S. Warshall, “A Theorem on Boolean Matrices,” J. ACM, vol. 9, no. 1, pp. 11–12, 1962.
M. J. d. Smith, M. F. Goodchild, and P. A. Longley, Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, 3rd Revise. Matador, 2009, p. 516.
K. Gutenschwager, A. Radtke, S. Volker, and G. Zeller, “The shortest path: Comparison of different approaches and implementations for the automatic routing of vehicles,” in Simulation Conference (WSC), Proceedings of the 2012 Winter, 2012, pp. 1–12.
P. Sanders and D. Schultes, “Engineering Highway Hierarchies,” in in Algorithms – ESA 2006 SE - 71, vol. 4168, Y. Azar and T. Erlebach, Eds. Springer Berlin Heidelberg, 2006, pp. 804–816.
R. Geisberger, P. Sanders, D. Schultes, and D. Delling, “Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks,” in in Experimental Algorithms SE - 24, vol. 5038, C. McGeoch, Ed. Springer Berlin Heidelberg, 2008, pp. 319–333.
OpenStreetMap, “Atvērtā Wiki pasaules karte.” [Online]. Available: http://www.openstreetmap.org. [Accessed: Sep. 25, 2013].
JGraphT, “Java mathematical graph-theory objects and algorithms,” 2013. [Online]. Available: http://jgrapht.org. [Accessed: Sep. 25, 2013].
Refbacks
- There are currently no refbacks.
Copyright (c) 2013 Davis Jaunzems, Arnis Lektauers
This work is licensed under a Creative Commons Attribution 4.0 International License.