Shortest Path Analysis Based on Dijkstra's Algorithm in Emergency Response System

Ni Kai, Zhang Yao-ting, Ma Yue-peng

Abstract


In emergency situations, finding suitable routes to reach destination is critical issue. The shortest path problem is one of the well-known and practical problems in computer science, networking and other areas. This paper presents an overview on shortest path analysis for an effective emergency response mechanism to minimize hazardous events. Both graph theory and network analysis in GIS was discussed for the purpose of modeling and analyzing traffic networks. A transportation network can be referred to as a valued graph consisting of a set of vertices and a set of edges. In order to compute length of the shortest path from the source to each of the remaining in the graph, we illustrated Dijkstra's algorithm and its program. Based on the integration of Geographic Information System (GIS), web services and Asynchronous JavaScript and XML (Ajax) technologies, we provided a web application for finding optimal routes from locations of specialized response team stations to incidents site so as to maximize their ability to respond to hazard incidents.

 

DOI : http://dx.doi.org/10.11591/telkomnika.v12i5.3236


Keywords


shortest path analysis; emergency response; GIS; Dijkstra's algorithm

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics