Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Information Technology and Management Science

The Journal of Riga Technical University

1 Issue per year

Open Access
Online
ISSN
2255-9094
See all formats and pricing
More options …

Suitability Analysis of Routing Algorithms for Web-based Transportation Planning

Davis Jaunzems / Arnis Lektauers
Published Online: 2014-01-25 | DOI: https://doi.org/10.2478/itms-2013-0012

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

  • [1] 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.CrossrefGoogle Scholar

  • [2] 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/.Google Scholar

  • [3] 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.CrossrefGoogle Scholar

  • [4] R. Bellman, “On a Routing Problem,” Q. Appl. Math., vol. 16, pp. 87-90, 1958.Google Scholar

  • [5] R. W. Floyd, “Algorithm 97: Shortest path,” Commun. ACM, vol. 5, no. 6, p. 345-, 1962.Google Scholar

  • [6] S. Warshall, “A Theorem on Boolean Matrices,” J. ACM, vol. 9, no. 1, pp. 11-12, 1962.Google Scholar

  • [7] 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.Google Scholar

  • [8] 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.Google Scholar

  • [9] 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.Google Scholar

  • [10] 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.Google Scholar

  • [11] OpenStreetMap, “Atvērtā Wiki pasaules karte.” [Online]. Available: http://www.openstreetmap.org. [Accessed: Sep. 25, 2013]Google Scholar

  • [12] JGraphT, “Java mathematical graph-theory objects and algorithms,” 2013. [Online]. Available: http://jgrapht.org. [Accessed: Sep. 25, 2013]Google Scholar

About the article

Davis Jaunzems

Davis Jaunzems is a master’s student majoring in information technology at Riga Technical University. Since 2009 he has been working in software development companies and at the same time working on projects focusing on large data processing and analysis. He has also participated in many events aimed at building prototypes with the latest technologies. His professional interests include mobile technologies, data analysis and geographical information systems.

Arnis Lektauers

Arnis Lektauers, Dr.sc.ing., is an Assistant Professor at the Department of Modelling and Simulation of Riga Technical University (RTU). His main professional interests include the development of interactive hybrid modelling and simulation algorithms with an application to complex systems analysis and the research of industrial, economic, ecological and sustainable development problems. A. Lektauers is the Secretary of Latvia Section of the Institute of Electrical and Electronics Engineers (IEEE), a member of the Council of RTU Faculty of Computer Science and Information Technology, and a member of Latvian Simulation Society, System Dynamics Society and European Social Simulation Association (ESSA). He is the author of 1 textbook and more than 30 papers in scientific journals and conference proceedings in the field of Information Technology.


Published Online: 2014-01-25

Published in Print: 2013-12-01


Citation Information: Information Technology and Management Science, Volume 16, Issue 1, Pages 79–84, ISSN (Online) 2255-9094, ISSN (Print) 2255-9086, DOI: https://doi.org/10.2478/itms-2013-0012.

Export Citation

This content is open access.

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Grzegorz Sierpiński and Marcin Staniek
Transportation Research Procedia, 2017, Volume 27, Page 640

Comments (0)

Please log in or register to comment.
Log in