Abstract
In this paper, a few tests have been performed for determining optimum and faster path in the networks. Determining the shortest or least cost route is one of the essential tasks that most organizations must perform. Necessary software based on CAD has been developed to help transportation planning and rescue examinations in the scope of this research. Two analyses have been performed by using Dijkstra algorithm. The first one is the shortest path which only takes into account the length between any two nodes. The second is the fastest path by introducing certain speeds into the paths between the nodes in certain times. A case study has been carried out for a selected region in Istanbul to check the performance of the software. After checking the performance of the software, running time of used algorithm was examined. According to the established networks, which have different nodes, the behaviors of algorithm running time were determined separately. Finally, the most appropriate curve was fitted by using CurveExpert 1.3 program according to algorithm running times in different networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellman, R.E.: On a routing Problem. Quart. Appl. Math. 16, 87–90 (1958)
Chabini, I.: Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time. Transportation Research record 1645, 170–175 (1998)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest Paths Algorithms: Theory and Experimental Evaluation, Symposium on Discrete Algorithms. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete Algorithms, pp. 516–525. Arlington Virginia, United States (1994)
Davis, B.: GIS: A Visual Approach. OnWord Press, Santa Fe (1996)
Dijkstra, E.W.: A note on Two Problems in Connection with Graphs. Numer. Math., 269–271 (1959)
Erden, T.: Emergency Planning in Metropolitan Cities by GIS. Master Thesis. I.T.U. Institute of Science and Technology Istanbul (2001)
Erden, T., Coskun, M.Z.: Emergency Planning in Metropolitan Cities by GIS. In: International Symposium on Geodetic, Photogrammetric and Satellite Technologies-Development and Integrated Applications, Sofia, November 8–9, pp. 367–374 (2001)
Husdal, J.: Fastest Path Problems in Dynamic Transportation Networks. University of Leicester, UK (2000)
John Morris’s homepage (1998), http://ciips.ee.uwa.edu.au/~morris/courses/PLD210/dijkstra.html
Kreyszig, E.: Advanced Engineering Mathematics, 7th edn. John Wiley&Sons, Inc., New York (1993)
Meyer, U.: Average-case complexity of single-source shortest paths algorithms: lower and upper bounds. Journal of Algorithms 48, 91–134 (2003)
Shibuya, T.: Computing the n x m Shortest Paths Efficiently. The ACM Journal of Experimental Algorithmics 5/9 (2000) ISSN 1084-6654
Star., J., Estes, J.: Geographical Information Systems: An Introduction. Printice Hall, New Jersey (1990)
Yomralıoglu, T.: GIS: Fundamental Terms and Applications, Istanbul (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erden, T., Coskun, M.Z. (2006). Analyzing Shortest and Fastest Paths with GIS and Determining Algorithm Running Time. In: Bres, S., Laurini, R. (eds) Visual Information and Information Systems. VISUAL 2005. Lecture Notes in Computer Science, vol 3736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590064_24
Download citation
DOI: https://doi.org/10.1007/11590064_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30488-3
Online ISBN: 978-3-540-32339-6
eBook Packages: Computer ScienceComputer Science (R0)