# Emergency Rescue Location Model with Uncertain Rescue Time

Authors: Jing Guan
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

In order to model emergency rescue location problem with uncertain rescue time, an uncertain expected cost minimization model is proposed under uncertain environment. For solving this model, we convert the uncertain model to its equivalent deterministic form. Finally, a numerical example has been presented to illustrate the model. The computational results which were solved by the down mountain algorithm are provided to demonstrate the effectiveness of the model.


---

## Body

## 1. Introduction

In recent years, all kinds of unexpected disastrous events continue to occur all over the world [1], such as terrorist attacks on the World Trade Center, “SARS,” “5.12” Wenchuan earthquake and Yushu earthquake in China, serious droughts in the five provinces of southwest China, and Japan’s nuclear leak. These disasters have caused great property loss for people. Therefore, it is essential to research the sudden disaster emergency management and its logistics system.Emergency rescue center location is a vital problem in the field of emergency logistics management [1], and it is also an important tool to achieve effective rescue resources distribution and scheduling after the disaster. Emergency rescue center location problem is different from normal location-allocation problems. The difference is mainly reflected in the uncertainty of demand for the disaster area and the urgency of the rescue time. Large-scale disaster emergency rescue needs to mobilize large-scale emergency supplies. Effective emergency rescue is very important to reduce casualties. However, in the case of a large disaster, people needs to transport a lot of aid supplies and rescuers to the disaster area in a short time. Because of burst and uncertainty on disaster and demand for emergency supplies, we must make reasonable optimization for emergency location in order to make the entire emergency rescue network work effectively [2].Scholars have made a lot of research on emergency location problem. Cooper [3] proposed facility location-allocation problem which has been widely used in the areas of emergency location. In the premise of covering all demand point customers, Roth [4] and Toregas and Swaim [5] studied the minimum cost of facilities location of set covering problem; Murali et al. [6] studied emergency logistics facility location problem with capacity constraints and established the maximum covering location model. Murtagh and Niwattisyawong [7] studied facility location-allocation problem with capacity constraints.Harewood [8] has calculated the emergency rescue probability using queuing theory in rescue cover problem and studied emergency rescue problem with the minimum cost. Brotcorne et al. [9], Goldberg [10], Alsalloum and Rand [11], and Tovia [12] have studied emergency location problem which is subject to the time and cost. In the premise of meeting the urgency of rescue time, Fang and He [13] proposed the minimum total cost model. Wang and Zhang [14] proposed emergency rescue center location model which was based on the probability of disasters, spread function of disasters, and rescue function and was solved by embedded heuristic genetic algorithm. Ma et al. [15] researched covering location problem, set covering location problem, and the maximal covering location problem which were based on time satisfaction and were solved by different algorithms, respectively. Galvao et al. [16], Sheu [17], Rajagopalan et al. [18], and Yuan and Wang [19] have researched emergency rescue location problem using a phased manner, respectively. Beraldi and Bruni [20] have researched the phased model by stochastic programming.Although much research on the emergency rescue location problem has been made with deterministic assumption, the real world is full of nondeterministic factors. There are various forms of uncertainty, such as randomness, fuzziness, and fuzzy randomness [2]. For the uncertainty of emergency events, a large number of scholars have studied how to solve the uncertainty around the emergency location problem. Zhou and Liu [21, 22] proposed facility location-allocation problem with stochastic demands and fuzzy demands. Ren et al. [23] established a two-stage stochastic programming model of the uncertain consumer demand and designed the benders decomposition algorithm. Averbakh and Berman [24] have studied location problem with indefinite requirements by deviations robust optimization methods. Mete and Zabinsky [25] proposed reserves and distribution stochastic optimization method under a variety of possible disasters. Rawls and Turnquist [26] proposed a two-stage stochastic mixed integer programming model in the case of hurricanes and other uncertain disasters. Sheu [27] proposed a dynamic emergency rescue demand management model in the case of insufficient information on large-scale natural disasters. By the definition of trapezoidal fuzzy numbers sort criteria, Guo and Qi [28] gave the emergency material storage location model and algorithm in the fuzzy environment. Ben-Tal et al. [29] processed an emergency rescue location problem under uncertain demand by robust optimization model. In the case of factory supply capacity and customer demand for fuzzy variables, Luo et al. [30] established a distribution center location model with fuzzy variables. Tao and Hu [31] established a stochastic programming model which is based on set covering for the uncertainty demand and logistics network in emergency relief.Probability theory can be regarded as a tool to understand objective uncertainty, while sometimes uncertainty shows its subjectivity, known as fuzziness. If the uncertainty behaves neither randomly nor fuzzily, we need a new tool. To describe this type of uncertainty, Liu founded uncertainty theory in 2007 [32] and redefined it in 2010 [33]. Uncertainty theory is a branch of axiomatic mathematics for modeling human uncertainty. Many researchers have made a lot of significant works in this area. Liu [34] proved the linearity of expected value operator. Liu and Ha [35] derived a formula that can easily calculate the expected values of monotone functions of uncertain variables. Making a great contribution, Liu [36] first proposed uncertain programming which is a type of mathematical programming involving uncertain variables. Many practical problems can be expressed as uncertain programming problems. A number of works in this area have also been developed. Liu and Chen [37] proposed an uncertain multiobjective programming and an uncertain goal programming. Recently, uncertain programming has been extended to the fields of uncertain network optimization [38], Chinese postman problem [39], transportation problem [40], newsboy problem [41, 42], and so forth.In this paper, on the basis of uncertainty theory, the emergency rescue location model is presented and solved. This paper is organized as follows. In Section2, some basic concepts and properties of uncertainty theory are introduced. In Section 3, the emergency center location model with uncertain rescue transport time and the appropriate decision matrix form are given. In Section 4, a numerical example is presented. The conclusion is given in the last section.


## 2. Preliminaries

In this section, we introduce some foundational concepts and properties on uncertainty theory.A collectionL of Γ is called a σ-algebra if: (a) Γ
∈
L; (b) if Λ
∈
L, then Λ
c
∈
L; (c) if Λ
1
,
Λ
2
,
…
∈
L, then Λ
1
∪
Λ
2
∪
⋯
∈
L. Each element Λ in the σ-algebra L is called an event. Uncertain measure is a function from L to [
0,1
]. In order to present an axiomatic definition of uncertain measure, it is necessary to assign to each event Λ a number M
{
Λ
} which indicates the belief degree that the event Λ will occur. In order to ensure that the number M
{
Λ
} has certain mathematical properties, Liu [43] proposed the following three axioms.Axiom 1 (normality axiom).
M
{
Γ
}
=
1 for the universal set Γ.Axiom 2 (duality axiom).
M
{
Λ
}
+
M
{
Λ
c
}
=
1 for any event Λ.Axiom 3 (subadditivity axiom).
For every countable sequence of eventsΛ
1
,
Λ
2
,
…, we have
(1)
M
⋃
i
=
1
∞
Λ
i
≤
∑
i
=
1
∞
‍
M
Λ
i
.Axiom 4 (Liu [34], product axiom).
Let(
Γ
k
,
L
k
,
M
k
) be uncertainty spaces for k
=
1,2
,
…; the product uncertain measure M is an uncertain measure satisfying
(2)
M
∏
k
=
1
∞
‍
Λ
k
=
⋀
k
=
1
∞
M
(
Λ
k
)
,
where Λ
k are arbitrarily chosen events from L
k for k
=
1,2
,
…, respectively.Definition 1 (Liu [43]).
An uncertain variable is a measurable functionξ from the uncertainty space (
Γ
,
L
,
M
) to the set of real numbers; that is, for any Borel set B of real numbers, the set
(3)
ξ
∈
B
=
γ
∈
Γ
∣
ξ
γ
∈
B
is an event.Definition 2 (Liu [43]).
The uncertainty distributionΦ of an uncertain variable ξ is defined by
(4)
Φ
(
x
)
=
M
{
ξ
≤
x
}
for any real number x.Obviously, the uncertainty distribution gives a description of uncertain variables. In many cases, it is sufficient to know the uncertainty distribution rather than the uncertain variable itself. Some useful uncertainty distributions are given here.Definition 3 (Liu [43]).
An uncertain variableξ is called linear if it has a linear uncertainty distribution
(5)
Φ
(
x
)
=
0
,
if
x
≤
a
,
x
-
a
b
-
a
,
if
a
≤
x
≤
b
,
1
,
if
x
≥
b
denoted by L
(
a
,
b
), where a and b are real numbers with a
<
b.To calculate the uncertain measure from an uncertainty distribution, we introduce relevant theorems and definitions.Theorem 4 (Liu [33], measure inversion theorem).
Letξ be an uncertain variable with continuous uncertainty distribution Φ; then, for any real number x, one has
(6)
M
ξ
≤
x
=
Φ
x
,
M
ξ
≥
x
=
1
-
Φ
x
.Definition 5 (Liu [43]).
An uncertainty distributionΦ is said to be regular if its inverse function Φ
-
1
(
α
) exists and is unique for each a
∈
(
0,1
).Definition 6 (Liu [43], inverse uncertainty distribution).
Letξ be an uncertain variable with regular uncertainty distribution Φ; then the inverse function Φ
-
1 is called the inverse uncertainty distribution of ξ.Now, we give some useful inverse uncertainty distributions.Definition 7 (Liu [43]).
The inverse uncertainty distribution of linear uncertain variableL
(
a
,
b
) is
(7)
Φ
-
1
α
=
1
-
α
a
-
α
b
.Theorem 8 (Liu [33]).
Letξ
1
,
ξ
2
,
…
,
ξ
n be independent variables with regular uncertainty distributions Φ
1
,
Φ
2
,
…
,
Φ
n, respectively. If f is a strictly increasing function, then
(8)
ξ
=
f
(
ξ
1
+
ξ
2
+
⋯
+
ξ
n
)
is an uncertain variable with inverse uncertainty distribution
(9)
Ψ
-
1
(
α
)
=
f
Φ
1
-
1
α
,
Φ
2
-
1
α
,
…
,
Φ
n
-
1
α
.Definition 9 (Liu [43]).
Letξ
1
,
ξ
2
,
…
,
ξ
n be independent variables with regular uncertainty distributions Φ
1
,
Φ
2
,
…
,
Φ
n, respectively. Since
(10)
f
x
1
,
x
2
,
…
,
x
n
=
x
1
∧
x
2
∧
⋯
∧
x
n
is a strictly increasing function, the minimum
(11)
ξ
=
ξ
1
∧
ξ
2
∧
⋯
∧
ξ
n
is an uncertain variable with inverse uncertainty distribution
(12)
Ψ
-
1
α
=
Φ
1
-
1
α
∧
Φ
2
-
1
α
∧
⋯
∧
Φ
n
-
1
α
.Expected value is the average value of uncertain variable in the sense of uncertain measure and represents the size of uncertain variable.Theorem 10 (Liu [43]).
Letξ be an uncertain variable with regular uncertainty distribution Φ; if the expected value exists, then
(13)
E
[
ξ
]
=
∫
0
1
Φ
-
1
(
α
)
d
α
.Definition 11 (Liu [43]).
Letξ
~
L
(
a
,
b
) be a linear uncertain variable. Then, its inverse uncertainty distribution is Φ
-
1
(
α
)
=
(
1
-
α
)
a
-
α
b, and its expected value is
(14)
E
[
ξ
]
=
∫
0
1
Φ
-
1
α
d
α
=
∫
0
1
1
-
α
a
+
α
b
d
α
=
a
+
b
2
.Theorem 12 (Liu [33]).
Letξ and η be independent uncertain variables with finite expected values. Then, for any real numbers a and b, one has
(15)
E
a
ξ
+
b
η
=
a
E
ξ
+
b
E
η
.


## 3. Problem Descriptions

Here, we assume that there is a group of rescue demand points. Each has its location and population. In order to supply the demand points, we will construct a group of emergency rescue centers, respectively, within given locations. A single rescue demand point can be supplied by multiple emergency rescue centers and a single emergency rescue center can supply multiple rescue demand points. In order to solve this problem, we list model parameters and decision variables as follows.


### 3.1. Index Set

i
is index of emergency rescue center.
j
is index of rescue demand point.


### 3.2. Model Parameters

C
i
is the construction cost of emergency rescue center(
i
=
1,2
,
…
,
m
).
c
i
j
is the per hour transport cost between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
ξ
i
j
is the uncertain time between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
Φ
i
j
is the uncertainty distribution ofξ
i
j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
Φ
i
j
-
1
is the inverse uncertainty distribution ofξ
i
j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
d
i
j
is the distance between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
T
j
is the time limit of rescue demand pointj
(
j
=
1,2
,
…
,
n
).
p
is the maximum number of emergency rescue center.
p
i
is the maximum number of rescue demand point covered by each emergency rescue center(
i
=
1,2
,
…
,
m
).
α
is confidence level.


### 3.3. Decision Variables

Consider(16)
x
i
=
1
,
if
emergency
rescue
center
i
is
selected
,
0
,
otherwise
,
y
i
j
=
1
,
if
rescue
demand
point
j
be
serviced
by
emergency
rescue
point
i
,
0
,
otherwise
.


### 3.4. Uncertain Model of Emergency Rescue Location Problem

C is the total cost that includes the construction cost and transportation cost, and then
(17)
C
=
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.In decision making, we hope to minimize the total cost. By the definition ofξ
i
j, the expectation of the total cost is
(18)
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.Thus, the objective function of the decision problem is to make the expected value of the total cost minimum; that is(19)
min
⁡
⁡
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.Consider the time urgency of emergency rescue center location, that is, in a limited period of time, to complete the emergency work after the disaster. Hence, for each rescue demand point, the shortest time of the emergency rescue center to the rescue demand point should be in a predetermined time. Then, we give the constraint of time:(20)
⋀
i
=
1
m
ξ
i
j
y
i
j
≤
T
j
j
=
1,2
,
…
,
n
.In the actual calculation, the affected pointj might not served by the rescue center i, then y
i
j
=
0, and ∧
i
=
1
m
ξ
i
j
y
i
j
=
0. In order to avoid such a result, we define the transportation time as
(21)
K
i
j
(
ξ
i
j
,
y
i
j
)
=
ξ
i
j
y
i
j
,
if
y
i
j
=
1
Q
,
if
y
i
j
=
0
,
where Q is a very large number.And an uncertain time constraint is given:(22)
M
⋀
i
=
1
m
K
i
j
ξ
i
j
,
y
i
j
≤
T
j
≥
α
j
.Based on the analysis of the decision making process, the emergency rescue location problem model is stated as follows. Consider(23)
min
⁡
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
(24)
s
.
t
.
M
⋀
i
=
1
m
K
i
j
ξ
i
j
,
y
i
j
≤
T
j
≥
α
j
(25)
∑
i
=
1
m
x
i
≤
p
(26)
y
i
j
≤
x
i
(27)
∑
j
=
1
n
y
i
j
≤
p
i
(
i
=
1,2
,
…
,
m
)
(28)
x
i
,
y
i
j
∈
0,1
.Objective (23) means the minimization of total construction cost of emergency rescue center. Constraint (24) means the time limit. Constraints (25) and (26) mean that emergency rescue center to participate in the rescue work does not exceed the number of p. Constraint (27) means the number of restrictions of emergency rescue center to supply rescue demand points.Then, this programming problem can be transformed into an equivalent deterministic programming problem by uncertainty theory as follows. Consider(29)
min
⁡
C
=
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
∫
0
1
Φ
i
j
-
1
α
d
α
y
i
j
s
.
t
.
⋀
i
=
1
m
Φ
i
j
-
1
α
j
,
y
i
j
≤
T
j
∑
i
=
1
m
x
i
≤
p
y
i
j
≤
x
i
∑
j
=
1
n
y
i
j
≤
p
i
i
=
1,2
,
…
,
m
x
i
,
y
i
j
∈
0,1
.


## 3.1. Index Set

i
is index of emergency rescue center.
j
is index of rescue demand point.


## 3.2. Model Parameters

C
i
is the construction cost of emergency rescue center(
i
=
1,2
,
…
,
m
).
c
i
j
is the per hour transport cost between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
ξ
i
j
is the uncertain time between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
Φ
i
j
is the uncertainty distribution ofξ
i
j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
Φ
i
j
-
1
is the inverse uncertainty distribution ofξ
i
j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
d
i
j
is the distance between emergency rescue centeri and rescue demand point j
(
i
=
1,2
,
…
,
m
;
j
=
1,2
,
…
,
n
).
T
j
is the time limit of rescue demand pointj
(
j
=
1,2
,
…
,
n
).
p
is the maximum number of emergency rescue center.
p
i
is the maximum number of rescue demand point covered by each emergency rescue center(
i
=
1,2
,
…
,
m
).
α
is confidence level.


## 3.3. Decision Variables

Consider(16)
x
i
=
1
,
if
emergency
rescue
center
i
is
selected
,
0
,
otherwise
,
y
i
j
=
1
,
if
rescue
demand
point
j
be
serviced
by
emergency
rescue
point
i
,
0
,
otherwise
.


## 3.4. Uncertain Model of Emergency Rescue Location Problem

C is the total cost that includes the construction cost and transportation cost, and then
(17)
C
=
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.In decision making, we hope to minimize the total cost. By the definition ofξ
i
j, the expectation of the total cost is
(18)
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.Thus, the objective function of the decision problem is to make the expected value of the total cost minimum; that is(19)
min
⁡
⁡
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
.Consider the time urgency of emergency rescue center location, that is, in a limited period of time, to complete the emergency work after the disaster. Hence, for each rescue demand point, the shortest time of the emergency rescue center to the rescue demand point should be in a predetermined time. Then, we give the constraint of time:(20)
⋀
i
=
1
m
ξ
i
j
y
i
j
≤
T
j
j
=
1,2
,
…
,
n
.In the actual calculation, the affected pointj might not served by the rescue center i, then y
i
j
=
0, and ∧
i
=
1
m
ξ
i
j
y
i
j
=
0. In order to avoid such a result, we define the transportation time as
(21)
K
i
j
(
ξ
i
j
,
y
i
j
)
=
ξ
i
j
y
i
j
,
if
y
i
j
=
1
Q
,
if
y
i
j
=
0
,
where Q is a very large number.And an uncertain time constraint is given:(22)
M
⋀
i
=
1
m
K
i
j
ξ
i
j
,
y
i
j
≤
T
j
≥
α
j
.Based on the analysis of the decision making process, the emergency rescue location problem model is stated as follows. Consider(23)
min
⁡
C
x
,
y
,
ξ
=
E
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
ξ
i
j
y
i
j
(24)
s
.
t
.
M
⋀
i
=
1
m
K
i
j
ξ
i
j
,
y
i
j
≤
T
j
≥
α
j
(25)
∑
i
=
1
m
x
i
≤
p
(26)
y
i
j
≤
x
i
(27)
∑
j
=
1
n
y
i
j
≤
p
i
(
i
=
1,2
,
…
,
m
)
(28)
x
i
,
y
i
j
∈
0,1
.Objective (23) means the minimization of total construction cost of emergency rescue center. Constraint (24) means the time limit. Constraints (25) and (26) mean that emergency rescue center to participate in the rescue work does not exceed the number of p. Constraint (27) means the number of restrictions of emergency rescue center to supply rescue demand points.Then, this programming problem can be transformed into an equivalent deterministic programming problem by uncertainty theory as follows. Consider(29)
min
⁡
C
=
∑
i
=
1
m
C
i
x
i
+
∑
j
=
1
n
∑
i
=
1
m
c
i
j
∫
0
1
Φ
i
j
-
1
α
d
α
y
i
j
s
.
t
.
⋀
i
=
1
m
Φ
i
j
-
1
α
j
,
y
i
j
≤
T
j
∑
i
=
1
m
x
i
≤
p
y
i
j
≤
x
i
∑
j
=
1
n
y
i
j
≤
p
i
i
=
1,2
,
…
,
m
x
i
,
y
i
j
∈
0,1
.


## 4. The Numerical Example

After our model is designed and a conceptual method is found, a realistic problem is how it works when sample data are given. An example of a group of rescue demand points and planned locations for construction of emergency rescue center is presented in the following tables. The distance between those locations and the construction cost and transport cost as well as efficiency restrictions are also given (there are 20 rescue demand points and 5 alternative emergency rescue centers). For simplicity, the transport time is performed as a linear uncertain variable, that is,ξ
i
j
~
L
(
a
,
b
); then we give experts empirical data table (Tables 1, 2, and 3). The location program requires the following parameters p
=
3
,
p
1
=
p
2
=
p
3
=
p
4
=
p
5
=
15. When a solution, location selection vector, and requirement cover matrix are given, we can calculate the objective value. It is also clear to determine whether the solution is reasonable and whether it can meet every constraint in our model.Table 1
Distance (unit: km).
Rescue demand point
x1
x2
x3
x4
x5
1
13.7
5.2
9.3
12.0
7.2
2
19.0
13.1
8.4
3.2
7.6
3
12.0
3.3
4.9
8.0
4.3
4
14.5
8.0
3.6
2.5
3.8
5
5.8
3.4
3.8
12.7
11.2
6
6.7
4.3
4.1
19.3
9.8
7
11.7
9.2
3.8
5.6
9.2
8
6.0
7.9
6.3
10.9
12.6
9
21.0
15.0
12.3
11.2
8.5
10
13.0
5.2
8.4
10.0
21.0
11
3.5
8.6
5.3
6.2
7.5
12
20.0
16.5
13.4
12.1
5.7
13
11.2
3.8
5.7
9.8
8.4
14
14.3
8.9
7.5
12.5
10.0
15
2.5
3.8
1.8
5.9
9.8
16
15.6
5.6
4.8
12.3
21.0
17
3.2
4.3
18.6
9.7
8.5
18
7.8
19.3
8.5
3.2
12.8
19
4.9
12.9
8.9
13.5
21.0
20
15.6
6.5
13.8
4.2
10.0Table 2
Construction cost and transport cost.
Per hour transport  cost/million
x1
x2
x3
x4
x5
1
2.1
2.2
2.3
2.0
2.0
2
2.3
1.8
2.5
1.7
1.5
3
19
1.9
1.6
2.4
3.0
4
1.8
1.5
1.9
2.1
2.1
5
1.7
2.5
1.5
2.3
3.0
6
2.1
1.7
2.5
2.2
2.4
7
2.3
1.6
2.1
2.4
2.1
8
2.4
1.4
1.8
2.1
2.0
9
2.5
2.0
1.7
2.5
2.0
10
3.0
2.3
1.2
2.6
2.1
11
1.8
1.3
1.3
3.0
2.6
12
1.4
1.8
2.0
1.3
2.5
13
2.0
1.6
2.1
1.8
2.8
14
1.8
1.9
2.5
1.9
1.2
15
1.6
2.1
2.4
1.5
1.6
16
2.1
2.3
1.2
1.4
1.8
17
2.6
1.1
2.3
2.6
1.7
18
2.2
0.9
2.2
2.5
3.0
19
1.6
1.6
2.2
2.2
1.9
20
1.8
1.7
1.8
2.1
2.2
Construction cost of  rescue center/million
98
97
100
96
99Table 3
Linear uncertain distribution of transport time (unit: hour).
Rescue demand point
x1
x2
x3
x4
x5
Time limit
1
L
(
7.0,9.1
)
L
(
5.3,7.9
)
L
(
5.6,8.4
)
L
(
6.9,10.3
)
L
(
2.1,3.2
)
6
2
L
(
8.2,13.5
)
L
(
8.1,12.2
)
L
(
4.6,6.9
)
L
(
1.3,2.5
)
L
(
2.5,3.8
)
6
3
L
(
6.5,8.6
)
L
(
1.4,2.2
)
L
(
1.5,2.3
)
L
(
7.0,11
)
L
(
1.3,2.0
)
3
4
L
(
7.5,9.5
)
L
(
3.0,4.5
)
L
(
1.3,3.0
)
L
(
1.0,2.0
)
L
(
1.0,1.1
)
3
5
L
(
2.5,4.5
)
L
(
1.0,1.6
)
L
(
1.2,2.3
)
L
(
7.1,9.1
)
L
(
4.2,6.2
)
4
6
L
(
3.0,5.0
)
L
(
1.2,2.3
)
L
(
1.5,2.6
)
L
(
8.1,13.0
)
L
(
3.1,4.7
)
4
7
L
(
6.2,8.4
)
L
(
3.9,5.9
)
L
(
1.5,3.0
)
L
(
2.3,4.3
)
L
(
3.0,4.6
)
5
8
L
(
2.9,4.8
)
L
(
3.3,6.0
)
L
(
3.8,5.8
)
L
(
3.5,5.5
)
L
(
4.6,6.9
)
5
9
L
(
6.0,8.1
)
L
(
5.5,8.0
)
L
(
5.0,8.0
)
L
(
6.3,11.3
)
L
(
2.5,3.8
)
6
10
L
(
8.0,12.0
)
L
(
4.7,8.0
)
L
(
4.6,9.6
)
L
(
6.8,10.8
)
L
(
3.5,6.8
)
7
11
L
(
7.0,18.0
)
L
(
5.6,9.0
)
L
(
8.9,12.6
)
L
(
7.9,10.8
)
L
(
3.7,7.0
)
7
12
L
(
10.8,13.8
)
L
(
4.7,9.0
)
L
(
7.9,10.6
)
L
(
6.5,10.8
)
L
(
2.0,4.0
)
8
13
L
(
10.8,13.8
)
L
(
3.4,7.9
)
L
(
5.8,10.6
)
L
(
6.5,11.8
)
L
(
6.0,10.0
)
7
14
L
(
9.0,13.0
)
L
(
5.0,8.9
)
L
(
5.0,9.0
)
L
(
6.5,12.0
)
L
(
5.4,9.8
)
8
15
L
(
2.0,5.0
)
L
(
2.5,5.5
)
L
(
1.2,3.0
)
L
(
5.0,8.0
)
L
(
5.4,9.8
)
4
16
L
(
8.0,11.3
)
L
(
2.5,6.0
)
L
(
2.3,5.6
)
L
(
6.8,11.2
)
L
(
10.2,13.5
)
7
17
L
(
2.1,4.2
)
L
(
3.5,6.0
)
L
(
8.9,12.5
)
L
(
7.5,11.0
)
L
(
7.0,10.0
)
6
18
L
(
6.5,10.5
)
L
(
12.5,14.5
)
L
(
6.5,11.5
)
L
(
2.0,4.0
)
L
(
7.0,11.0
)
8
19
L
(
3.5,6.0
)
L
(
10.5,13.5
)
L
(
6.5,11.5
)
L
(
9.0,14.0
)
L
(
14.0,19.5
)
8
20
L
(
9.5,13.5
)
L
(
4.5,10.6
)
L
(
9.5,11.5
)
L
(
3.0,4.6
)
L
(
7.0,11.0
)
7We use the down mountain algorithm to solve the numerical example. The algorithm we actually performed is to search for a reasonable and the most efficient solution. Obviously, the constrains can be used to reduce the scope so that the best solution can quickly be found.We get the optimal requirement cover matrix by calculation (Table4). The best solution shows that the emergency rescue location selection vector is (
0,1
,
1,0
,
1
); that is, the emergency rescue centers x2, x3, and x5 are selected. And the emergency rescue center x2 provides services for the rescue demand points numbers 1, 4, 5, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, and 20. The emergency rescue center x3 provides services for the rescue demand points numbers 2, 3, 4, 5, 6, 7, 8, 10, 13, 15, 16, 18, 19, and 20. The emergency rescue center x5 provides services for the rescue demand points numbers 1, 2, 3, 4, 7, 9, 10, 11, 12, 14, and 17. Then, the objective value is 672.295.Table 4
Requirement cover solution.
Emergency rescue center
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
x1
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
x2
1
0
0
0
1
1
0
1
1
0
1
1
1
1
1
1
1
1
1
1
x3
0
1
1
1
1
1
1
1
0
1
0
0
1
0
1
1
0
1
1
1
x4
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
×
x5
1
1
1
1
0
0
1
0
1
1
1
1
0
1
0
0
1
0
0
0


## 5. Conclusions

Emergency rescue location problem is an important issue in emergency management. An emergency rescue location model under uncertain environment is presented in this paper. An uncertain variable is introduced to describe the transport time between emergency rescue centers and rescue demand points. Based on uncertain theory, an uncertain expected cost minimization model was proposed. Finally, a numerical example has been presented to illustrate the effectiveness of the model.There are some suggestions for future research. We could introduce additional uncertain parameters into this model or construct a dynamic uncertain model, so that it should be more suitable in emergency management.



---

*Source: 464259-2014-12-01.xml*