TY - GEN
T1 - Analyzing shortest and fastest paths with GIS and determining algorithm running time
AU - Erden, Turan
AU - Coskun, Mehmet Zeki
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33646583796
M3 - Conference contribution
AN - SCOPUS:33646583796
SN - 3540304886
SN - 9783540304883
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 269
EP - 278
BT - Visual Information and Information Systems - 8th International Conference, VISUAL 2005, Revised Selected Papers
T2 - 8th International Conference on Visual Information and Information Systems, VISUAL 2005
Y2 - 5 July 2005 through 5 July 2005
ER -