CC BY
34
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф.
DOI: 10.17747/2618-947X-2022-1-43-55
Optimum routing of aerial vehicles and ambulances in disaster logistics Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
с«>:
BY 4.0
Optimum routing of aerial vehicles and ambulances in disaster logistics
Z. Mahmat1 L.S. Sua2 F. Balo1
1 Firat University (Elazig, Turkey) 2 American University of Central Asia (USA)
Abstract
One of the most vital aspects of emergency management studies is the development and examination of post-disaster search and rescue activities and treatment facilities. One of such issues to be considered while performing these operations is to reach the disaster victims within minimum time and to plan disaster logistics in the most efficient manner possible. In this study, the problem of planning debris scanning activities with Unmanned Aerial Vehicles after an earthquake and transporting the injured people to the hospitals by ambulances within minimum time was discussed, and mathematical models were developed to solve the problem. The ambulance routing problem and the mathematical model to be used in the solution to the problem are discussed for the first time in the literature. The developed model was tested on the problem sets created by taking into account the data of the province under investigation. Keywords: disaster logistics, cluster coverage, multi-depot vehicle routing problem, ambulance routing problem, mathematical modeling.
For citation:
Mahmat Z., Sua L.S., Balo F. (2022). Optimum routing of aerial vehicles and ambulances in disaster logistics. Strategic Decisions and Risk Management, 13(1): 43-55. DOI: 10.17747/2618-947X-2022-1-43-55.
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
З. Махмат1 Л.С. Суа2 Ф. Бало3
1 Университет Фират (Элязыг, Турция) 2 Американский Университет Центральной Азии (США) 3 Университет Фират (Элязыг, Турция)
Аннотация
Одним из наиболее важных аспектов исследований по управлению рисками и чрезвычайными ситуациями является разработка и изучение поисково-спасательных мероприятий и очистных сооружений после стихийных бедствий. Одним из вопросов, которые необходимо учитывать при выполнении этих операций, является обеспечение доступа к жертвам стихийных бедствий в минимальные сроки и планирование логистики в случае стихийных бедствий наиболее эффективным способом. В данном исследовании рассматривается проблема планирования работ по спасению с помощью беспилотных летательных аппаратов после землетрясения и транспортировки пострадавших людей в больницы на машинах скорой помощи за минимальное время. Для решения этой проблемы были разработаны и предложены математические модели. Впервые рассматривается задача маршрутизации скорой помощи и математическая модель, которая будет использоваться для решения этой задачи. Разработанная модель была протестирована на множествах задач, созданных с учетом реальных данных исследуемой провинции Турции.
Ключевые слова: логистика при стихийных бедствиях, кластерный охват, задача маршрутизации транспортных средств с несколькими депо, задача маршрутизации скорой помощи, математическое моделирование.
Для цитирования:
Махмат З., Суа Л.С., Бало Ф. (2022). Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях. Стратегические решения и риск-менеджмент, 13(1): 43-55. Б01: 10.17747/2618-947Х-2022-1-43-55.
Introduction
It is very difficult to predict the devastating damage caused by disasters. For this reason, it is necessary to take urgent precautions beforehand, during and after the disaster, to improve conditions and to plan for logistics. This makes it necessary to understand the concepts of disaster management and amnesty logistics thoroughly and to increase the importance of the studies on these concepts.
© Mahmat Z., Sua L.S., Balo F., 2022
Disasters are divided into two groups as natural and human in terms of their occurrence [Sahin, Sipahiohlu, 2003]. While natural disasters occur as a result of nature's own actions, human disasters occur as a result of the increase of people's effects on nature. Earthquakes, storms, floods, hurricanes, avalanches and landslides are important natural disasters. Outbreaks, fires and transport accidents appear as human disasters. Earthquakes, like all other disasters, are situations that are very difficult to predict
Optimum routing of aerial vehicles and ambulances in disaster logistics
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
and they result in loss of life and property. Taking necessary precautions before an earthquake can be life-saving in case of an earthquake. Likewise, it is known that if the instructions to be applied during an earthquake are followed, the survival probability of people increases. However, even if all these measures are taken and implemented, there may be structures collapsed after a severe earthquake with a very high intensity and earthquake survivors struggling to survive. In such cases, it is vital to benefit from search and rescue as well as health services as quickly as possible.
The effective and rapid execution of search and rescue activities is possible by scanning the area where the earthquake occurred in a short time as well as determining the damage. In the earthquake that occurred on Friday, January 24, 2020 at 20.55 in Elazig, images were taken in a short period of 25 minutes with Unmanned Aerial Vehicles (UAV) and Manned Reconnaissance Aircraft (MRA) and transferred to the Gendarmerie Command Center. In addition, the MRA and UAVs used to scan 275 different points in 3 hours, making a very important contribution to search and rescue efforts. Later, the dead and wounded were reached through search and rescue efforts from earthquake debris.
One of the most important issues after the search and rescue efforts is the treatment of the injured and the transfer to the nearest hospitals in the shortest time. This research involves scanning
Mahmat Z., Sua L.S., Balo F.
MaxMaT 3., Cya RC., Eano
the city center with UAVs and routing the restricted number of ambulances to the assigned hospitals in the minimum duration. In the first part of the study, the problem of UAV routing was focused on in order to scan for debris and start search and rescue studies quickly and efficiently. The mathematical model of the cluster coverage problem was used while routing the UAV In the second part, the ambulance routing problem was discussed and a new mathematical model was developed by using the multi-warehouse vehicle routing problem in the literature in order to provide the fastest treatment for injured people who were reached through search and rescue studies. The developed model was then tested on different scenarios with the help of the GAMS program. While developing the scenarios, the data is created by visiting the wreckage sites of Elazig province, which is on the earthquake zone and was shaken by a magnitude of 6.8 earthquake that caused 41 dead, 1466 injured and major damage on January 24, 2019.
In the first part of the study, the purpose and scope is specified, and the information about the studies in the literature on the subject is provided. The first major contribution of this study is to provide a comprehensive review of related literature summarized in table 1. In the second part, theoretical foundations such as disaster, disaster management, disaster logistics, and disaster types are mentioned. In the third part, the details of the problem
Table 1
Literature review
Author Method Content
[Yi, Ozdamar, 2007] Mixed integer commodity network flow model Coordinating logistical support and evacuation processes in disaster response
[Gormez, 2008[ Model Development Disaster response and aid center location selection
[Gul, 2008] Mixed integer programming Post-disaster casualty transportation logistics for a possible earthquake
[Yuan, Wang, 2009] Model Development - Dijkstra - Ant colony algorithm Choosing the best way in emergency logistics management
[Tanrioven, 2010] Simulation Ambulance guidance after disaster
[Ozbek, 2011] Bayesian Networks Prediction system of pre-disaster mitigation and preparedness studies based on Bayesian networks
[Unal, 2011] P-median, Floyd Algorithm and AHP Post-disaster nutrition and shelter location selection model
[Hong, Xiaohua, 2011] AHP Emergency logistics centers location selection
[Lin et al., 2011] Integer Programming Model-Heuristic Approach-Genetic Algorithm Logistics design for delivery of priority items in disaster relief operations
[Doyen, 2012] Random integer programming Humanitarian supplies logistics
[Zhang et al., 2013a] Steiner tree-Intelligent algorithm Multi-objective location model review
[Zhang et al., 2013b] Amoeboid algorithm Route selection in emergency logistics management
[Roh et al., 2013] AHP Humanitarian depot location
[Agdas et al., 2014] SMAA-2 Location of disaster distribution centers
[Kalkanci, 2014] Edge Routing Assigning and routing snow plows to priority routes
[Sahin et al., 2014] Model Development Containers of relief supplies to run (mobile-temporary) in s possession
[Sheu, Pan, 2014] Mixed Integer Linear Programming Model Design an uninterrupted central emergency supply network
[Liberatore et al., 2014] RecHADS Model Recovery of transport infrastructure elements and aid distribution planning
[Kara, 2014] Stochastic optimization model Determining the settlements of medical aid material stores to be used after a disaster
[Konu, 2014] Model Development Multi-product warehouse location determination and pre-positioning of humanitarian elements
[Vafaei, Oztaysi, 2014] AHP Determination of the optimum location of the field hospital
[Arslan, Ertem, 2015] Model Development Using containers, determining the number and location of disaster relief materials instead of stocking them in warehouses
[Topal, 2015] Model Development Transport of disaster relief supplies as soon as possible
[He, Liu, 2015] SEIR Model Prediction-Model Development Building a logistics model with emergency medical demand estimation and aid distribution over the SARS epidemic
[Huang et al., 2015] Uncertainty Theory-4PLROP uncertain programming model A fourth-party logistics routing optimization with uncertain delivery time in emergencies
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф. Optimum routing of aerial vehicles and ambulances in disaster logistics Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях Table 1 (ending)
Author Method Content
[Ahmadi et al., 2015] Stochastic Programming Multi-store location routing
[Ozkapici, 2015] Model Development Intermodal aid material distribution, sea and road transport
[Peker et al., 2016] AHS-VIKOR Location of disaster distribution centers
[Ayvaz, Aydin, 2016] Cluster Coverage and P-Median Disaster logistics warehouse location selection
[Uslu, 2016] Stochastic demand multi-warehouse vehicle routing -Model development Delivering relief supplies as soon as possible after disasters and determining vehicle routes
[Tofighi et al., 2016] Developing a probabilistic-stochastic programming approach Logistic network design of multiple central warehouses and local distribution centers for potential earthquakes
[Ransikarbum, Mason, 2016] Target Programming Strategic supply distribution and integrated response and recovery for early stage network restoration decisions
[Kavlak, 2016] Integer Linear Programming Model Providing aid materials without handling by a flexible intermodal transport system
[Kucuk, 2016] Stochastic programming Temporary-disaster-response facilities location
[Demirdogen et al., 2017] SMAA-2 Location of disaster distribution centers
[Ofluoglu et al., 2017] ENTROPY-TOPSIS Disaster logistics warehouse location selection
[Yaprak, Merdan, 2017] Stock Control-Demand Analysis Stock levels of aid materials to be kept in disaster logistics warehouses
[Sahin, 2017] Fuzzy VIKOR-Fuzzy TOPSIS Selection of temporary shelter in case of disaster
[Boonmee et al., 2017] Deterministic, dynamic, stochastic and robust plant location problems Facility location before and after the disaster
[Baskaya et al., 2017] Model Development Lateral transfer (number) opportunities, disaster relief facility locations and number, number of relief supplies
[Sebatli, 2017] Decision Support System Disaster response facilities (GAM) placement
[Haghi et al., 2017] Multi-purpose programming model Determination of the locations of health centers and distribution centers
[Kaya, 2018] Model Development Number and location of aid stations in disasters
[Kucuk, Cavdur, 2018] Route generation-elimination algorithm and Integer Programming Post-disaster relief material handling, routing and assigning vehicles to routes
[Konu et al., 2018] Model Development Pre-positioning aid materials
[Wang et al., 2018] Ideal point algorithm-Ant colony Urgent material shipment and transportation
[Zhang et al., 2018] Uncertainty Model Development Multi-area emergency facilities location selection
[Roh et al., 2018] Fuzzy AHP-Fuzzy TOPSIS Choosing the most suitable warehouse location for international humanitarian organizations
[Loree, Aros-Vera, 2018] Model Development Determining the location of distribution points and allocation of inventory in post-disaster humanitarian logistics
[Vahdani et al., 2018] Model Development-NSGAII and MOPSO algorithms Two multi-purpose and multi-period geolocation - inventory models for three-level relief chain
[Trivedi, 2018] DEMETAL Choosing a place of shelter for disaster planning
[Ozbay, 2018] Mixed integer modeling Tent- city location selection after the earthquake
[Samarah, 2018] Model Development Warehouse location selection before disaster
[Abbasoglu, 2019] Demand Forecast-Facility Layout Model Location of disaster distribution centers
[Sozen, 2019] Model Development- AHP-Conic target programming Choosing the most suitable disaster logistics system
[Zhang et al., 2019] Stochastic programming model Emergency resource allocation
[Temur et al., 2019] AHP and P-median Model Establishing a humanitarian aid distribution center after an earthquake
[Suzuki, 2019] Material Convergence (p-method, m-method) The effect of material convergence on last mile distribution in humanitarian logistics
[Cotes, Cantillo, 2019] Model Development Plant layout for material positioning in the flood area
[Maharjan, Hanaoka, 2019] Model Development Developing a multi-objective location allocation model for disaster response facilities
[Acar, Kaya, 2019] Stochastic programming Network design taking into account the displacement and displacement of mobile hospitals for an expected earthquake
[Cavdur, Sebatli, 2019] Decision Support System - Stochastic programming Temporary disaster response facility allocation for relief supplies distribution under demand uncertainty
[Davoodi, Goli, 2019] Model Development Prevention of late arrival of aid vehicles to disaster areas in critical situations
[Keser, 2019] AHP Disaster logistics warehouse organization location selection
[Dorum, 2019] Model Development Multi-period, multi-material optimal inventory positioning and routing after natural disaster
[Mostajabdaveh, 2019] Mixed integer programming-Genetic algorithm Selection of shelter in disaster and distribution of aid materials to shelters
[Feng et al., 2020] Model Development Location of emergency material pools
[Budak et al., 2020] Fuzzy DEMETAL-Fuzzy ANP-Fuzzy TOPSIS Application of real-time location systems to humanitarian logistics
[Oksuz, Satoglu, 2020] Stochastic programming Determining the location and number of temporary medical centers in case of disaster
Optimum routing of aerial vehicles and ambulances in disaster logistics
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
dealt with in the study are expressed and the mathematical models developed for the problem are introduced. In the fourth chapter, the research findings were shared, while the general evaluation of the study and information about future studies are presented in the last chapter.
Turkey is located on the world's most earthquake generating Alps-Himalayan seismic zone. This is the main cause of earthquakes in the country. Since earthquakes are not known in advance, people can only take the necessary precautions before an earthquake and the measures that should be applied during an earthquake with the best possibility. Even if all kinds of precautions are taken, the destructiveness and intensity of earthquakes can be very high. In other words, it makes debris scanning, logistics and health services much more important after an earthquake. For the stated reasons, UAV and ambulance routing have been chosen as the subject of this research. The scope of this study consists of the neighborhoods of the central district of Elazig province.
In this study, the problem of ambulance routing has been taken into consideration. This issue is related to the following topics in the relevant literature about disasters, natural disasters, disaster management, disaster logistics, emergency logistics, emergency logistics, humanitarian aid logistics, and earthquake logistics. There are many studies in the literature on the mentioned issues, some of which are given in table 1.
1. Scientific foundations
Disasters are caused by nature and human beings in terms of their types and cause loss of life and property. Regardless of the cause and source, it is necessary to minimize such losses. This includes disaster management measures to be implemented. At the same time, as disasters cannot be prevented, post-disaster logistics activities are also important in preventing significant casualties.
Disaster management involves the tasks carried out in order to make people aware of natural conditions that occur in the region they live in, to recognize the reasons for these situations in detail and to help them not to be affected in the face of repetition of such situations [Erkal, Degerliyurt, 2009].
Fig. 1. Phases in disaster management
Source: [Uslu, 2016].
46
Mahmat Z., Sua L.S., Balo F.
Махмат З., Суа Л.С., Бало Ф.
In order for disaster management to be successful, it should aim at minimizing the damage rather than optimizing the events [Tanyas et al., 2013].
One of the most important issues in disaster management is pre-disaster planning and disaster logistics, which will turn into a post-disaster practice [Agdas et al., 2014].
Disaster logistics is expressed as the collection of studies on the transportation of first aid materials, equipment, food and beverage and search and rescue teams that may be in need of all kinds to very scattered points, removing the injured from the scene very quickly and taking them to health institutions for necessary treatment [Barbarosoglu et al., 2002].
2. Materials and methods
In this study, Elazig province, which is located on an earthquake zone, is taken into consideration. The first thing to do right after a severe and destructive earthquake is to scan the area where the earthquake occurred and to determine the places of debris. After the earthquake in the city on January 24, 2020, debris scanning was carried out with IKU and UAVs and very significant benefits were achieved. In this study, it is aimed to evaluate the UAVs in the cluster coverage problem and find the required number of UAVs. Using the mathematical model of the cluster coverage problem, the number of UAVs required to be used in screening was determined by evaluating the UAVs within 38 neighborhoods of the central district of the province. Then, taking into account the characteristics of 6 hospitals and multiple ambulance types in the central district of the province, the problem of assigning the injured to the hospital and routing the ambulances were discussed. Details on the related problems are given in the sections below.
2.1. Coverage problems
Coverage models are mostly used for location problems. While there are a certain number of customers (target/city/ demand points) in the coverage models, it is aimed to determine the number of facilities (supply points) that will meet the needs of all of them in a way that will have the least cost or the largest coverage area.
Some of the coverage problems are given below [Kara, 2014]:
- cluster coverage problem [Aktas et al., 2011; Ozturk et al., 2013; Sezen, Erben 2019];
- highest space coverage problem [Sarikaya et al., 2020];
- double coverage problem [Catay et al., 2008];
- reserve coverage problem [Catay et al., 2008];
- reliable coverage problem.
2.1.1. Cluster coverage problem
Cluster coverage is a type of model developed to respond to all demand points of the supply points planned to be established with the least cost. The most common use of cluster coverage models is to determine the number of emergency aid stations and distribution centers in case of disasters.
Cluster coverage Model is provided below [Aktas et al., 2011].
The written model is given for T demand points and S facility points.
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф.
Indices:
i = Index indicating the demand points i = 1,2,3......T
j = Index indicating facility points j = 1,2,3,......S
Parameters:
a f 1 if the facility j meets the demand of demand i \/ { \ ljl0 otherwise '
Mj = fixed of facility j V j
Decision Variables:
f 1 if facility is is to be establised at j w . Mo if not J
Objective Function:
s Min^Mj
*x, (3.1.1.1)
Constraints:
s £aij*Xj>l Vi 1=1 (3.1.1.2)
x,e {0,1} vj (3.1.1.3)
If the costs are the same for each facility to be opened, the objective function is:
s Min^Xj J=i (3.1.1.4)
While the aim in Equation 3.1.1.1 is to minimize the total cost, the aim is to minimize the number of facilities to be opened in Equation 3.1.1.4 since facility opening costs are equal. Equation 3.1.1.2 is the constraint that cuts the inclusion of each demand point of the facilities to be opened. Finally, 3.1.1.3 is the constraint of the decision variable to be an integer.
2.1.2. Cluster coverage model for determining the number of UAVs
Considering the mathematical model in the previous section, the following mathematical model has been established to determine the number of UAVs to be used in screening activities after the earthquake.
Optimum routing of aerial vehicles and ambulances in disaster logistics Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
Using this model in the implementation study in Section 4, it was intended to determine the ideal number of UAVs to be used in screening activity for the province.
2.2. Vehicle routing problem
It is a much more difficult problem in terms of VRP solution with more constraints and multiple tools than the Traveling Salesman Problem (TSP). Again, the fact that VRP problems are static or dynamic does not prevent them from being included in the NP-Hard group [Demirtas, Ozdemir, 2017]. VRP was initially discussed by [Dantzig, Ramser, 1959], and later this study was developed by [Clarke, Wright, 1964] and the classical saving method was introduced. Although it varies in terms of VRP constraints [Duzakin, Demircioglu, 2009], 3 areas emerge. These are:
1) restrictions on the vehicles planned to be used
- capacity constraints of vehicles in terms of weight or volume,
- constraints on total vehicle time,
- restrictions on legal working hours of vehicle drivers;
2) restrictions on existing customers
- each customer has one or more product demand constraints,
- limited time frames constraints for distribution of product claims;
3) other constraints
- number of tours of the vehicles is more than one, the same vehicle returns to the warehouse on the same day and leaves for another road restrictions,
- tours exceeding one day in terms of length,
- the number of depots to be used is more than one.
Fig. 2. Vehicle routing problem types
GSP „ MGSP ^^ VRP
It was determined that the problem dealt with in the scope of this study is related to the Multi-Depot Vehicle Routing Problem (MD-VRP) and the information about the MD-VRP is stated in the next section.
Indices:
i = Index indicating the neighborhood i = 1,2, 3 T
j = Index indicating the neighborhood to be centered for UAVs j = 1,2,3 .. ,s
Parameters:
a f 1 if the center neighborhood at point j is covering the neighborhood 1Jl0 otherwise Vi,j
Decision Variables:
x _[ 1 j point center neighborhood is chosen ^ . ' (.0 otherwise
Objective Function:
s Min ^ Xj J=i (3.1.2 .1)
Constraints:
s 1=1 (3.1.2.2)
Xj£{0,l} Vj (3.1.2.3)
Optimum routing of aerial vehicles and ambulances in disaster logistics
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
2.2.1. Multi-depot vehicle routing problem
In general, MD-VRP is a type of problem that deals with providing service to many customers from more than one warehouse in the shortest possible time and cost and determining vehicle routes. Some studies using this problem type appear as follows [Yilmaz, 2008] made the modeling of the multidepot vehicle routing problem with the ant colony algorithm and proposed a solution. [Yildiz, 2011] discussed the problems of vehicle routing charts in the transportation sector. [Onder, 2011] discussed the bread distribution of Istanbul Public Bakery Factories as a multi-depot vehicle routing problem. In his study [Ozer, 2016] benefited from the problem of multi-depot vehicle routing to take liver transplantation to transplant centers in a short time [Kiziloglu, 2017] investigated the stochastic multidepot vehicle routing problem with heuristic solutions under the chance constraint approach [Sadatizamanabad, 2018] used the multi- depot vehicle routing problem in supply chain networks and aimed to protect critical facilities [Ozen, 2020] developed the mathematical model of the open-ended multi-depot vehicle routing problem for the feeder bus network design.
In this problem, the assignment of the vehicles to the depot, the assignment of the customers to the vehicles and the customer demands not exceeding the vehicle capacities appear as important constraints. In line with these constraints, it is important to decide which customers should be served from which depot and with which vehicle. Within the scope of the subject dealt with in this study, it is important to determine which injured people will be served from which hospital and by which ambulance. In the ambulance routing problem addressed here, hospitals are considered as depots, the wounded as customers and ambulances as vehicles.
To solve the problem discussed in this study, following mathematical model developed by [Mirabi et al., 2010] for the MD-VRP was benefited from:
Sets;
I: Depots J: Customers K: Vehicles Parameters;
N: Total number of customers qp distance between i and j points i,j CIU J Vi= capacity of lie depot I, i CI dp demand fiom customer j, j GJ qit= capacity of vehicle k, k CK Decision variables;
fl, if using vehicle k from point i to point j T . „„„ """I 0, otherwise IjEnJi
(1, if customer j is assigned to depot
0, otherwise
Uik= dummy variable, which is the sub-tour elimination constraint on vehicle/route k Mathematical Model;
Mnz= X XZxijkqj
leiuj jeiuj kEK
X Z =1 vi£i
kCK ieiuj
Uik - Ujk+Nxljk<N-l V1, j e J, V k € K £ x1Jk - £ x,lk = o vkeKjeiuj
jeiuj jEiuj £ ^ x№ ~ 1 Vk£K
kEKlEIUJ
2Zd)X,ik-qk
leiui jej
VkEK
Sv,
Xdlz4 :
'-J
Zll + ^ ("lui + *u|k) ^ 1
В
viei, jej, k£K
UËIUJ
х,|Ье{од} viei,jej, кек zqE{o,i} viei.jej ил s. o viej.keK
(3.2.1.1)
(3.2.1.2)
(3.2.1.3)
(3.2.1.4)
(3.2.1.5)
(3.2.1.6)
(3.2.1.7)
(3.2.1.8)
(3.2.1.9)
(3.2.1.10)
(3.2.1.11)
Mahmat Z., Sua L.S., Balo F.
MaxMaT 3., Cya RC., Eano
The objective function of the model is to minimize the distance traveled. Constraint (3.2.1.1) refers to the assignment of each customer to a single route (3.2.1.3) expresses the subroute elimination (3.2.1.4) means that each node in the routes has a single entry and exit (3.2.1.5) means that each vehicle is dispatched from a single depot (3.2.1.6) means that the demands of the customers on each route do not exceed the capacities of the vehicles on the routes (3.2.1.7) means that each customer demand should not exceed the capacity of the depot to which it is assigned. The constraint numbered (3.2.1.8) means that each customer is on the route of the depot to which it is assigned (3.2.1.9, 10, 11) are the sign constraints for the decision variables.
2.2.2. Mathematical model developed for ambulance routing problem
Based on the mathematical model that [Mirabi et al., 2010] has developed for the multi-depot vehicle routing problem, the mathematical model that has been developed within this research, is presented in this section. This new model is the first major contribution of this research to the related literature. Another contribution is the introduction of a new type of problem called ambulance routing problem which has been developed based on this problem. It has been discovered that there is no study on the ambulance routing problem in the literature. For this reason, it has been determined that this study is different from other studies in the literature in terms of both the problem and the proposed mathematical model.
Ambulance routing problem covered within the context of this study aims to deliver the injured ones to the nearby hospitals in the most effective manner given the existing constraints. However, when ambulance capacities are considered, it is important that ambulances make more than one trip and deliver the other injured people to hospitals. At the same time, it is considered that ambulances will transport the injured to different hospitals in case the hospital capacities are over. fig. 3 shows the hospitals, ambulances, and casualty locations in some parts of the city.
Fig. 3. An example solution to the problem
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф.
In the sample problem presented in fig. 3, it can be observed that there are 3 hospitals, 3 ambulances and 13 injured. Here, it is assumed that each ambulance can carry a maximum of 2 patients at once and capacities for each hospital are defined. According to the solution presented in this figure, "1st ambulance has 2 trips", "2nd ambulance has 3 trips" and "3rd ambulance has 2 trips". The 1st ambulance carries the 7th and 10th individuals on the first trip, and the 13th on the 2nd trip. The second ambulance carries the 5th and 6th individuals on the first trip, the 11th and 12th ones on the 2nd trip, and the 8th and 9th on the 3rd trip. Finally, the 3rd ambulance carries the 3rd and 4th injured people on the first trip, and the 1st and 2nd on the 2nd trip. Ambulance and hospital capacities were also taken into consideration while performing the solution.
The problem in fig. 3 includes many constraints, parameters, and assumptions in it. The constraints, parameters, and assumptions considered in this study are specified below:
- Every patient must be transported to a hospital.
- Routing should be carried out without exceeding the hospital and ambulance capacities.
- Ambulance capacities were assumed to be equal (1-2-3 or 4).
- Ambulances can make more than one trip.
- It is assumed that it is possible for an ambulance to transport the injured to the hospitals other than the hospitals to which it belongs, but it arrives at the next injury location after stopping at the hospital to which it will transport in the first place and taking the relevant equipment. For example, the first ambulance departing from the first hospital can take the 5th and 7th patients, and after returning to the first hospital, they can go on a second trip to transport the injured in the system to the nearest hospital. In this case, the injured people can go to the other hospital (for example the second hospital) first to get the relevant equipment, then reach the relevant injury locations (for example the 3rd and 8th injured) and return to the second hospital. In this case, the total mission route for the first ambulance is as follows: First trip: 1st hospital - 5th injured, 7th injured -1st hospital. Second trip: 2nd hospital - 3rd injured -8th injured - 2nd hospital. In this way, it was aimed to create a full tour for ambulances and to terminate their duties in the hospitals they started. In this case, it is aimed to reflect the hospital changes of the ambulances to the objective function.
Optimum routing of aerial vehicles and ambulances in disaster logistics Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
Index sets; I: Hospitals J: Injuries K: Ambulances M: Trips
N: Total number of injuries
c¡j— distance between i and j points i,j CIU J
v¡- capacity of hospital i, i Cl
dj= demand of mjuryj,j CJ
capacity of ambulance k, k CK bm= cost of trip m, m CM Decision variables;
{1, if ambulance k is used from point i to point j with trip m 0, otherwise f 1, if injured j is transported to hospital i with trip m z»'l1o, otherwise
_f 1, if ambulance k goes to hospital j from hospital i with trip m
ijeiUJ
PmlJkH
.0, otherwise
Umlk= dummy variable of sub-tour elimination constraint at k ambulance/route hm= variable showing the availability of trip m Mathematical Model;
Min z = Z Z Z Z x™'ik c«+Z Z Z Z p°"ik q>+Z h»b» (3-2-2 i)
mEM ieiuj jeiuj kEK meM iei jei keK m£M
Z Z Z x™'lk = 1 Vie' (3.2.2.2)
mEM kEKiEIIlJ
Unlk-Umjk+NxMJk<N-l VljCJ, VkCK, VmCM
Z x»№ - Z = ° Vk£K' i£IUI.m£M
JEIUJ JEIUJ
Z Z Xm"k -1 vkeK'm£M
kEK IEIUJ
Z Z dlX™1|k - 41 vkeK, тем
iEIUJ JCT
^ djZmij < V, ViEI, тем JEJ
-Zmij + Z fr"1«1 + x»Uk) - 1 vieI' ra.keK.mEM
uEIUJ
—t+Z Xmiik+ZXwt,k ~ Z Z x°iik ~ Pmitk
(3.2.2.3)
(3.2.2.4)
(3.2.2.5)
(3.2.2.6)
(3.2.2.7)
(3.2.2.8)
(3.2.2.9)
dem jej
Viel, t£I, кек, (m, w, 0)ем, í*t,m>o>w,m> 1 Хпцк^о viel, jei, кек, тем (3.2.2.10)
(3.2.2.11)
(3.2.2.12)
^^z^hn, VmCM
Í6I ici
ZZz"*i*1000 -ZZz<
_ (ni+l)ij
leí jej
*Mjke(o,i} viei,jei,keK,meM zjujeio.i} viei,jej,meM viej,keK,meM
(3.2.2.13)
(3.2.2.14)
(3.2.2.15)
Information on the mathematical model developed under these assumptions is given below:
In the objective function of the model (3.2.2.1), the total duty time, the cost of ambulances going to distant hospitals, and the costs arising from the additional trips were tried to be minimized. Constraint (3.2.2.2) implies assigning a single route for each injured. Constraint (3.2.2.3) represents the sub-tour elimination. Constraint (3.2.2.4) means that each node in the routes has a single entry and exit. Constraint 93.2.2.5) means that each ambulance leaves a single hospital. Constraint (3.2.2.6) means that the demands of the injured on each route do not exceed the capacities of the ambulances on the routes. Constraint
(3.2.2.7) means that each injured demand should not exceed the capacity of the hospital to which it is assigned. Constraint
(3.2.2.8) means that each injured person is on the route of the hospital to which they are assigned. Constraint (3.2.2.9) ensures that ambulances are directed to the same and nearest hospital, if possible. Constraint (3.2.2.10) ensures that the transfer between hospitals is not assigned to each other at the relevant time. Constraint (3.2.2.11) allows the trips to be activated gradually. Constraint (3.2.2.12) ensures the assignment of injured people to be transported in the initial trips to a large number of hospitals. (3.2.2.13-3.2.2.14-3.2.2.15) are the constraints limiting the signs of the decision variables.
In the next section, the developed model is tested on various scenarios and its results are analyzed.
3. Research findings
In this study, the central district of Erzincan province has been taken into account and the debris scanning and the most efficient transportation of the injured from under the debris to the hospitals are emphasized, based on the previous earthquake. Two different mathematical models, Sections (3.1.1, 3.2.1) have been developed for debris scanning and rescuing the injured from under debris and transferring them to the hospitals. The developed model was tested by taking into account the data in the district and the information regarding the implementation study is given in the following sections.
3.1. Determining the ideal number of UAVs
Within the scope of the thesis, the cluster coverage problem for 68 districts of Erzincan province was addressed and the required number of UAVs was tried to be determined. The purpose
Optimum routing of aerial vehicles and ambulances in disaster logistics Mahmat Z., Sua L.S., Balo F.
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях Махмат З., Суа Л.С., Бало Ф.
Table 2. District clusters obtained as a result of solving the cluster inclusion problem
Cluster number (representation) Central clusters District numbers covered
1 (A) 6. Davarli 6
2 (B) S. Büyük Çakirman S
3 (C) 11. Bayrak 11
4 (D) 24. Gazi 1, 2, 5, 10, 12, 14, 15, 16, 20, 21, 22, 24, 31, 43
5 (E) 39. Mengüceli 9, 13, 2l, 32, 36, 39, 4S, 49, 51, 54, 56, 60, 61, 62, 63, 64
6 (F) 50. Sarigöl 3, 4, l, 1l, 1S, 19, 23, 25, 2S, 30, 34, 35, 3l, 3S, 40, 41, 44, 50, 52, 53, 55, 5l, 5S, 59, 65, 66
l (G) 6l. Terzibaba 26, 29, 33, 42, 45, 46, 6l, 6S
of cluster coverage problems is to serve the maximum number of areas with the minimum number of facilities. Based on this idea, UAVs are considered as facilities and it is aimed to find the required number. In determining the required number of UAVs, the distances between the neighborhoods were calculated using the Google Maps application. Relevant distances represent the value in minutes of the distance traveled by vehicles. While solving the problem, assuming that the UAVs scan distances of 5-10-15-20 minutes, the number of UAVs required for scanning was aimed to be found with the mathematical model in Section 3.1.2.
As a result of solving the relevant model with the Gams software, it was determined that it requires 17 UAVs for a 5-minute scanning distance, 7 UAVs for a 10-minute scanning distance, 2 UAVs for a 15-minute scanning distance, and 2 UAVs for a 20-minute scanning distance. Considering the need for a more detailed scanning after an earthquake, 7 UAVs are assumed to be needed in developing data sets in the application phase of ambulance routing problem and the injured individuals are distributed to the districts considering these clusters. The district clusters that occur when 7 UAVs are used are given in table 2.
In the next section, data sets were prepared based on the obtained sets and the mathematical model developed for the ambulance routing problem was tested.
3.2. Routing ambulances
While routing the ambulances, 7 district clusters were obtained by applying the mathematical model in section 3.1.2 for 68 districts of Erzincan province. Based on these district clusters, the mathematical model in section 3.2.2 has been tested. The parameters addressed during the model trial are:
- number of hospitals,
- hospital capacity,
- number of ambulances,
- ambulance capacity,
- number of injured,
- number of trips.
Information on these parameters is provided below.
Number of the injured: The number of injuries in the problem sets varies between 10 and 40, and as the number of injured increases, the time to solve the problem and its reaction
Table 3
Random distribution of the injured by the district clusters
Trial Number of injured Cluster + District (Number of Injured)
1 10 A6,1)-E S, 1)-C11, 1)-D1,1)-D2, 1)-E9, 1)-E13, 1)-F3, 1)-F4, 1)-G26, 1)
2 10 A6,1)-E S, 1)-C11, 1)-D5,1)-D10,1)-E2l, 1)-E32, 1)-Fl, 1)-F1l, 1)-G29, 1)
3 10 A6,1)-E S, 1)-C11, 1)-D12, 1)-D14, 1)-E36, 1)-E39, 1)-F1S, 1)-F19, 1)-G33, 1)
4 10 A6,1)-E S, 1)-C11, 1)-D15, 1)-D16, 1)-E4S, 1)-E49, 1)-F23, 1)-F25, 1)-G42, 1)
5 20 A6,1)-E S, 1)-C11, 1)-D20, 1)-D21, 1)-E51, 2)-E54, 2)-E56, 2)-F2S, 2)-F30, 2)-F34, 2)-F35, 2)-G45, 1)
6 20 A6,2)-E S, 4)-C11, 1)-D22, 1)-E60, 2)-E61, 2)-F3l, 2)-F3S, 2)-F40, 2)-G46, 2)
l 20 A6, 3)-E S, 1)-C11, 3)-D24, 1)-E62, 3)-F41, 1)-F44, 1)-F50, 1)-F53, 1)-F55, 1)-G6l, 3)
S 20 A6,4)-E S, 4)-C11, 4)-D31, 1)-D43, 1)-E63, 1)-E64, 1)-F5l, 1)-F5S, 1)-F59, 1)-G6S, 1)
9 30 A6, 1)-BS, 1)-C11, 4)-D1, 3)-D2, 3)- D5, 3)- D10, 3)-E9, 1)-E13, 1)-E2l, 1)- E32, 1)-F65, 2)-F66, 2)-G26, 2)- G29, 2)
10 30 A6, 1)-BS, 1)-C11, 2)-D12, 4)-D14, 4)-E36, 2)-E39, 2)-E4S, 2)- E49, 2)-F3, 1)-F4, 1)- Fl, 1)- F1S, 1)-F19, 1)- F23, 1)-G33, 2)- G42, 2)
11 30 A6, 1)-BS, 1)-C11, 1)-D15, 3)-D16, 3)-D20, 3)-E51, 3)-E54, 3)-E56, 3)-F23, 1)-F25, 1)- F2S, 1)-G45, 3)-G46, 1)-G6l, 1)-G6S, 1)
12 30 A6,1)-E 1)- F35, ÎS, 1)-C11, 1)-D21, 4)-D22, 4)-D24, 4)-D31, 4)-E60, 1)-E61, 1)-E62, 1)-E63, 1)-F30, 1)-F34, 1)-F3l, 1)-G26, 1)- G29, 1)-G33, 1)
13 40 A6,1)-E G46, 1) ÎS, 1)-C11, 1)-D1, 5)-D2, 4)-D5, 3)-E9, 4)-E13, 5)-E39, 4)-E51, 4)-F65, 2)-F66, 2)-G45, 3)-
14 40 A6,2)-E ÎS, 4)-C11, 2)-D15, 4)-D16, 4)-D20, 4)-D24, 4)-E4S, 2)-F25, 4)-F2S, 4)-F30, 4)-G6l, 2)
15 40 A6, 1)-BS, 1)-C11, 1)-D12, 3)-D14, 3)- D31, 3)- D43, 3)-E32, 1)-E36, 1)-E39, 1)- E4S, 1)-F30, 3)-F34, 3)-F35, 3)-F3l, 3)-F3S, 3)-G33, 6)
16 40 A6,4)-BS, 4)-C11, 1)-D20, 1)-D21, 1)-D22, 1)-E60, 4)-E61, 4)-E62, 4)-E63, 4)-E64, 4)-F1l, 1)-F1S, 1)-F19, 1)-F23, 1)-G6S, 4)
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф.
Optimum routing of aerial vehicles and ambulances in disaster logistics Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
to the results needs to be determined. In addition, the injuries are distributed randomly to different locations in the city center and real geographical data of the region are used while determining the locations of the injured. The casualties were randomly allocated to the districts in the clusters determined during the cluster coverage stage, and the condition that each cluster should have at least one injured was added. For the scenario of UAVs on the 10-minute scan, it is assumed that the injured ones are distributed to the districts within the 7 clusters determined under the assumption of 7 UAVs are required. The injuries distributed randomly to clusters and districts under 16 trials are shown in table 3.
Number of hospitals: Three were established considering the hospitals in the province. While creating the relevant distance matrices in the problems, the actual locations of the above hospitals were taken into account and the actual distances between these locations and the injuries were added to the path matrix. In addition, it was assumed that the number of hospitals in the problems varied between 1 and 3, thus it was aimed to determine the dynamic response of the problem to the increase in the number of hospitals.
Hospital capacity: While determining the total hospital capacity, it was considered to be more than the total number of injured and the values were given randomly. The total hospital capacity is shared among the relevant hospitals at different rates. For example, in the related problem, if it is assumed that there are 2 hospitals and the total hospital capacity is determined to be 30, the capacity of one hospital may be 10 and the other 20. Or the capacity of both could be 15. The number of hospitals used under 16 trial studies and their total capacities are shown in table 4 while the distribution of the total capacity to the hospitals is shown in table 5.
Number of ambulances: Within the scope of the study, the number of ambulances varied between 2 and 10, thus the effect of the increase in the number of ambulances on the solution of the problem was tried to be determined. Ambulance starting points are assumed to be at the respective hospitals. The number of
Table 4 Number of hospitals and their total capacities
Table 5 Capacity distribution among three hospitals
ambulances allocated to each hospital within the related problem was determined randomly.
Ambulance capacity: During the research, it was noted that ambulances with capacity of four are available and being actively used. Based on this information, it is assumed that the ambulance capacity varies between 1 and 4. In addition, it is assumed that all ambulances have equal capacities.
Number of trips: The following formulation was used to determine the number of trips.
Number of trips = (Total number of injured) / (Number of ambulances x Ambulance capacity)
The distribution of the number of ambulances, their capacities, the number of injuries and trips among 16 trial runs are shown in table 6.
The model that was developed along with all these data sets and the assumptions was solved using the GAMS software and the obtained results are provided in the next section.
4. Conclusion and recommendations
In the light of the information given in Section 4, the model that was developed in Section 3 was tested and ambulance routing for Erzincan province was examined for small-scale samples. In the trial studies, the number of injured was changed to 10-20-3040 and four trial studies were conducted for each injury cluster. Hospital capacities, ambulance capacities and number of trips varied in each injury cluster. At the same time, the responses of the system were examined by changing the ambulance capacities and the number of trips for the same injured locations in some trial studies. Solution times of the model that was solved with the help of the GAMS and explanations for the solution are given in table 7.
The findings obtained as a result of the experiments are as follows. After the first trial, the program gave a solution very quickly, and the result was the optimum solution. However, in
Table 6
Distribution of ambulance numbers and capacities and the number of injuries-trips
Trial Number Total hospital 1 1 Trial H1 H2 H3
of hospitals capacity 1 1 15 X X
1 1 15
2 X 15 X
2 1 15 3 X X 15
3 1 15
4 15 X X
4 1 15 5 10 20 X
5 2 30
6 X 14 16
6 2 30 l 12 X 1S
l 2 30 S 10 20 X
S 2 30 9 15 15 15
9 3 45 10 10 20 15
10 3 45 11 15 12 1S
11 3 45 12 12 15 1S
12 3 45 13 20 20 20
13 3 60 14 20 36 4
14 3 60 15 21 3 36
15 3 60 16 4 40 16
16 3 60
Trial Number of ambulances Ambulance capacity Number of injured Number of trips
1 2 1 10 5
2 2 2 10 3
3 2 3 10 2
4 2 4 10 2
5 4 1 20 5
6 4 2 20 3
l 4 3 20 2
S 4 4 20 2
9 6 1 30 5
10 6 2 30 3
11 6 3 30 2
12 6 4 30 2
13 S 1 40 5
14 S 2 40 3
15 S 3 40 2
16 S 4 40 2
Optimum routing of aerial vehicles and ambulances in disaster logistics
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных
the second attempt, although the program ran for about an hour, it gave an acceptable solution, not an optimum. At the end of the third trial, the program again worked for about an hour, but gave an optimum solution. In the fourth trial, the ambulance capacity was gradually increased and the solution time of the program remained as one hour. The result was not an optimum but an acceptable value. As a result of the increase in the number of injured, only the fifth trial was solved in a short time and gave the optimum solution. However, other trial periods increased in direct proportion as a result of the increase in the number of injured. The results obtained were not optimum but acceptable values. The trials were considered as 40 wounded and 3 hospitals at most, but the program did not provide solutions within reasonable periods (around 3 hours for 40 injured) in 14 and 16 trials for randomly assigned injured numbers and locations. According to the trials, the increase in the number of injured and other variables prolonged the solution period of the program. At the same time, almost all of the obtained results received an acceptable value, not an optimum. And again, in case the system becomes complicated, the program could not get results within a reasonable time.
References
Abbasoglu M. (2019). The effect of earthquake risk on disaster logistics warehouse layout: Bursa province example. Master thesis. Institute of Science, Uludag University, Bursa.
Acar M., Kaya O. (2019). A healthcare network design model with mobile hospitals for disaster preparedness: A case study for Istanbul earthquake. Transportation Research Part E: Logistics and Transportation Review, 130: 273-292.
Agdas M., Bali O., Balli H. (2014). Site selection for the distribution center within the scope of disaster logistics: An application with SMAA-2 technique. Beykoz Academy Journal, 2(1): 75-94.
Ahmadi M., Seifi A., Tootooni B. (2015). A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: A case study on San Francisco district. Transportation Research Part E: Logistics and Transportation Review, 75: 145-163. Aktas E., Ozaydin O., Ulengin F., Onsel E.§., Agaran B. (2011). A new model for the selection of fire station locations in Istanbul. Journal of Industrial Engineering, 22(4): 2-12.
Arslan A.§., Ertem M.A. (2015). Demand weighted distance and cost models in container use in humanitarian aid logistics. IV National Logistics and Supply Chain Congress, Gumushane Turkey.
Ayvaz B., Aydin H. (2016). Logistic warehouse location selection problem in disaster management: an application in Umraniye District. 16th International Production Research Symposium, Istanbul Technical University Business Faculty, Istanbul Turkey. Barbarosoglu G., Ozdamar L., Cevik A. (2002). An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. European Journal of Operational Research, 140(1): 118-133.
Baskaya S., Ertem M.A., Duran S. (2017). Pre-positioning of relief items in humanitarian logistics considering lateral transhipment opportunities. Socio-Economic Planning Sciences, 57: 50-60.
Boonmee C., Arimura M., Asada T. (2017). Facility location optimization model for emergency humanitarian logistics. International Journal of Disaster Risk Reduction, 24: 485-498.
Budak A., Kaya 1., Kara^an A., Erdogan M. (2020). Real-time location systems selection by using a fuzzy MCDM approach: An application in humanitarian relief logistics. Applied Soft Computing, 92: 106322.
Catay B., Basar A., Unluyurt T. (2008). Planning the locations of emergency aid stations in Istanbul. Chamber of Mechanical Engineers Industrial Engineering Journal, 19(4): 20-35.
Cavdur F., Sebatli A. (2019). A decision support tool for allocating temporary-disaster-response facilities. Decision Support Systems, 127: 113145.
Clarke G., Wright J.R. (1964) Scheduling of vehicle routing problem from a central depot to a number of delivery points. Operations Research, 12: 568-581. http://dx.doi.org/10.1287/opre.12.4.568.
Cotes N., Cantillo V. (2019). Including deprivation costs in facility location models for humanitarian relief logistics. Socio-Economic Planning Sciences, 65: 89-100.
Davoodi S.M.R., Goli A. (2019). An integrated disaster relief model based on covering tour using hybrid Benders decomposition and
variable neighborhood search: Application in the Iranian context. Computers & Industrial Engineering, 130: 370-380.
Dantzig G., Ramser J. (1959) The Truck Dispatching Problem. Management Science, 6, 80-91. http://dx.doi.org/10.1287/mnsc.6.1.80.
Mahmat Z., Sua L.S., Balo F. Махмат З., Суа Л.С., Бало Ф.
Table 7. Results and solution times of ambulance routing in GAMS program
Trial Result Solution time, sec Solver status Model status
1 22508 0.170 1 1
2 437 3600.024 3 8
3 201 3339.551 1 1
4 202 3600.014 3 8
5 44794 1.093 1 1
6 772 3600.124 3 8
7 295 3600.143 3 8
8 263 3600.078 3 8
9 67170 5400.505 3 8
10 1048 5400.299 3 8
11 499 5400.309 3 8
12 460 5400.305 3 8
13 89509 10801.429 3 8
14 - - - -
15 595 10800.394 3 8
16 - - - -
Mahmat Z., Sua L.S., Balo F. Optimum routing of aerial vehicles and ambulances in disaster logistics
Махмат З., Суа Л.С., Бало Ф. Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
Demirdogen O., Erdal H., Yazicilar F.G., Aykol S. (2017). Disaster logistics facility location problem: an application for the TRA1 region. The International New Issues in Social Sciences, 5(5): 323-342.
Demirtas Y.E., Ozdemir E. (2017). A new solution proposal for dynamic vehicle routing problems. Journal of Suleyman Demirel University Faculty of Economics and Administrative Sciences, 22(3): 807-823.
Dorum A.E. (2019). Optimal inventory positioning and routing after a multi-period, multi-material disaster. Master thesis. Graduate Institute, Izmir University of Economics, Izmir, Turkey.
Doyen A. (2012). Disaster mitigation and humanitarian aid logistics. PhD thesis. Institute of Natural Sciences, Bogazici University, Istanbul, Turkey.
Duzakin E., Demircioglu M. (2009). Vehicle routing problems and solution methods. Journal of Qukurova University Faculty of Economics and Administrative Sciences, 13(1): 68-87.
Erkal T., Degerliyurt M. (2009). Disaster management in Turkey. Eastern Geographical Review, 14(22): 147-164.
Feng J.R., Gai W.M., Li J.Y., Xu M. (2020). Location selection of emergency supplies repositories for emergency logistics management:
A variable weighted algorithm. Journal of Loss Prevention in the Process Industries, 63: 104032.
Gormez N. (2008). Site selection for disaster response and aid center for Istanbul. Master thesis. Institute of Science and Technology, Middle East Technical University, Ankara, Turkey.
Gul S. (2008). Post-disaster casualty logistics planning for Istanbul. Master thesis. Institute of Science and Technology, Koq University, Istanbul, Turkey.
Haghi M., Ghomi S.M.T.F., Jolai F. (2017). Developing a robust multi-objective model for pre/post disaster times under uncertainty in demand and resource. Journal of Cleaner Production, 154: 188-202.
He Y., Liu N. (2015). Methodology of emergency medical logistics for public health emergencies. Transportation Research, part E: Logistics and Transportation Review, 79: 178-200.
Hong L., Xiaohua Z. (2011). Study on location selection of multi-objective emergency logistics center based on AHP. Procedia Engineering, 15: 2128-2132.
Huang M., Ren L., Lee L.H., Wang X. (2015). 4PL routing optimization under emergency conditions. Knowledge-Based Systems, 89: 126-133. Kalkanci C. (2014). Organization of emergency response teams in combating winter conditions in natural disaster management. PhD thesis. Institute of Science, Istanbul University, Istanbul, Turkey.
Kara A. (2014). Cluster coverage problems aimed at maximizing network life. Master thesis. Institute of Science, Erciyes University, Kayseri, Turkey.
Kavlak H. (2016). Intermodal freight transportation in humanitarian aid logistics. Master thesis. Institute of Science and Technology, Qankaya University, Ankara, Turkey.
Kaya S. (2018). Temporary facility location selection in disasters: An application for Uskudar district. Master thesis. Science and Technology Institute, Istanbul Commerce University, Istanbul, Turkey.
Keser I. (2019). Disaster logistics warehouse location selection with GIS based AHP method: Gaziantep example. Master thesis. Institute of Science and Technology, Gaziantep University, Gaziantep, Turkey.
Kiziloglu K. (2017). An intuitive solution approach to a stochastic demand multi-depot vehicle routing problem. Master thesis. Institute of Science and Technology, Gazi University, Ankara, Turkey.
Konu A.S. (2014). Humanitarian logistics: Pre-positioning humanitarian aid materials in Istanbul. Master thesis. Institute of Natural Sciences, Middle East Technical University, Ankara, Turkey.
Konu A.S., Duran S., Yakici E. (2018). Pre-positioning of earthquake aid materials in Istanbul. Journal of Productivity, 1: 141-159. Kucuk M.K. (2016). Developing stochastic optimization based solution approaches for the temporary-disaster-response facilities settlement problem. Master thesis. Institute of Science and Technology, Uludag University, Bursa, Turkey.
Kucuk M.K., Qavdir F. (2018). Use of route generation-elimination algorithm and integer programming for post-disaster relief supplies distribution. Uludag University Journal of The Faculty of Engineering, 23(4): 27-40.
Liberatore F., Ortuno M. T., Tirado G., Vitoriano B., Scaparra M.P. (2014). A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian Logistics. Computers & Operations Research, 42: 3-13. Lin Y.H., Batta R., Rogerson P.A., Blatt A., Flanigan M. (2011). A logistics model for emergency supply of critical items in the aftermath of a disaster. Socio-Economic Planning Sciences, 45(4), 132-145.
Loree N., Aros-Vera F. (2018). Points of distribution location and inventory management model for Post-Disaster Humanitarian Logistics. Transportation Research, part E: Logistics and Transportation Review, 116: 1-24.
Maharjan R., Hanaoka S. (2020). A credibility-based multi-objective temporary logistics hub location-allocation model for relief supply and distribution under uncertainty. Socio-Economic Planning Sciences, 70: 100727.
Mirabi M., Ghomi S. F., Jolai F. (2010). Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robotics and Computer-Integrated Manufacturing, 26(6), 564-569.
Mostajabdaveh M. (2019). Inequality-free optimization in disaster preparedness and response. PhD thesis. Institute of Science and Technology, Koq University, Istanbul, Turkey.
Ofluoglu A., Baki B., Ar I. (2017). Multi-criteria decision analysis model for warehouse location in disaster logistics. Journal of Management Marketing and Logistics, 4(2): 89-106.
Oksuz M.K., Satoglu S.I. (2020). A two-stage stochastic model for location planning of temporary medical centers for disaster response. International Journal of Disaster Risk Reduction, 44: 101426.
Optimum routing of aerial vehicles and ambulances in disaster logistics Mahmat Z., Sua L.S., Balo F.
Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях Махмат З., Суа Л.С., Бало Ф.
Onder E. (2011). Optimization of multi-depot vehicle routing problem of Istanbul Halk Ekmek AS (IHE) by using meta-heuristic methods. Istanbul University, Business Economy Institute Journal of Management, 70: 74-92.
Ozbay E. (2018). Management of multiple disasters: The problem of tent-city location selection under random demand. Master thesis. Institute of Engineering and Science, Bilkent University, Ankara, Turkey.
Ozbek O. (2011). Modeling and evaluating disaster management with bayes networks in terms of effective response. Master thesis. Institute of Science, Erciyes University, Kayseri, Turkey.
Ozen D.G. (2020). Modeling and solving the feeder bus network design problem as a multi-store open-ended vehicle routing problem. Master thesis. Institute of Science, Pamukkale University, Denizli, Turkey.
Ozer O. (2016). Multi-depot organ distribution practice in the Marmara region. Master thesis. Institute of Science, Yildiz Technical University, Istanbul, Turkey.
Ozkapici D.B. (2015). An intermodal humanitarian logistics model based on maritime transport for aid material distribution in Istanbul. Master thesis. Institute of Science and Technology, Qankaya University, Ankara, Turkey.
Ozturk Y.E., Oncel H., Ordek E. (2013). 112 emergency service stations settlement model in Konya-Selfuklu district. Selguk University Journal of Engineering, Science and Technology, 1(1): 19-32.
Peker I., Korucuk S., Uluta§ S., Okatan B.S., Yasar F. (2016). Determination of the most suitable distribution center location within the scope of disaster logistics by AHS-V1KOR integrated method: Erzincan province example. Journal of Management and Economics Studies, 14(1): 82-103.
Ransikarbum K., Mason S.J. (2016). Goal programming-based post-disaster decision making for integrated relief distribution and early-stage network restoration. International Journal of Production Economics, 182: 324-341.
Roh S.Y., Jang H.M., Han C.H. (2013). Warehouse location decision factors in humanitarian relief logistics. The Asian Journal of Shipping and Logistics, 29(1): 103-120.
Roh S.Y., Shin Y.R., Seo Y.J. (2018). The Pre-positioned warehouse location selection for international humanitarian relief logistics. The Asian Journal of Shipping and Logistics, 34(4): 297-307.
Sadatizamanabad M.H. (2018). Three-level multi-depot vehicle routing problem with warehouse protection and customer selection. PhD thesis. Institute of Science and Technology, Koq University, Istanbul, Turkey.
Sahin A., Ertem M.A., Emur E. (2014). Using containers as a storage facility in humanitarian logistics. Journal of Humanitarian Logistics and Supply Chain Management, 4(2): 286-307.
Sahin C., Sipahioglu Sti. (2003). Natural disasters and Turkey. Ankara, Turkey, Daytime Education and Publishing. Sahin S. (2017). Location selection of temporary accommodation areas in disaster management system in fuzzy environment with multi-criteria decision making methods. Master thesis. Institute of Science and Technology, Istanbul Commerce University, Istanbul, Turkey. Samarah M. (2018). Multi-objective disaster relief logistics. Master thesis. Institute of Science and Technology, Kadir Has University, Istanbul, Turkey.
Sarikaya H.A., Aygunes H., Kilic A. (2020). Determination of the location of the gendarmerie stations with the largest coverage method. Journal of Industrial Engineering, 31(1): 28-47.
Sebatli A. (2017). Development of a decision support system prototype for the disaster-response-facilities settlement problem. Master thesis. Institute of Science and Technology, Uludag University, Bursa, Turkey.
Sezen B., Erben B. (2019). Positioning the bicycle, which has an important place in sustainable transportation, with the Gams cluster coverage model: Gebze Technical University example. Journal of Intelligent Transportation Systems and Applications, 2(1): 42-56. Sheu J.B., Pan C. (2014). A method for designing centralized emergency supply network to respond to large-scale natural disasters. Transportation Research, part B: Methodological, 67: 284-305.
Sozen M.Q. (2019). Multi-choice conical target programming approach for disaster logistics system design. Master thesis. Institute of Science, Dumlupinar University, Kutahya.
Suzuki Y. (2020). Impact of material convergence on last -mile distribution in humanitarian logistics. International Journal of Production Economics, 223: 107515.
Tanrioven E.A. (2010). Examination of ambulance dispatch policies to improve post-disaster operations: A possible Istanbul earthquake case study. Master thesis. Institute of Science and Technology, Koq University, Istanbul, Turkey
Tanyas M., Gunalay Y., Aksoy L., Kucuk B. (2013). Istanbul province disaster logistics plan guide. Turkey, Istanbul Development Agency. Temur Tekin G., Turgut Y., Yilmaz A., Arslan S., Camci A. (2019). Logistics network design for post-earthquake planning: An application for different earthquake scenarios in the Umraniye region. Pamukkale University Journal of Engineering Sciences, 25(1): 98-105. Tofighi S., Torabi S.A., Mansouri S.A. (2016). Humanitarian logistics network design under mixed uncertainty. European Journal of Operational Research, 250(1): 239-250.
Topal B. (2015). Examination of disaster logistics management systems and new model design. Master thesis. Institute of Science and Technology, Sakarya University, Sakarya, Turkey.
Trivedi A. (2018). A multi- decision criteria approach based on DEMATEL to assess determinants of shelter site selection in disaster response. International Journal of Disaster Risk Reduction, 31: 722-728.
Unal G. (2011). Emergency logistics aid operation earthquake logistics decision support system: ALYO-DLKDS (Possible Istanbul Earthquake Application). PhD thesis. Institute of Defense Studies, National Military Command School, Ankara, Turkey. Uslu A. (2016). Stochastic demand multi-depot vehicle routing but its problem in post-disaster humanitarian aid logistics: Ankara province example. Master thesis. Institute of Science and Technology, Gazi University, Ankara, Turkey.
Mahmat Z., Sua L.S., Balo F. Optimum routing of aerial vehicles and ambulances in disaster logistics
Махмат З., Суа Л.С., Бало Ф. Оптимальная маршрутизация воздушных судов и машин скорой помощи в логистике при стихийных бедствиях
Vafaei N., Oztaysi B. (2014). Selecting the field hospital place for disasters: A case study in Istanbul. In: Joint International Conference of the INFORMS GDN Selection and EURO Working Group on DSS: 323-336.
Vahdani B., Veysmoradi D., Noori F., Mansour F. (2018). Two-stage multi-objective location-routing-inventory model for humanitarian logistics network design under uncertainty. International Journal of Disaster Risk Reduction, 27: 290-306.
Wang H., Xu R., Zijie X., Zhou X., Wang Q., Duan Q., Bu X. (2018). Research on the optimized dispatch and transportation scheme for emergency logistics. Procedia Computer Science, 129: 208-214.
Yaprak U., Merdan M. (2017). Application of some stock control methods used in trade logistics to disaster logistics: TR prime ministry disaster and emergency management presidency disaster logistics warehouses example. Journal of Academic Perspective, 61. Yi W., Ozdamar L. (2007). A dynamic logistics coordination model for evacuation and support in disaster response activities. European Journal of Operational Research, 179(3): 1177-1193.
Yildiz E. (2011). Problems in multi-depot vehicle scheduling problems. Master thesis. Institute of Engineering and Science, Sabanci University, Istanbul, Turkey.
Yilmaz §. (2008). Modeling of multi-warehouse vehicle routing problem with ant colony optimization and a solution proposal. Master thesis. Institute of Science, Yildiz Technical University, Istanbul, Turkey.
Yuan Y., Wang D. (2009). Path selection model and algorithm for emergency logistics management. Computers & Industrial Engineering, 56(3): 1081-1094.
Zhang B., Li H., Li S., Peng J. (2018). Sustainable multi-depot emergency facilities location-routing problem with uncertain information. Applied Mathematics and Computation, 333: 506-520.
Zhang J., Dong M., Chen F.F. (2013). A bottleneck Steiner tree based multi-objective location model and intelligent optimization of emergency logistics systems. Robotics and Computer-Integrated Manufacturing, 29(3): 48-55.
Zhang J., Liu H., Yu G., Ruan J., Chan F.T. (2019). A three-stage and multi-objective stochastic programming model to improve the sustainable rescue ability by considering secondary disasters in emergency logistics. Computers & Industrial Engineering, 135: 1145-1154. Zhang X., Zhang Z., Zhang Y., Wei D., Deng Y. (2013). Route selection for emergency logistics management: A bio-inspired algorithm. Safety Science, 54: 87-91.
About the authors
Zeliha Mahmat
Department of Industrial Engineering, Firat University (Elazig, Turkey). https://orcid.org/0000-0003-0717-7880. Lutfu S. Sua
School of Entrepreneurship and Business Administration, American University of Central Asia (USA). https://orcid.org/0000-0003-
0717-7880.
Figen Balo
Doctor of Industrial Engineering, Professor, Department of Industrial Engineering, Firat University (Elazig, Turkey). https://orcid.org/ 0000-0001-5886-730X.
Информация об авторах
Зелиха Махмат
Факультет промышленного инжиниринга, Университет Фират (Элязыг, Турция). https://orcid.org/0000-0003-0717-7880. Лутфу С. Суа
Школа предпринимательства и делового администрирования, Американский Университет Центральной Азии (США). https://
orcid.org/0000-0003-0717-7880.
Фиген Бало
Доктор технических наук (промышленное проектирование), профессор, факультет промышленного инжиниринга, Университет Фират (Элязыг, Турция). ttps://orcid.org/ 0000-0001-5886-730Х.
The article was submitted on 27.02.2022; revised on 01.03.2022 and accepted for publication on 01.04.2022. The authors read and approved the final version of the manuscript.
Статья поступила в редакцию 27.02.2022; после рецензирования 01.03.2022 принята к публикации 01.04.2022. Авторы прочитали и одобрили окончательный вариант рукописи.
