Analyzing shortest and fastest paths with GIS and determining algorithm running time

  • Authors:

  • Turan Erden;Mehmet Zeki Coskun

  • Affiliations:

  • Civil Engineering Faculty, Department of Geodesy and Photogrammetry, Division of Surveying Techniques, ITU, Maslak, Istanbul;Civil Engineering Faculty, Department of Geodesy and Photogrammetry, Division of Surveying Techniques, ITU, Maslak, Istanbul

  • Venue:
  • VISUAL'05 Proceedings of the 8th international conference on Visual Information and Information Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.