Network Analysis To Determine The Optimal Route

IOP Conference Series: Earth and Environmental Science
PAPER • OPEN ACCESS You may also like

- Exploratory breath analyses for assessing
Network Analysis to Determine the Optimal Route toxic dermal exposures of firefighters
during suppression of structural burns
for Firefighters in Makassar City Joachim D Pleil, Matthew A Stiegel and
Kenneth W Fent
- The Effects of Multiple Flame Exposures

To cite this article: Bimo Aji Widyantoro and Purnama Budi Santosa 2021 IOP Conf. Ser.: Earth on Thermal Shrinkage and Thermal
Environ. Sci. 936 012005 Protective Performance of Fabrics used in
Firefighter Clothing
Meng Deng, Ying Wang and Yunyi Wang
- The physics of human breathing: flow,

timing, volume, and pressure parameters
View the article online for updates and enhancements. for normal, on-demand, and ventilator
respiration
Joachim D Pleil, M Ariel Geer Wallace,
Michael D Davis et al.
This content was downloaded from IP address 175.176.32.207 on 02/10/2022 at 10:04

Geomatics International Conference 2021 (GEOICON 2021) IOP Publishing
IOP Conf. Series: Earth and Environmental Science 936 (2021) 012005 doi:10.1088/1755-1315/936/1/012005
Network Analysis to Determine the Optimal Route for

Firefighters in Makassar City
Bimo Aji Widyantoro* and Purnama Budi Santosa

Department of Geodetic Engineering, Faculty of Engineering, Universitas Gadjah
Mada, Yogyakarta, Indonesia
*
Email: aji.widyantoro.bimo@gmail.com
Abstract. Makassar city experiences many residential fire disasters during the last
years. One of the causes of fires is difficult to overcome due to the firefighters' late
response. The number of fires occurred due to the ineffectiveness of the fire fighting
road, obstructed by traffic conditions, in its operation. Developing a geospatial route
analysis can help firefighters quickly find the best route to a fire point to overcome this
problem. Geospatial route analysis is currently a key role in emergency responses for
urban fire disasters. A routing system can provide network analysis that allows users to
navigate between source and destination points. In this case, the system can help
firefighters to arrive as quickly as possible. On complicated road networks, some
impedance factors would slow down drivers on a particular road. This study aims to
provide firefighters from the base stations to residential fire disaster locations. The
method used in the studies is Dijkstra's algorithms to calculate weights of the impedance
factors to optimal routing based on length of the road, speed drive, and traffic
conditions. Implementation of routing analysis using open source geospatial software,
PostgreSQL as database management system with PostGIS, and pgrouting as
extensions. The modeling results show that the optimal route selection with speed
parameters based on road classification has a low weight value. Therefore, it can be
used as a reference for selecting a firefighter's routing.
Keywords: fires, PostgreSQL, disaster, network analysis, Makassar City
1. Introduction
Makassar city has significantly entered an urban development period years earlier. Urban development
affects population growth, community activities, and functional diversity, with the result that many
residential areas are built-in, and the traffic roads are crisscrossed. While urban development grows up,
it also brings an increased risk of fires disaster in high crowded buildings [1] [2]. Fire disaster is a natural
phenomenon in urban areas, causing material damage and significant casualties [3]. Most of the regions
of Makassar City that experience fires are densely populated areas that are difficult to access by
firefighters and do not have fire protection systems such as fire hydrants. Based on the Makassar City
Transportation Service, the annual average daily traffic data observed by 13 stations in 2020 was
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution
of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
Published under licence by IOP Publishing Ltd 1
225,644 various vehicles with average speed 40 Km/h crossing the main road which identified that the
traffic was quite heavy [4]. Therefore, emergency response activities must be immediately carried out,
such as sending firefighters to the destination point using navigation tools to find the optimal routing
[5]. The response time is determined to be no more than 15 minutes [6]. Routing attempts to find the
optimal route from the start point to the endpoint with the lowest cost. There are several operations in
routings, such as the shortest path based on distance and travel time [7].
Geographical access to emergency services is typically measured using approximate travel costs by
network analysis of the Geographic Information System (GIS). Network analysis is used to find the best
route from each fire department location to the fire point on the road network, taking into account road
lengths and average travel speed along with successive road segments [8]. Some studies have used open
data sources of the road network and geocoded fire addresses to calculate route planning. Solving routing
problems requires some information such as road length, vehicle speed, and traffic conditions. The result
might not be the current condition if the routing did not insert the data [9]. The road length is used to
see the distance between road segments, the vehicle's speed to determine the average vehicle speed, and
traffic conditions from the average daily traffic data [10]. In route planning, it is two types of
information: static and dynamic routing [5]. Static information contains topographical and territorial
data, such as road network data. Meanwhile, dynamic information is related to describing routing
incidents, such as traffic issues. This study uses dynamic information that uses data on road length,
vehicle speed, and traffic conditions to determine routing.
This research tries to find optimal routing for firefighters based on current road conditions using
open-source GIS technology by referring to previous studies. For efficient routing, it must incorporate
all details of a road network [11]. Thus, it is essential to enabling traffic information to be part of the
cost function. The directed graph explains that the edges are street segments in road networks, whereas
the nodes are segment intersections. Therefore, every edge has a weight representing the cost of
traversing it. In this study, Dijkstra's algorithm is used to calculate the cost. Dijkstra's algorithm is a
graphical search algorithm for finding the shortest path based on directed and undirected road networks
[12]. Specifically, it uses pgrouting, an extension of PostgreSQL/PostGIS, as a geospatial database to
provide geospatial routing functionality [13]. This study uses underlying map data from OpenStreetMap
(OSM).
2. Data and Methodology
2.1. Data and Location

This study is located in Makassar city, including 14 districts with 175.77 km2 and located between
119°24'0" East Longitude and 5°8'0" South Latitude (Figure 1). Based on the Makassar city fire
department's data, there were 289 fires in residential areas in 2019. This number is the most significant
of cases in the last five because it increased by 84 points after 2018, as shown in Table 1.
Table 1. Several fires in Makassar city for the last five years
Year Number of cases Cumulative total
2015 201 -
2016 171 - 30
2017 151 - 20
2018 205 + 54
2019 289 + 84
2
Figure 1. Distribution of firefighters unit as red dots
In this study, the data consists of administrative boundary vector data of Makassar City at a scale of
1: 50,000, which was obtained from Bappeda (Regional Planning Board); road network vector data from
OpenStreetMap (OSM), and tabulated data about the location of the fire department and reports of fire
incidents in 5 last year, as shown in Table 2.
Table 2. List of data

Required data Type Format Source
Administrative boundary Vector Shapefile Bappeda
Road network Vector OSM OpenStreetMap
Firefighters station Tabulation Excel Fire department
Fire report Tabulation Excel Fire department
2.2. Methodology
The optimal route calculation on the road network uses software and hardware capable of processing
spatial data. In this case, the researcher uses open-source software. PostgreSQL/PostGIS is chosen as a
database management system that can process large amounts of spatial data. Pgrouting, which is an
extension, is a tool that provides routing functionality using Dijkstra's algorithm. Finally, QGIS is used
to display the search results for the shortest route. This study has three stages: data collection, spatial
database management, and planning implementation. The research flow diagram is shown in figure 2.
3
Figure 2. Research flow diagram
2.2.1. Data Processing

The data source used for the road network is OpenStreetMap (OSM) data. This data is available free of
charge and is freely accessible to develop geospatial information. Because the data is quite specific, as
far as the term goes, many open-source routing tools work well with OSM data; one of them is pgrouting
[14]. First, OSM data is downloading based on the bounding box, as shown in Figure 3. Then, the data
is extracted into the database using the osm2pgrouting tools with scripting
"C:\Users\Data\mapconfig.xml" l --schema public -d makassar -U postgres -h localhost -p 5432 -W
postgres.
Figure 3. Downloading the OSM data based on

bounding box in Makassar City (unscaled)
4
The data of the fire department location and the fire report are obtained from the Fire Department.
The data must be digitized again using the QGIS software because it cannot be used directly for the
routing process. Digitizing the map produces the desired data for each node, line, edge, and proper
coordination.
2.2.2. Database management

The operation of pgrouting relies on database dependence. First, the data must be stored in a database
management system. Data that has been digitized is stored in the database. Next, a topology analysis is
performed to complete the parameters required by pgrouting. These parameters are carried out to ensure
that there is no overshoot and undershoot on the road networks. The results are presented in the form of
vertices symbolized in points and ways in polylines [7]. Figure 4 shows the topology of the road
network.
Figure 4. OSM data after topology processing
2.2.3. Pgrouting implementation using Dijkstra’s algorithm

Pgrouting provides Dijkstra's algorithm function to evaluate the shortest path between the starting and
destination points by calculating every road segment's cost. Dijkstra's algorithm runs. It creates the
shortest path tree from the origin node to all other nodes in the directly connected graph. Dijkstra's
algorithm compares the weights between each connected node and chooses the lowest weight [15], as
shown in Figure 6.
5
Figure 5. Illustration of Dijkstra's algorithm graph [15]
The cost value can be modified to build dynamic routing by adding another column of cost values
for each road segment [16]. The cost value generally includes the value of the road's length as the cost
column (cos). For the travel time component, add a speed column (cost_s) that follows the planned road
speed based on road class [2] [17]. Meanwhile, the variable component can add a traffic condition
column (cost_t) based on the road class to illustrate how congested the road is generally [10], as shown
in table 4.
Table 3. Speed limit and traffic conditions at different roads

Road class Max speed (km/h) Traffic congestion Traffic speed (km/h)
Primary artery road 60 Traffic jams 50
Primary collector road 40 Stagnating 30
Secondary artery road 30 Stagnating 30
Secondary collector road 20 Stagnating 30
Primary local road 20 Moving slowly 15
Finally, the predetermined cost value is entered into the database to run the routing process. A schema
is needed where the source node is the road node parallel to the firefighter location, and the target node
is the location of the fire. To implement, the Djikstra algorithm in pgrouting can use SQL language in
access database.
2.2.4. Test scenario and Evaluation

The system test is carried out by creating a fire case scenario in an area. According to this fire case, the
firefighter unit responds by heading to the fire location. The routing is simulated using QGIS by applying
Dijkstra's algorithm. Dijkstra has a function to find the route that has the lowest cost to travel. This cost
value contains the length of the road, road speed, and traffic conditions. The result can provide several
alternative routes for the fire department departure route from the firefighter's location to the fire
department's location. Evaluation is then carried out to determine the system's success in providing
alternative routes based on distance, speed, and traffic density. Several alternative routes are then
evaluated on whether they are efficient and traversed by firefighter units to get to the fire location.
6
3. Results and Discussion
3.1. Developed Model, Test Results, and Evaluation

This study has produced a model for determining the optimal path of firefighters in urban fires in
Makassar city. Firefighters' fire emergency response requires an optimal vehicle path from the fire
department to the fires' location in urban fires. This model is created by adopting Dijkstra's algorithm
and modifying it to calculate the road routing cost value. The road route data shows that the highway
network in cities is becoming increasingly complex, and traffic volume increases. Therefore, this model
was created to provide an optimal alternative route for emergency response activities in Makassar City.
Furthermore, this model considers the shortest path in typical situations and the shortest travel time
appropriate for an emergency.
The model is tested by simulating a trip between node 46403 as the primary fire department office
located on Jalan Sam Ratulangi to node 3508, the fire incident location on Jalan Manuruki, in Tamalate
district. The location is selected for this simulation, which was based on the consideration that Manuruki
Street, Tamalate District, is a densely populated residential area where many fire cases have occurred,
as reported by the Makassar City Fire Service. From the simulation of this fire disaster, the model
successfully provides four alternative routes for the fire department unit from the Fire Department on
Jalan Sam Ratulangi to the fire's location on Jalan Manuruki. The four alternative routes for this trip can
be seen in figure 6. The route options show the total distance traveled and travel time from the values of
cost, cost_s, cos_t, and cost_a, as shown in Table 4.
(a) (b) (c) (d)

Figure 6. Routing alternative (a) cost (b) cost_s, (c) cost_t, and (d) cost_a
Table 4. Comparison of the cost value with Dijkstra's algorithm

Value Parameter Source Target Total distance (m) Total time (mins)
Cost Length 46403 3508 4926.86 5.91
Cost_s Speed 46403 3508 4514.25 5.41
Cost_t Traffic 46403 3508 5002.55 6.00
Cost_a Length, speed, traffic 46403 3508 4748.80 5.69
As shown in Table 4, four parameters (length, speed, traffic, and length, speed, traffic) are used to
calculate the four cost values: Cost, Cost_s, Cost_t, and Cost_a. For example, Cost is calculated from
the road segment length parameter. The cost_s value calculates the road speed parameter based on the
road class. The cost_t calculates the traffic parameter, which represents the road class and road width.
Lastly is cost_a, which combines all cost parameters to calculate other alternative routes.
Based on the test on alternative models, results show the difference in mileage and travel time
between the three cost values. Table 4 shows that the route selection based on cost_s has the optimal
7
routing assessment. The calculation results show that it takes a distance of 4514.25 m with a duration of
5.41 minutes for the fire engine to reach the fires' location. The route selection is influenced by the
cost_s value obtained from the entered road speed. It is according to the Dijkstra algorithm principle,
which chooses the lowest weight in the routing. So that the higher the road speed, the lower the resulting
cost. It is different from the cost value, which only calculates the road's length, and cost_t, which has a
higher weight because the road speed decreases.
Furthermore, the model is retried using a new parameter that combines all cost values (cost, cost_s,
and cost_t) into cost all, called cost_a, in the same case as before to show alternative routes, as shown
in Figure 6. Based on the weighting results, it is found that the alternative route has a distance of 4748.80
m and a time of 5.69 minutes. The comparison between the previous simulation results between cost_s
and cost_a resulted in a choice that the optimal path choice with cost_s considerations was still superior
to the alternative route cost_a, which had a distance of 234.55 meters and a travel time of 0.28 minutes.
3.2. Model Implementation

The tested model is then implemented into a more complicated road network by finding the optimal
route in each sub-district in Makassar city. For this purpose, the source node remains the same, namely
the fire department office, and the target are nodes representing the sub-district area affected by the fires.
The routing calculation with the value of cost_s is the optimal routing choice for firefighters to the fires'
location based on the weighted network representation. It follows the provisions of the emergency
service response time of not more than 15 minutes.
The utilization of the model in emergency response scenarios based on a response time of 15 minutes
to arrive at the fire's location is satisfactory. This model successfully analyzes the cost_s value to
estimate the firefighter's travel time to each node representing the fires' area. For example, in each sub-
district in Makassar city, as shown in Table 5.
Table 5. Calculation of the cost_s value to the target node representing the regions
Sub-district Source Target Total distance (m) Total time (mins)
Biringkanaya 46403 24580 18890.08 22.66
Bontoala 46403 9025 3878.75 4.65
Makassar 46403 26 3057.90 3.66
Mamajang 46403 5951 3568.81 4.28
Manggala 46403 7018 9378.30 11.25
Mariso 46403 989 1697.64 2.03
Panakukkang 46403 463 6788.65 8.14
Rappocini 46403 5053 6439.95 7.72
Tallo 46403 5661 4748.80 5.69
Tamalanrea 46403 57817 11557.62 13.86
Tamalate 46403 3508 4926.86 5.91
Ujung Pandang 46403 10163 1858.85 2.23
Ujung Tanah 46403 3774 5935.40 7.12
Wajo 46403 2525 3425.37 4.11
8
Figure 7. Visualization of routing simulation on QGIS
As shown in Table 5, 13 sub-districts can be reached within the response period, and there is one
sub-district outside the fire department's travel time. It shows that calculating the value of cost_s can
help analyze the trip's appropriate routing options, as shown in Figure 7. Based on these model
performances, it is found that the search for optimal routing using Dijkstra's algorithm with
modifications can aid firefighters in calculating the arrival time at the scene of a fire. The cost value
calculation using Dijkstra's algorithm can be modified based on various parameters to determine the
maximum routing for firefighters to the fires' location. However, this model's drawback is that it cannot
provide a cost_t value representing traffic parameters based on time-series traffic.
4. Conclusion
This research shows that Dijkstra's algorithm can modify the road condition for a dynamic change by
using the pgRouting. The model successfully loads the optimal route routing model with routing options
based on three parameters: road length, road speed, and traffic conditions. The three parameters calculate
the lowest weight in the road network graph, where this model can analyze the weights on every node
and edge of the highway network. This analysis considers the distance between the starting and
destination points according to the three parameters' dynamic cost weights. It can generate route choices
for disaster emergency response needs, especially for firefighters, in choosing the optimal path to the
fire location. The results model shows that route selection based on speed (cost_s) has a shorter distance
and travel time than other costs.
Acknowledgments
The authors gratefully acknowledge the Research Directorate of Universitas Gadjah Mada in 2020 to
provide this research's RTA 2020 research grant.
References
[1] A. K. N. Syafitri and P. B. Santosa, “Spatial Analysis of Kulon Progo District Development from
2007-2030 with Cellular Automata Markov Model,” KnE Eng., vol. 2019, pp. 269–277, 2019.
https://doi.org/10.18502/keg.v4i3.5864
[2] X. Dong, Y. Li, Y. Pan, Y. Huang, and X. Cheng, “Study On Urban Fire Station Planning Based
On Fire Risk Assessment And GIS Technology,” Procedia Eng., 2018.
[3] T. Tanachawengsakul, N. Mishima, and T. Fuchikami, “A Simulation Study on Fire Evacuation
Routes in Primary Stage for a Historic Canal Residential Area,” Procedia - Soc. Behav. Sci., vol.
9
216, pp. 492–502, 2016.

[4] Z. Wang, S. Zlatanova, A. Moreno, P. van Oosterom, and C. Toro, “A Data Model For Route
Planning In The Case Of Forest Fires,” Comput. Geosci., vol. 68, pp. 1–10, 2014.
[5] Kantor Menteri Negara Pekerjaan Umum, “Keputusan Menteri Negara Pekerjaan Umum
Republik Indonesia Nomor : 11/KPTS/2000 Tentang Ketentuan Teknis Manajemen
Penanggulangan Kebakaran di Perkotaan.” Kantor Menteri Negara Pekerjaan Umum, Jakarta,
2000.
[6] C. Chadha and S. Garg, Shortest Path Analysis on Geospatial Data Using PgRouting, vol. 55.
Springer Singapore, 2018.
[7] S. Barbieri and L. Jorm, “Travel times to hospitals in Australia,” Sci. Data, vol. 6, no. 1, p. 248,
2019.
[8] S. Choosumrong and V. Raghavan, “Real-Time Cost Updates Based on Current Traffic
Condition for Optimal Routing Planning,” Asian Conf. Remote Sens., vol. 2, pp. 1183–1188,
2011.
[9] D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck, “Customizable route planning in road
networks,” Transp. Sci., vol. 51, no. 2, pp. 566–591, 2017.
[10] L. Zhang and X. He, “Route Search Base on pgRouting,” Adv. Intell. Soft Comput., vol. 115
AISC, no. VOL. 2, pp. 1003–1007, 2012.
[11] S. Choosumrong, C. Humhong, V. Raghavan, and G. Fenoy, “Development Of Optimal Routing
Service For Emergency Scenarios Using pgRouting and FOSS4G,” Spat. Inf. Res., vol. 27, no.
4, pp. 465–474, 2019.
[12] M. Dornhofer, W. Bischof, and E. Krajnc, “Comparison of Open Source routing services with
OpenStreetMap Data for blind pedestrians,” FOSS4G-Europe 2014, p. 6, 2014.
[13] A. A. A. Hamid, M. T. Aziz, M. Dhiya, and A. Abdulmajed, “A Network Analysis for Finding
the Shortest Path in Hospital Information System with GIS and GPS,” J. Netw. Comput. Appl.,
vol. 5, pp. 10–22, 2020.
[14] S. Choosumrong, V. Raghavan, and E. Realini, “Implementation of Dynamic Cost-Based
Routing for Navigation Under Real Road Conditions Using FOSS4G and OpenStreetMap,”
Proc. GIS-IDEAS, no. 9–11, pp. 53-58., 2010.
[15] Pemerintah Republik Indonesia, “Peraturan Pemerintah Republik Indonesia Nomor 34 Tahun
2006 Tentang Jalan.” Jakarta, 2006.
[16] M. Zilske, A. Neumann, and K. Nagel, “OpenStreetMap For Traffic Simulation,” M. Schmidt,
G. Gart. (Eds.), Proc. 1st Eur. State Map – OpenStreetMap Conf. no. 11-10, pp. 126–134, 2011.
10

Network Analysis To Determine The Optimal Route

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Network Analysis To Determine The Optimal Route

Uploaded by

Copyright:

Available Formats

IOP Conference Series: Earth and Environmental Science

PAPER • OPEN ACCESS You may also like

- The Effects of Multiple Flame Exposures

- The physics of human breathing: flow,

This content was downloaded from IP address 175.176.32.207 on 02/10/2022 at 10:04

Network Analysis to Determine the Optimal Route for

Bimo Aji Widyantoro* and Purnama Budi Santosa

Keywords: fires, PostgreSQL, disaster, network analysis, Makassar City

2. Data and Methodology

2.1. Data and Location

Figure 1. Distribution of firefighters unit as red dots

Table 2. List of data

Figure 2. Research flow diagram

2.2.1. Data Processing

Figure 3. Downloading the OSM data based on

2.2.2. Database management

Figure 4. OSM data after topology processing

2.2.3. Pgrouting implementation using Dijkstra’s algorithm

Figure 5. Illustration of Dijkstra's algorithm graph [15]

Table 3. Speed limit and traffic conditions at different roads

2.2.4. Test scenario and Evaluation

3. Results and Discussion

3.1. Developed Model, Test Results, and Evaluation

(a) (b) (c) (d)

Table 4. Comparison of the cost value with Dijkstra's algorithm

3.2. Model Implementation

Figure 7. Visualization of routing simulation on QGIS

216, pp. 492–502, 2016.

You might also like