FINDING SHORTEST PATH BASING ON DIJKSTRA'S ALGORITHM FOR BAGHDAD UNIVERSITIES BY USING GEOGRAPHIC INFORMATION SYSTEM APPLICATIONS
DOI:
https://doi.org/10.25212/lfu.qzj.2.2.30الكلمات المفتاحية:
Route analysis, GIS applications, Service area analysis, and shortest path analysis.الملخص
As the population increases, the transport network becomes difficult and enormous. Finding demanded location is becomes a troublesome task. After finding, a location individual gets confused to access that location because of the routes contains several modes. This drawback is even more substantial for those who may have to go to strange parts of the city. Just in case of the universities, it is troublesome to find the specified university and it's the shortest path to access therefore takes longer to access it. In this paper solved this problem by find the shortest path from the user location to the university or between two universities. The area for study is Baghdad city and the coordinate for universities is obtained from Google earth program. The ArcGIS software system used and also the Dijkstra’s algorithm to produce the shortest path from one location to a different and ArcGIS cloud publisher for publish map from ArcMp to ArcGIS cloud and then can be edited and updated
التنزيلات
المراجع
Dabhade, Amrapali C., and K. V. Kale, GIS Based Health Care Information System for Aurangabad City. International Journal of Engineering and Innovative Technology, 2014. 4(1).
Bhanumurthy, V., et al. , Route analysis for decision support system in emergency management through GIS technologies. Int. J. Adv. Eng. Glob. Technol, 2015. 3(2):P. 345- 350.
Zhang, Jiyi, et al. , Shortest path algorithm in GIS network analysis based on Clifford algebra. Proceedings of The 2nd International Conference on Future Computer and Communication. Wuhan: Wuhan University. 2010.
Al Obaidy, Abdul Hameed MJ, and Athmar AM Al Mashhadi. Heavy metal contaminations in urban soil within Baghdad City. JORNAL OF ENVIRONMENTAL PROTECTION, 2013. 4:72-82
Belcher, Johnny, et al. Bus Routing Algorithms: Application to a Rural School District. Working Paper No. 27." Appalachian Collaborative Center for Learning, Assessment, and Instruction in Mathematics (ACCLAIM), Ohio University (2005).
Yomralioglu, T. "Cografi Bilgi Sistemleri Temel Kavramlar ve Uygulamalar (Geographic Information Systems Basic Concepts and Applications)." Karadeniz Technical University, Trabzon (2002).
Kai, Ni, Zhang Yao-ting, and Ma Yue-peng. Shortest Path Analysis Based on Dijkstra's Algorithm in Emergency Response System. Indonesian Journal of Electrical Engineering and Computer Science, 2014. 12(5):P. 3476-3482.
Winn, Michael T. A Road Network Shortest Path Analysis: Applying Time-varying Travel-time Costs for Emergency Response Vehicle Routing, Davis County, Utah: a Thesis Presented to the Department of Humanities and Social Sciences in Candidacy for the Degree of Master of Science. 2014.
Gupta, Nitin, et al. , Applying Dijkstra’s Algorithm in Routing Process. International Journal of New Technology and Research (IJNTR), 2016. 2(5):P.122-124.
التنزيلات
منشور
كيفية الاقتباس
إصدار
القسم
الرخصة
الحقوق الفكرية (c) 2017 Roaa Ebada Saeed, Amer Saleem Elameer, Rafah Shahab Alhamdani
هذا العمل مرخص بموجب Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Qalaai Zanist Journal allows the author to retain the copyright in their articles. Articles are instead made available under a Creative Commons license to allow others to freely access, copy and use research provided the author is correctly attributed.
Creative Commons is a licensing scheme that allows authors to license their work so that others may re-use it without having to contact them for permission
