# An Improved Critical-Edge Model for Finding Optimal Contraflow Links Considering the Influence of Intersections

Authors: Junwen Mo; Mingxia Gao; Liqiao Liu
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

A reversible roadway (contraflow) is one in which the direction of traffic flow in one or more lanes is reversed to the opposing direction for some period of time. Reversible roadways are most commonly used for accommodating directionally imbalanced traffic associated with daily commuter periods. Reversible lanes also have been widely used, in recent years, for evacuating major metropolitan regions threatened by hurricanes and other disasters. One important problem in the practice of evacuation traffic organization is the choice of road links for contraflow. Most research on the choice of contraflow links does not consider the influence of intersections, which leads to overestimation of evacuation capacity especially in congested urban road networks. We abstract an evacuation road network as a special network with directional node-weights by considering the capacity of intersection movements as directed weights of nodes. We define the critical edge for increasing the maximum flow value of such network as the one that can maximize the range of flow value increase by expanding its capacity. We obtain alternative links for contraflow by searching critical edges in such network. We presented a modified algorithm for finding such critical edges on the basis of the maximal capacity path algorithm for the classical maximum flow problem. We also provided a numerical example and tested the effects through traffic simulation. Our results show that the results considering the influence of intersections are more reasonable than those ignoring it and that taking the intersection effects into account enables us to reduce the total evacuation time.


---

## Body

## 1. Introduction

A large area evacuation is usually needed for emergency management in the event of natural or man-made disasters, which produce a dramatic, unbalanced traffic surge. These circumstances require special measures for traffic management and control to avoid traffic jam and delays on some roads and intersections.Reversible roadways are most commonly used for traffic management associated with daily commuter periods [1]. They also have been used regularly to increase outbound evacuation route capacity during emergencies such as hurricanes. Lane reversals were first applied to the evacuation of Hurricane Georges and Hurricane Floyd in the United States in the 1990s and subsequently used in the evacuation in Louisiana and Mississippi [2].Previous studies of lane reversal design fall into two types. The first focuses on identifying optimal positions (also called additional intersections) as the starting points to change lane directions in a section of highway. This approach is mainly applied to hurricane related evacuations. Wolshon discussed some operational practices for lane reversals during hurricane evacuation and laid special stress on the problem of vehicles rerouting at the entrance and exit of reversed lanes [3, 4]. Theodoulou and Wolshon analyzed the effects of the contraflow plan used in hurricane evacuation in New Orleans using the CORSIM simulation software [5, 6]. Zhou Yafei et al. assessed different methods and plans for determining the starting points of reversed lanes in highway networks using the Cell Transmission Model (CTM) [7].The second type of lane reversal research examines traffic evacuation relying upon urban roads and highways with high density, in which the key consideration is selecting appropriate links for contraflow. Shekhar and Kim proved that selecting optimal reversal links in a road network is an NP-hard problem and introduced the overload degree parameter. They then designed a greedy heuristic to handle scenarios with a high overload degree and a bottleneck relief heuristic for situations with low overload degree [8]. Wang and Ip et al. studied the development of a new approach for resource planning using contraflow techniques, in which contraflow and road repairs are simultaneously considered [9]. Wang et al. presented a multiple-objective optimization model for selecting reversal links and a two-layer algorithm to solve this model considering both evacuation priorities and the setup time for the contraflow operation [10]. Min and Lee defined the maximum throughput flow and proposed a contraflow evacuation routing algorithm using reverse shortest paths and maximum throughput flows [11]. Hadas et al. developed a model for designing an optimal network minimizing both evacuation time and network constructions costs [12]. Gao et al. studied the problem of selecting contraflow links in traffic evacuation with a network optimization technique [13, 14].In most studies of link-selection for contraflow, the influence of intersections has received insufficient attention. It is common for road sections to be managed with reversal lanes while intersections operate as usual. However, the effectiveness of increased capacity from contraflow depends greatly on the capacity of intersections. This is particularly evident in crowded urban road networks. Ignoring the effects of intersection in the selection of reversal links in a road network may result in overestimating expected capacity.In this paper, we propose an improved critical edge model of the maximum flow to optimize the link selection for contraflow. We abstract the evacuation road network as a special network by expressing the capacity of turning lanes at intersection entrance as directional node weights. We define the critical edge of the maximum flow increase as the edge that brings the largest increase to the maximum flow value of the network once its capacity is expanded. We obtain alternative links for contraflow by searching critical and subcritical edges for the maximum flow increase. We present a modified algorithm for finding such critical edges on the basis of the maximal capacity path algorithm for the classical maximum flow problem. We also provided a numerical example and tested the effects through traffic simulation.This paper is organized as follows. Section2 illustrates the formulation of the model and its characteristic. Section 3 presents a solution algorithm. Section 4 provides a numerical example to demonstrate the application. Section 5 presents our conclusions.


## 2. Model Formulation

### 2.1. Modeling Ideas

In traditional network flow theory, the critical edge of the maximum flow refers to the side that provides the maximum loss of the maximum flow value when it is interrupted. This measure is often used to analyze the effect of a failure of a road section or a sudden interruption of a line on a communication network [15]. As mentioned in the introduction, we abstract the evacuation network as a special network with the directional node weights and define the critical edge of the maximum flow increase as the edge that brings the largest increase to the maximum flow value once capacity is expanded.To improve the capacity of evacuation route, it is usually necessary to find one or more optimal links for reversing lanes (i.e., contraflow). The core of this optimization is the selection of road links, with the links considered playing an important role in improving the overall evacuation capacity of the road network. Although the traffic flow distribution is not necessarily the maximum flow, the road link corresponding to the critical edge of the maximum flow increase plays a key role. By abstracting the evacuation network as a special network with directional node weights and searching for the critical edge of maximum flow increase in it, the alternative road links suitable for contraflow can be obtained when the influence of intersection is taken into account.


### 2.2. Symbol and Variable Definition

Based on the above considerations, we consider the optimization of the reversal links selection as the critical edge problem of the maximum flow increase in the network with directional node weights. The following material presents the symbols and variables we use in our approach.Treating road links as arcs and intersections as nodes, we express the evacuation road network as a directional networkG
=
(
V
,
A
,
C
,
U
)
.
V
=
{
i
/
i
=
1,2
,
⋯
,
n
} is the set of nodes (intersections) with V
=
n, and A
=
{
(
i
,
j
)
/
i
,
j
=
1,2
⋯
,
n
} is the set of arcs(links) with A
=
m. C
=
{
c
i
j
/
i
,
j
=
1,2
,
⋯
n
} is the set of road capacities with c
i
j indicating the capacity of link (
i
,
j
)
.
U
=
{
u
i
j
k
/
i
,
j
,
k
=
1,2
,
⋯
n
} is the set of turn capacities with u
i
j
k indicating the capacity of the turn direction i
-
j
-
k at node j. For any edge (
i
,
j
) between an O-D pair (
s
,
t
) in the network G, capacity increase is expressed as c
i
j
=
λ
c
i
j
,
λ
>
1. For this increase, we express the new maximum flow value as v
G
+
(
i
,
j
). If there exists an edge (
i
∗
,
j
∗
) and the formula v
G
+
(
i
∗
,
j
∗
)
≥
v
G
+
(
i
,
j
) is true for all edge (
i
,
j
) in the network G, then the edge (
i
∗
,
j
∗
) is called the critical edge of maximum flow increase for the network G. The critical edge and the subcritical edge of the maximum flow increase can be found by calculating the maximum flow after capacity expansion for all of the edges and sorting in descending order according to the maximum flow value. The selected edges can be regarded as the alternative links of lane reversal setting. One or more links can be selected to expand the capacity through contraflow according to the real evacuation demand, with the expectation that the overall evacuation capacity of the road network will be improved.


## 2.1. Modeling Ideas

In traditional network flow theory, the critical edge of the maximum flow refers to the side that provides the maximum loss of the maximum flow value when it is interrupted. This measure is often used to analyze the effect of a failure of a road section or a sudden interruption of a line on a communication network [15]. As mentioned in the introduction, we abstract the evacuation network as a special network with the directional node weights and define the critical edge of the maximum flow increase as the edge that brings the largest increase to the maximum flow value once capacity is expanded.To improve the capacity of evacuation route, it is usually necessary to find one or more optimal links for reversing lanes (i.e., contraflow). The core of this optimization is the selection of road links, with the links considered playing an important role in improving the overall evacuation capacity of the road network. Although the traffic flow distribution is not necessarily the maximum flow, the road link corresponding to the critical edge of the maximum flow increase plays a key role. By abstracting the evacuation network as a special network with directional node weights and searching for the critical edge of maximum flow increase in it, the alternative road links suitable for contraflow can be obtained when the influence of intersection is taken into account.


## 2.2. Symbol and Variable Definition

Based on the above considerations, we consider the optimization of the reversal links selection as the critical edge problem of the maximum flow increase in the network with directional node weights. The following material presents the symbols and variables we use in our approach.Treating road links as arcs and intersections as nodes, we express the evacuation road network as a directional networkG
=
(
V
,
A
,
C
,
U
)
.
V
=
{
i
/
i
=
1,2
,
⋯
,
n
} is the set of nodes (intersections) with V
=
n, and A
=
{
(
i
,
j
)
/
i
,
j
=
1,2
⋯
,
n
} is the set of arcs(links) with A
=
m. C
=
{
c
i
j
/
i
,
j
=
1,2
,
⋯
n
} is the set of road capacities with c
i
j indicating the capacity of link (
i
,
j
)
.
U
=
{
u
i
j
k
/
i
,
j
,
k
=
1,2
,
⋯
n
} is the set of turn capacities with u
i
j
k indicating the capacity of the turn direction i
-
j
-
k at node j. For any edge (
i
,
j
) between an O-D pair (
s
,
t
) in the network G, capacity increase is expressed as c
i
j
=
λ
c
i
j
,
λ
>
1. For this increase, we express the new maximum flow value as v
G
+
(
i
,
j
). If there exists an edge (
i
∗
,
j
∗
) and the formula v
G
+
(
i
∗
,
j
∗
)
≥
v
G
+
(
i
,
j
) is true for all edge (
i
,
j
) in the network G, then the edge (
i
∗
,
j
∗
) is called the critical edge of maximum flow increase for the network G. The critical edge and the subcritical edge of the maximum flow increase can be found by calculating the maximum flow after capacity expansion for all of the edges and sorting in descending order according to the maximum flow value. The selected edges can be regarded as the alternative links of lane reversal setting. One or more links can be selected to expand the capacity through contraflow according to the real evacuation demand, with the expectation that the overall evacuation capacity of the road network will be improved.


## 3. Algorithm Design

### 3.1. General Framework of Algorithm

According to its definition, the critical edge of the maximum flow increase can be found by calculating the maximum flow of the new network after the expansion of each edge and comparing the amplitude of the increase for all edges. There are many unnecessary calculations in this natural algorithm because not all edge expansions contribute to the maximum flow. According to the flow decomposition theorem, the maximum flow value can be improved only if the edge located on the specific path is expanded.Therefore, we make use of the following ideas. First, we use the modified maximum capacity path algorithm to calculate the maximum flow of the initial network and record the augmented path found in each step for the augmenting flow value. Then we determine whether each edge of the network belongs to one of the augmented paths. If the edge is not included in any augmented path, its expansion has no effect on the maximum flow. Otherwise, the maximum flow of the new network can be calculated after the edge is expanded. Finally, we find the critical edge of the maximum flow increase by sorting the increment brought by capacity expansion in descending order. To improve the efficiency, we use the maximum flow of the original network as the initial feasible flow when calculating the maximum flow of a new network after an edge expansion. The detailed calculation steps are as follows.Step 1.
LetR
=
A (the set of links) a
r
c
=
ϕ, and calculate the maximum flow of overall network G using the modified maximum capacity path algorithm, recording the maximum flow as f
G, the flow value as v
G, and the augmented paths as L
1
,
L
2
,
L
3
,
…
,
L.Step 2.
IfR
=
ϕ, go to Step 5. Otherwise, taking any (
i
,
j
)
∈
R, find an augmented path including (
i
,
j
); if (
i
,
j
) is not included in any augmented path, go to Step 4. Otherwise, go to Step 3.Step 3.
Taking the maximum flowf
G as the initial feasible flow of network G
+
(
i
,
j
) (the new network after expanding edge (
i
,
j
)), find the maximum flow of the new network G
+
(
i
,
j
), recording the flow value as v
G
+
(
i
,
j
). Let R
=
R
-
i
,
j and go to Step 2.Step 4.
The expansion of edge(
i
,
j
) has no effect on the maximum flow of network G, so let R
=
R
-
i
,
j and go to Step 2.Step 5.
Compare the maximum flow value of the new network after expansion of each edge and sort in descending order.


### 3.2. Algorithm for Maximum Flow of the Network with Directional Node Weights

The algorithm needs to search for the maximum flow repeatedly in the network with directional node weights. However, the traditional maximum flow problem is based on an ordinary network and lacks support for the directional node weights. Therefore, we must find the maximum flow in the special network with directional node weights. We proposed a modified algorithm on the basis of the maximum capacity path algorithm of the classical maximum flow problem with some improvements for critical steps, including the incremental network construction, the maximum capacity path search, and the flow increase along the augmented path.For convenience, letP represent the augmented path with P
+ and P
- representing the sets of forward and backward arcs in the augmented path, respectively. Let node1 and node n represent the starting and ending point, respectively. The specific steps of the algorithm are then as follows.Step 1.
Give an initial feasible flowf to network G, where f
=
{
f
i
j
,
f
i
j
k
/
(
i
,
j
)
∈
A
,
(
j
,
k
)
∈
A
}.Step 2.
Construct an incremental network expressed asG
(
f
)
=
(
V
,
A
(
f
)
,
C
(
f
)
,
U
(
f
)
) for flow f, where A
(
f
)
=
A
+
(
f
)
∪
A
-
(
f
) is the set of arcs in which A
+
(
f
)
=
{
(
i
,
j
)
/
(
i
,
j
)
∈
A
,
f
i
j
<
c
i
j
}, and A
-
(
f
)
=
{
(
i
,
j
)
/
(
j
,
i
)
∈
A
,
f
j
i
>
0
}. C
(
f
) and U
(
f
) represent the capacity of arcs and turning-directions, respectively, and are determined by the following formulas:(1)
c
i
j
f
=
c
i
j
-
f
i
j
i
,
j
∈
A
+
f
f
j
i
i
,
j
∈
A
-
f
u
i
j
k
f
=
u
i
j
k
-
f
i
j
k
i
,
j
∈
A
+
f
and
j
,
k
∈
A
+
f
f
k
j
i
i
,
j
∈
A
-
f
and
j
,
k
∈
A
-
f
.Step 3.
Find the pathp with the largest capacity from source node1 to end node n in the incremental network and note its capacity as θ. If there is no such route, the algorithm ends, indicating that the maximum flow has been found. Otherwise go to Step 4Step 4.
Increase the flow by valueθ for the network G along path p using the following formulas:(2)
f
i
j
=
f
i
j
+
θ
i
,
j
∈
P
+
f
i
j
-
θ
j
,
i
∈
P
-
f
i
j
e
l
s
e
f
i
j
k
=
f
i
j
k
+
θ
i
,
j
∈
P
+
a
n
d
j
,
k
∈
P
+
f
i
j
k
-
θ
j
,
i
∈
P
-
a
n
d
k
,
j
∈
P
-
f
i
j
k
e
l
s
eStep 5.
Calculate and record the current flow value asf
∗
=
∑
i
(
f
1
i
-
f
i
1
). Go to Step 2.The search for the maximum capacity path in Step 2 is solved by the labeling correction algorithm that labels arcs instead of nodes. The details of this algorithm can be found in our previous work [16].


## 3.1. General Framework of Algorithm

According to its definition, the critical edge of the maximum flow increase can be found by calculating the maximum flow of the new network after the expansion of each edge and comparing the amplitude of the increase for all edges. There are many unnecessary calculations in this natural algorithm because not all edge expansions contribute to the maximum flow. According to the flow decomposition theorem, the maximum flow value can be improved only if the edge located on the specific path is expanded.Therefore, we make use of the following ideas. First, we use the modified maximum capacity path algorithm to calculate the maximum flow of the initial network and record the augmented path found in each step for the augmenting flow value. Then we determine whether each edge of the network belongs to one of the augmented paths. If the edge is not included in any augmented path, its expansion has no effect on the maximum flow. Otherwise, the maximum flow of the new network can be calculated after the edge is expanded. Finally, we find the critical edge of the maximum flow increase by sorting the increment brought by capacity expansion in descending order. To improve the efficiency, we use the maximum flow of the original network as the initial feasible flow when calculating the maximum flow of a new network after an edge expansion. The detailed calculation steps are as follows.Step 1.
LetR
=
A (the set of links) a
r
c
=
ϕ, and calculate the maximum flow of overall network G using the modified maximum capacity path algorithm, recording the maximum flow as f
G, the flow value as v
G, and the augmented paths as L
1
,
L
2
,
L
3
,
…
,
L.Step 2.
IfR
=
ϕ, go to Step 5. Otherwise, taking any (
i
,
j
)
∈
R, find an augmented path including (
i
,
j
); if (
i
,
j
) is not included in any augmented path, go to Step 4. Otherwise, go to Step 3.Step 3.
Taking the maximum flowf
G as the initial feasible flow of network G
+
(
i
,
j
) (the new network after expanding edge (
i
,
j
)), find the maximum flow of the new network G
+
(
i
,
j
), recording the flow value as v
G
+
(
i
,
j
). Let R
=
R
-
i
,
j and go to Step 2.Step 4.
The expansion of edge(
i
,
j
) has no effect on the maximum flow of network G, so let R
=
R
-
i
,
j and go to Step 2.Step 5.
Compare the maximum flow value of the new network after expansion of each edge and sort in descending order.


## 3.2. Algorithm for Maximum Flow of the Network with Directional Node Weights

The algorithm needs to search for the maximum flow repeatedly in the network with directional node weights. However, the traditional maximum flow problem is based on an ordinary network and lacks support for the directional node weights. Therefore, we must find the maximum flow in the special network with directional node weights. We proposed a modified algorithm on the basis of the maximum capacity path algorithm of the classical maximum flow problem with some improvements for critical steps, including the incremental network construction, the maximum capacity path search, and the flow increase along the augmented path.For convenience, letP represent the augmented path with P
+ and P
- representing the sets of forward and backward arcs in the augmented path, respectively. Let node1 and node n represent the starting and ending point, respectively. The specific steps of the algorithm are then as follows.Step 1.
Give an initial feasible flowf to network G, where f
=
{
f
i
j
,
f
i
j
k
/
(
i
,
j
)
∈
A
,
(
j
,
k
)
∈
A
}.Step 2.
Construct an incremental network expressed asG
(
f
)
=
(
V
,
A
(
f
)
,
C
(
f
)
,
U
(
f
)
) for flow f, where A
(
f
)
=
A
+
(
f
)
∪
A
-
(
f
) is the set of arcs in which A
+
(
f
)
=
{
(
i
,
j
)
/
(
i
,
j
)
∈
A
,
f
i
j
<
c
i
j
}, and A
-
(
f
)
=
{
(
i
,
j
)
/
(
j
,
i
)
∈
A
,
f
j
i
>
0
}. C
(
f
) and U
(
f
) represent the capacity of arcs and turning-directions, respectively, and are determined by the following formulas:(1)
c
i
j
f
=
c
i
j
-
f
i
j
i
,
j
∈
A
+
f
f
j
i
i
,
j
∈
A
-
f
u
i
j
k
f
=
u
i
j
k
-
f
i
j
k
i
,
j
∈
A
+
f
and
j
,
k
∈
A
+
f
f
k
j
i
i
,
j
∈
A
-
f
and
j
,
k
∈
A
-
f
.Step 3.
Find the pathp with the largest capacity from source node1 to end node n in the incremental network and note its capacity as θ. If there is no such route, the algorithm ends, indicating that the maximum flow has been found. Otherwise go to Step 4Step 4.
Increase the flow by valueθ for the network G along path p using the following formulas:(2)
f
i
j
=
f
i
j
+
θ
i
,
j
∈
P
+
f
i
j
-
θ
j
,
i
∈
P
-
f
i
j
e
l
s
e
f
i
j
k
=
f
i
j
k
+
θ
i
,
j
∈
P
+
a
n
d
j
,
k
∈
P
+
f
i
j
k
-
θ
j
,
i
∈
P
-
a
n
d
k
,
j
∈
P
-
f
i
j
k
e
l
s
eStep 5.
Calculate and record the current flow value asf
∗
=
∑
i
(
f
1
i
-
f
i
1
). Go to Step 2.The search for the maximum capacity path in Step 2 is solved by the labeling correction algorithm that labels arcs instead of nodes. The details of this algorithm can be found in our previous work [16].


## 4. Example

### 4.1. Initial Data

We analyzed our proposed method by taking the abstract road network shown in Figure1 as an example. In Figure 1, nodes 1, 2, and 3 represent the evacuation source, and node 17 represents the evacuation end. The evacuation demand generated by nodes 1, 2, and 3 during evacuation needs to be delivered to node 17 in its entirety. For simplicity, we assume that the capacity and other information of all links are two-way symmetric. Table 1 shows the basic road link information required for calculation and simulation, and Table 2 shows the turning capacity of each intersection.Table 1
The basic information of road links.
Directional links
Free-flow speed
v
f/(km/h)
Minimum speedv
min/(km/h)
Length
L/m
The number of lanes
Lan
Capacityc
ij/(pcu/h)
Jam density
k
j/(pcu/km/lan)
(1,5)/(5,1)
35
15
600
2
1900
140
(1,6)/(6,1)
35
10
600
1
1100
140
(2,12)/(12,2)
30
5
600
1
1200
140
(2,13)/(13,2)
30
5
600
2
2100
140
(3,7)/(7,3)
35
12
600
2
1850
140
(3,8)/(8,3)
35
10
600
1
1200
140
(8,7)(7,8)
40
15
800
2
2100
130
(7,6)/(6,7)
40
10
900
2
1900
130
(6,5)/(5,6)
42
13
900
2
1850
135
(5,4)/(4,5)
50
15
1130
2
2000
150
(8,13)/(13,8)
48
16
1150
3
3050
153
(7,12)/(12,7)
50
15
1050
2
1700
160
(6,11)/(11,6)
46
14
1000
1
1100
150
(5,10)/(10,5)
45
16
1080
2
2200
145
(4,9)/(9,4)
55
15
1500
1
1300
155
(13,12)/(12,13)
38
12
860
2
1850
150
(12,11)/(11,12)
40
15
750
2
1950
140
(11,10)/(10,11)
36
12
800
2
2100
145
(10,9)/(9,10)
43
15
1000
1
1200
155
(13,15)/(15,13)
45
15
1160
3
2500
140
(11,14)/(14,11)
36
10
900
2
1800
150
(10,14)/(14,10)
46
15
1200
1
1050
135
(9,17)/(17,9)
50
16
1600
2
1970
145
(14,16)(16,14)
35
10
780
2
2050
135
(15,16)/(16,15)
56
15
1450
3
2750
140
(16,17)/(17,16)
50
15
1560
3
2850
145Table 2
Capacity of turning directions at intersections.
Intersections
Turning directions
Capacity
u
i
j
k/(pcu/h)
4
5-4-9
1800
5
6-5-4
960
6-5-10
1060
1-5-4
940
1-5-10
1130
6
1-6-5
600
1-6-11
570
7-6-5
1100
7-6-11
1220
7
8-7-6
1230
8-7-12
1350
3-7-6
1180
3-7-12
1260
8
3-8-7
560
3-8-13
680
9
4-9-17
1300
10-9-17
720
10
5-10-9
1000
5-10-14
1100
11-10-9
1200
11-10-14
960
11
6-11-10
540
6-11-14
720
12-11-10
1120
12-11-14
1200
12
7-12-11
1400
13-12-11
980
2-12-11
540
13
8-13-12
1600
8-13-15
1350
2-13-12
1050
2-13-15
1200
14
10-14-16
760
11-14-16
1500
15
13-15-16
1900
16
14-16-17
1200
15-16-17
1600Figure 1
The abstract evacuation road network.


### 4.2. Optimization Results

Our method determined that the critical edge of the maximum flow increase of the network shown in Figure1 is edge (4,9). The maximum flow value of the network increased by 540 after expanding the capacity of link (4,9) by implementing contraflow on (i.e., reversing) link (9,4). In addition, using our previous method without considering the influence of the intersections [14], we found that the critical edge of the maximum flow increase of the network is link (14,16), with the increment of the maximum flow value being only 130 after capacity expansion. The reason for this difference is that although link (14,16) is most important when the influence of the intersection is not considered, the objective existence of the traffic capacity limitation of the intersection makes the capacity expansion of the link unable to achieve the expected effect. Although the traffic capacity of link (14,16) is increased through reverse management, the traffic capacity of the related turning direction 14-16-17 is very low, which limits the overall rise in capacity of the network. The specific results of calculation and comparison are shown in Table 3.Table 3
Optimization results for critical links of maximum flow increase of the network both ignoring and considering intersection influence.
Intersection influence
Critical links for capacity expansion
Maximum flow value after expansion /(pcu/h)
Improvement range of maximum flow /(pcu/h)
Maximum flow value of original network/(pcu/h)
Ignored
(14,16)
2780
130
2650
Considered
(4,9)
3190
540


### 4.3. Simulation Analysis

Table3 shows that the critical links of maximum flow increase and the increase range of flow value after link expansion are both different when ignoring or considering the intersection influence in the optimization process. To further analyze the impact of different expansion schemes on evacuation efficiency, we assigned given evacuation demands to the original road network and calculated the results both ignoring and considering the intersection effects. We also calculated the overall evacuation time separately for the three different scenarios. The process of evacuation traffic assignment is realized by a system optimal dynamic traffic assignment model proposed previously by the author [17, 18]. This process needs information such as the number of vehicles to be evacuated, the length of the road link, the capacity, and the speed of the free flow as given in Table 1.We used three demand patterns for simulation analysis, as follows:pattern 1:D
1
-
1
7 =800 pcu (Passenger Car Unit), D
2
-
1
7 =900 pcu, D
3
-
1
7 =1000 pcu;pattern 2:D
1
-
1
7 =600 pcu, D
2
-
1
7 =800 pcu, D
3
-
1
7 =700 pcu;pattern 3:D
1
-
1
7 =300 pcu, D
2
-
1
7 =500 pcu, D
3
-
1
7 =400 pcu.In all three scenarios, the aim was to deliver all traffic from source nodes 1, 2, and 3 to end node 17. The variation is in the demand quantity. For example, in demand pattern 1, the evacuation demand generated by node 1 is 800 (pcu), whereas in demand pattern 2, the evacuation demand from node 1 is 600 (pcu). We performed simulation experiments in the three demand patterns. Table4 provides the evacuation time results.Table 4
Simulated evacuation time after capacity expansion of critical links for different demand patterns (minute).
Optimal conditions
critical links for expansion
Demand mode
Pattern 1
Pattern 2
Pattern 3
Original network
none
78(minutes)
68
49
Ignoring intersection
(14,16)
73
63
46
Considering intersection
(4,9)
65
60
44Table4 shows that the evacuation time can be shortened in varying degrees after link expansion under the three demand patterns, regardless of the optimization process. However, the expansion effect of the selected road link is better when considering the influence of intersection, which becomes even more obvious in the case of large evacuation demand. For example, the expansion of links (14,16) and (4,9) shortened the total evacuation time by 3 minutes and 5 minutes, respectively, under the lower demand pattern 3, a small difference. However, under pattern 1 with high demand, the evacuation time was shortened by 13 minutes when considering the influence of intersection with contraflow on link (4,9), while the evacuation time was only reduced by 5 minutes when ignoring the influence of intersection with contraflow on link (14,16).


## 4.1. Initial Data

We analyzed our proposed method by taking the abstract road network shown in Figure1 as an example. In Figure 1, nodes 1, 2, and 3 represent the evacuation source, and node 17 represents the evacuation end. The evacuation demand generated by nodes 1, 2, and 3 during evacuation needs to be delivered to node 17 in its entirety. For simplicity, we assume that the capacity and other information of all links are two-way symmetric. Table 1 shows the basic road link information required for calculation and simulation, and Table 2 shows the turning capacity of each intersection.Table 1
The basic information of road links.
Directional links
Free-flow speed
v
f/(km/h)
Minimum speedv
min/(km/h)
Length
L/m
The number of lanes
Lan
Capacityc
ij/(pcu/h)
Jam density
k
j/(pcu/km/lan)
(1,5)/(5,1)
35
15
600
2
1900
140
(1,6)/(6,1)
35
10
600
1
1100
140
(2,12)/(12,2)
30
5
600
1
1200
140
(2,13)/(13,2)
30
5
600
2
2100
140
(3,7)/(7,3)
35
12
600
2
1850
140
(3,8)/(8,3)
35
10
600
1
1200
140
(8,7)(7,8)
40
15
800
2
2100
130
(7,6)/(6,7)
40
10
900
2
1900
130
(6,5)/(5,6)
42
13
900
2
1850
135
(5,4)/(4,5)
50
15
1130
2
2000
150
(8,13)/(13,8)
48
16
1150
3
3050
153
(7,12)/(12,7)
50
15
1050
2
1700
160
(6,11)/(11,6)
46
14
1000
1
1100
150
(5,10)/(10,5)
45
16
1080
2
2200
145
(4,9)/(9,4)
55
15
1500
1
1300
155
(13,12)/(12,13)
38
12
860
2
1850
150
(12,11)/(11,12)
40
15
750
2
1950
140
(11,10)/(10,11)
36
12
800
2
2100
145
(10,9)/(9,10)
43
15
1000
1
1200
155
(13,15)/(15,13)
45
15
1160
3
2500
140
(11,14)/(14,11)
36
10
900
2
1800
150
(10,14)/(14,10)
46
15
1200
1
1050
135
(9,17)/(17,9)
50
16
1600
2
1970
145
(14,16)(16,14)
35
10
780
2
2050
135
(15,16)/(16,15)
56
15
1450
3
2750
140
(16,17)/(17,16)
50
15
1560
3
2850
145Table 2
Capacity of turning directions at intersections.
Intersections
Turning directions
Capacity
u
i
j
k/(pcu/h)
4
5-4-9
1800
5
6-5-4
960
6-5-10
1060
1-5-4
940
1-5-10
1130
6
1-6-5
600
1-6-11
570
7-6-5
1100
7-6-11
1220
7
8-7-6
1230
8-7-12
1350
3-7-6
1180
3-7-12
1260
8
3-8-7
560
3-8-13
680
9
4-9-17
1300
10-9-17
720
10
5-10-9
1000
5-10-14
1100
11-10-9
1200
11-10-14
960
11
6-11-10
540
6-11-14
720
12-11-10
1120
12-11-14
1200
12
7-12-11
1400
13-12-11
980
2-12-11
540
13
8-13-12
1600
8-13-15
1350
2-13-12
1050
2-13-15
1200
14
10-14-16
760
11-14-16
1500
15
13-15-16
1900
16
14-16-17
1200
15-16-17
1600Figure 1
The abstract evacuation road network.


## 4.2. Optimization Results

Our method determined that the critical edge of the maximum flow increase of the network shown in Figure1 is edge (4,9). The maximum flow value of the network increased by 540 after expanding the capacity of link (4,9) by implementing contraflow on (i.e., reversing) link (9,4). In addition, using our previous method without considering the influence of the intersections [14], we found that the critical edge of the maximum flow increase of the network is link (14,16), with the increment of the maximum flow value being only 130 after capacity expansion. The reason for this difference is that although link (14,16) is most important when the influence of the intersection is not considered, the objective existence of the traffic capacity limitation of the intersection makes the capacity expansion of the link unable to achieve the expected effect. Although the traffic capacity of link (14,16) is increased through reverse management, the traffic capacity of the related turning direction 14-16-17 is very low, which limits the overall rise in capacity of the network. The specific results of calculation and comparison are shown in Table 3.Table 3
Optimization results for critical links of maximum flow increase of the network both ignoring and considering intersection influence.
Intersection influence
Critical links for capacity expansion
Maximum flow value after expansion /(pcu/h)
Improvement range of maximum flow /(pcu/h)
Maximum flow value of original network/(pcu/h)
Ignored
(14,16)
2780
130
2650
Considered
(4,9)
3190
540


## 4.3. Simulation Analysis

Table3 shows that the critical links of maximum flow increase and the increase range of flow value after link expansion are both different when ignoring or considering the intersection influence in the optimization process. To further analyze the impact of different expansion schemes on evacuation efficiency, we assigned given evacuation demands to the original road network and calculated the results both ignoring and considering the intersection effects. We also calculated the overall evacuation time separately for the three different scenarios. The process of evacuation traffic assignment is realized by a system optimal dynamic traffic assignment model proposed previously by the author [17, 18]. This process needs information such as the number of vehicles to be evacuated, the length of the road link, the capacity, and the speed of the free flow as given in Table 1.We used three demand patterns for simulation analysis, as follows:pattern 1:D
1
-
1
7 =800 pcu (Passenger Car Unit), D
2
-
1
7 =900 pcu, D
3
-
1
7 =1000 pcu;pattern 2:D
1
-
1
7 =600 pcu, D
2
-
1
7 =800 pcu, D
3
-
1
7 =700 pcu;pattern 3:D
1
-
1
7 =300 pcu, D
2
-
1
7 =500 pcu, D
3
-
1
7 =400 pcu.In all three scenarios, the aim was to deliver all traffic from source nodes 1, 2, and 3 to end node 17. The variation is in the demand quantity. For example, in demand pattern 1, the evacuation demand generated by node 1 is 800 (pcu), whereas in demand pattern 2, the evacuation demand from node 1 is 600 (pcu). We performed simulation experiments in the three demand patterns. Table4 provides the evacuation time results.Table 4
Simulated evacuation time after capacity expansion of critical links for different demand patterns (minute).
Optimal conditions
critical links for expansion
Demand mode
Pattern 1
Pattern 2
Pattern 3
Original network
none
78(minutes)
68
49
Ignoring intersection
(14,16)
73
63
46
Considering intersection
(4,9)
65
60
44Table4 shows that the evacuation time can be shortened in varying degrees after link expansion under the three demand patterns, regardless of the optimization process. However, the expansion effect of the selected road link is better when considering the influence of intersection, which becomes even more obvious in the case of large evacuation demand. For example, the expansion of links (14,16) and (4,9) shortened the total evacuation time by 3 minutes and 5 minutes, respectively, under the lower demand pattern 3, a small difference. However, under pattern 1 with high demand, the evacuation time was shortened by 13 minutes when considering the influence of intersection with contraflow on link (4,9), while the evacuation time was only reduced by 5 minutes when ignoring the influence of intersection with contraflow on link (14,16).


## 5. Conclusions

Lane reversal, also known as contraflow, is a typical measure in evacuation traffic organization. In this paper, we have studied the method for selecting road links for contraflow taking the influence of intersection into account. We abstracted the evacuation road network as a special network with directional node weights and identified alternative links for contraflow by searching for the critical edge of the maximum flow increase flow in the network. To handle the directional weights of nodes, we improved the classical maximum capacity algorithm for this problem. We analyzed the validity of the method by a numerical example.Our method is predicated on the premise that the traffic capacity of road links and intersections is fixed. However, capacity may be dynamically changed due to sudden interruptions or unavailability of roads during evacuation as the disaster changes (e.g., flooding). Thus, it is necessary to consider the dynamic changes of traffic capacity and study the optimal selection of dynamic lane reversal in the future.



---

*Source: 8681417-2019-07-10.xml*