Using dijkstra algorithm in calculating alternative shortest paths for public transportation with transfers and walking case study: Ankara
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
In this study, the possibility of using the Dijkstra algorithm in calculate shortest paths and using GIS to connect transport lines for increasing efficiency in the accessibility to shortest paths was studied. The results are presented as spatial maps. Basically, the research question this thesis addresses is: "Can Iraqi authorities use graph theory and shortest path algorithm to build a system to develop a public transit system including exchanging lines and walking, based on the experiences of transport systems in Turkey?" As a research methodology, Ankara's mass transportation has been examined as considerable similarities are found between Ankara and Baghdad in terms of population in number and in density. Hence, an introduction is given on both cities. Additionally, information technologies to investigate and promote public transport systems in the literature are visited. As gathering spatial data has required considerable time and resources, sample datasets of Ankara's mass transport system are used to run demonstrative applications to highlight potential problems in the technical side. The surveyed literature also includes graph theory, transportation network, shortest path problems and GIS usage in the public transportation. The used MapInfo Professional and MapBasic software tools are available on the market. Specific application programs are developed in MapBasic to ease analyses and implementation in MapInfo. Additionally, programs are coded in C++ to apply Dijkstra algorithm to feed data to GIS software. Limitations are also reported to open further research avenues including other algorithms for path optimization. The results show that Dijkstra algorithm can be successfully applied to reform and design mass transportation systems. An unfortunate finding underlined that it is too early to jump to application design as the primary problem is to collect reliable and up to date spatial data of Baghdad.
Author
Haitham Latif Hassan Al-tameemi
Institution
How to Cite
Haitham Latif Hassan Al-tameemi (Master Thesis). Using dijkstra algorithm in calculating alternative shortest paths for public transportation with transfers and walking case study: Ankara, 2014, Çankaya University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Çankaya University
- Investigation of amazon and google for fault tolerance strategies in cloud computing services(2015)
- Investigation in MYSQLdatabase and NEO4J database(2015)
- Principal intervention in Civil Procedure Law(2018)
- Exchange rate and inflation relationship: The case of Turkey(2023)
- Effects of the economic news on herd behavior(2023)
- Experimental analysis of effects of different network parameters on TCP / IP networks(2025)