Fire Incident Emergency Response Plan using Hybrid Fuzzy Dijkstra

Abstract

Shortest pathfinding is an algorithm that can be used for the nearest path search solution, in this study the use of the shortest pathfinding method in the best path search for firefighting teams travels to the location of the fire incident. Case studies were conducted in a city in the United States called Naperville, the data taken in the form of locations from the fire department, several important points in the city and the latest data location of the fire incident. The shortest pathfinding algorithm used is hybrid fuzzy Dijkstra, the algorithm is a development of the Dijkstra algorithm, where the algorithm can use more than one consideration parameter for determining the best path, the dataset and various parameters are grouped based on fuzzy algorithms and then processed using Dijkstra algorithm. The use of fuzzy algorithms that group data based on data ranges can speed up the search process at each level of the graph matrix because some data that is almost the same will be grouped into one data range. Based on the research conducted, it can be seen that the method was successful in determining the best path to the location of the fire incident, based on several other route choices.