# An Integrated Contraflow Strategy for Multimodal Evacuation

Authors: Jingyi Hua; Gang Ren; Yang Cheng; Bin Ran
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

To improve the efficiency of multimodal evacuation, a network aggregation method and an integrated contraflow strategy are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial subnetwork and balances accuracy and efficiency by refining the local road subnetworks. The integrated contraflow strategy contains three arterial configurations: noncontraflow to shorten the strategy setup time, full-lane contraflow to maximize the evacuation network capacity, and bus contraflow to realize the transit cycle operation. The application of this strategy takes two steps to provide transit priority during evacuation: solve the transit-based evacuation problem with a minimum-cost flow model, firstly, and then address the auto-based evacuation problem with a bilevel network flow model. The numerical results from optimizing an evacuation network for a super typhoon justify the validness and usefulness of the network aggregation method and the integrated contraflow strategy.


---

## Body

## 1. Introduction

Emergency evacuation has long been a topic in hazard preparedness and response management. The evacuation planning of advance-notice emergencies (such as hurricane and flood) with long warning time and large geographic scale is a challenging problem because of the unexpected traffic demand, complex road networks, and uncertain driver behaviors. A significant amount of research has been conducted on this problem during the last decade, but most of these studies address automobile evacuation only. The evacuation of the low-mobility population that has little access to personal vehicles, however, has not been fully investigated [1].Many people fall into the low-mobility population, especially in large cities and developing countries. Evacuation planning should consider their needs; for example, as many as 25–30% of the population does not have access to personal cars in New Orleans [2]. After the failure of low-mobility population evacuation during Hurricane Katrina, several efforts have been made to improve multimodal evacuation [3, 4]. Using transportation simulation system TRANSIMS [5], VISSIM [6], and DynusT [7], researchers developed various traffic management frameworks to simulate multimodal evacuation and to evaluate the efficiency of different modes. On the aspect of numerical analysis, Abdelgawad et al. proposed a multimodal optimization framework with three objectives: minimizing in-vehicle travel time, minimizing at-origin waiting time, and minimizing fleet cost [8]. Di Gangi developed a mesoscopic DTA model to introduce simulation of multimodal systems and to enhance some capabilities such as queue spillover and overtaking management [9]. Wang et al. presented a multiple-objective optimization model with the consideration of evacuation priorities and traffic setup time in the multimodal evacuation problem [10].However, few existing methods have considered the priority of transit. The transit vehicles are supposed to share lanes with other traffic along regular transit routes. Once the low-mobility population is large or the road network is oversaturated, this limitation would impede the cycle operation of transit vehicles. In other words, the overlook of transit priority would lower the evacuation efficiency of low-mobility population.To address this challenge in evacuation planning, we pursue three objectives in this study: (a) developing a network aggregation method to simplify the loading of the multimodal evacuation demand; (b) presenting an integrated contraflow strategy to provide priority to transit vehicles; and (c) devising a two-stage evacuation model to the proposed strategy.The rest of the paper is organized as follows. The next section first presents the network aggregation method and the integrated contraflow method. In the model formulation section, we describe the evacuation models for transit-based evacuees and auto-based evacuees separately. Specific algorithmic designs of our solution method are then elaborated. In the case study section, we test the performance of the proposed method in solving a real evacuation planning problem. And the last section summarizes and concludes with a discussion of future work.


## 2. Methodology

In this paper, the evacuees on the source place are classified into two categories: the auto-based evacuees (i.e., high-mobility population) and the transit-based evacuees (i.e., low-mobility population). The auto-based evacuees are supposed to withdraw the hazardous area using their own vehicles, while the transit-based evacuees may need to be sent to the processing centers within the hazardous area (such as railway stations, airports, and transit hubs) for further evacuation. Based on the analysis of evacuation demands, this section presents a network aggregation method and an integrated contraflow strategy to show how to provide transit priority during multimodal evacuation.


### 2.1. Network Aggregation Method

Because of the large number of intersections and streets in urban areas, it is impossible to cover the whole urban network in network design problems. It is also a challenge for evacuation network design. Researchers usually abstract arterial subnetwork for optimization design from the whole network. Under this kind of network representation, as shown in Figure1(a), origin nodes of the network are located on arterials and each node has a fixed evacuation demand. This representation yields two disadvantages during multimodal evacuation. The first disadvantage is that the conventional representation hinders the application of transit priority. The transit-based evacuees are located in each arterial origin node, and it is neither feasible nor cost effective to provide transit priority on every arterial link. The second disadvantage is the inaccurate estimates of the evacuation demand distribution. Evacuees actually live in the zone surrounded by arterials and have the choice of accessing different adjacent arterials; thus, it is very hard to determine the fixed demand at arterial origin nodes. In other words, the evacuation demand of an arterial origin node is usually uncertain. To eliminate these two disadvantages in network representation, a network aggregation method is presented, as shown in Figure 1(b), which aims to reduce the number of origin nodes and balance calculation accuracy and efficiency.Comparison of network representation methods during evacuation.
(a)
Conventional network representation
(b)
Aggregated network representationBefore proceeding to the details of this aggregation method, it is worthwhile defining the road functional classification during evacuation first. Two basic classes of roads are considered in this study: arterials and local roads. Arterials are defined as road segments without direct connection with origin nodes, and they provide the mobility that evacuees need to reach network destinations as quickly and safely as possible. Local roads are directly connected with origin nodes, and they only serve local traffic access to arterials. Based on this classification, the evacuation network is divided into two parts: an arterial subnetwork and a number of simple local road subnetworks. A local road subnetwork is a closed zone bounded by arterial segments (e.g., the four squares surrounded by solid lines in Figure1(b)).There is another advantage of this network aggregation method: the flexible definition of road classification. If the network is very large or just a rough result is needed, the range of arterials can be restricted to a higher level (e.g., arterials with median barrier). If it is a district network or detailed result is needed, the collectors can also be included in the range of arterials.Each vehicle follows a similar two-stage evacuation process. First stage is from an origin location (e.g., home) to an arterial access point, within a local road subnetwork. Second stage is from an arterial access point to a destination via the arterial subnetwork. It is obvious that the evacuation distance of the second stage is much longer than that of the first stage, and those measures on arterial subnetwork are cost effective. Thus, we leave this subnetwork unaggregated to ensure the accuracy of the results. In addition, as the travel time on local road has little effect on the evacuation time, a local road subnetwork can then be aggregated to one super origin node and several virtual branches.The aggregation process works as follows: firstly, a super origin node is set to accommodate the entire evacuation demand in each zone; secondly, a virtual branch access point is used to represent the whole local road access points on an arterial segment (i.e., the road section between two adjacent arterial-arterial intersections); thirdly, virtual branches connecting super origin node with adjacent virtual branch access points are introduced to describe the paths accessed into the relevant arterial segments.


### 2.2. Integrated Contraflow Strategy

Contraflow is generally the use of one or more lanes of inbound travel for traffic movement in the outbound direction, which increases the operational evacuation capacity [11]. The research regarding contraflow has concentrated on the effectiveness, feasibility, and safety issues of implementing this measure. The research regarding contraflow has concentrated on the effectiveness and feasibility by simulation or numerical analysis. Using microscopic simulation, Theodoulou and Wolshon, Lim and Wolshon, and Williams et al. assessed the adequacy of the contraflow plan in terms of effectiveness or termination design [12–14]. On the aspect of numerical analysis, heuristic algorithms are usually used to solve the evacuation contraflow problems, such as tabu-based [15], greedy-based, and bottleneck relief [16] and genetic algorithm [17]. In actual applications, this measure has been widely used for hurricane evacuation in the states of the U.S. that lie along the Atlantic and Gulf Coasts [18].However, the conventional contraflow strategy still addressed auto-based evacuation only. Thus, transit vehicles and automobiles were mixed together which reduced the efficiency of transit recycle operation. Concerning this issue, Ren et al. proposed a new variant of contraflow operation, named bus contraflow, for the evacuation of transit-based evacuees [19]. This approach transformed contraflow lanes into exclusive bus lanes during evacuation, which guaranteed transit priority without degrading the efficiency of normal outbound lanes.Based on the research results above, an integrated contraflow strategy is suggested for the global optimization of multimodal evacuation. Arterials in the evacuation network contain three configurations, as shown in Figure2, under the control of integrated contraflow strategy: (a) noncontraflow to shorten the strategy setup time; (b) full-lane contraflow to maximize the evacuation network capacity; and (c) bus contraflow to realize the transit cycle operation. The bus contraflow configuration is applied on the arterials serving as evacuation transit routes. For the arterials only serving automobiles, the integrated strategy deploys full-lane contraflow operation to the arterials with oversaturated flow (i.e., the evacuation flow exceeded the normal outbound capacity) and leaves the rest unchanged.Arterials configurations under the control of integrated contraflow strategy.
(a)
Noncontraflow operation
(b)
Full-lane contraflow operation
(c)
Bus contraflow operationSince there are two kinds of evacuation demands existing in the evacuation network, the application of the integrated contraflow strategy comprises two steps: solve the transit-based evacuation problem, firstly, and then address the auto-based evacuation problem. The detailed optimization procedures are as follows.Step  1. Transit-based evacuation traffic assignment:(a)
generate the transit-based demands at the super origin nodes;(b)
assign the transit-based evacuation flow according to the selected route choice model;(c)
apply the bus contraflow configuration on the arterial links serving as evacuation transit routes.Step  2. Auto-based evacuation traffic assignment:(a)
remove the bus contraflow lanes from the network and calculate the remaining capacity;(b)
generate the auto-based demands at the super origin nodes;(c)
assign the auto-based evacuation flow according to the selected route choice model;(d)
determine the configurations of each link (deploy full-lane contraflow operation to the arterial links with oversaturated flow and leave the rest unchanged as noncontraflow).


## 2.1. Network Aggregation Method

Because of the large number of intersections and streets in urban areas, it is impossible to cover the whole urban network in network design problems. It is also a challenge for evacuation network design. Researchers usually abstract arterial subnetwork for optimization design from the whole network. Under this kind of network representation, as shown in Figure1(a), origin nodes of the network are located on arterials and each node has a fixed evacuation demand. This representation yields two disadvantages during multimodal evacuation. The first disadvantage is that the conventional representation hinders the application of transit priority. The transit-based evacuees are located in each arterial origin node, and it is neither feasible nor cost effective to provide transit priority on every arterial link. The second disadvantage is the inaccurate estimates of the evacuation demand distribution. Evacuees actually live in the zone surrounded by arterials and have the choice of accessing different adjacent arterials; thus, it is very hard to determine the fixed demand at arterial origin nodes. In other words, the evacuation demand of an arterial origin node is usually uncertain. To eliminate these two disadvantages in network representation, a network aggregation method is presented, as shown in Figure 1(b), which aims to reduce the number of origin nodes and balance calculation accuracy and efficiency.Comparison of network representation methods during evacuation.
(a)
Conventional network representation
(b)
Aggregated network representationBefore proceeding to the details of this aggregation method, it is worthwhile defining the road functional classification during evacuation first. Two basic classes of roads are considered in this study: arterials and local roads. Arterials are defined as road segments without direct connection with origin nodes, and they provide the mobility that evacuees need to reach network destinations as quickly and safely as possible. Local roads are directly connected with origin nodes, and they only serve local traffic access to arterials. Based on this classification, the evacuation network is divided into two parts: an arterial subnetwork and a number of simple local road subnetworks. A local road subnetwork is a closed zone bounded by arterial segments (e.g., the four squares surrounded by solid lines in Figure1(b)).There is another advantage of this network aggregation method: the flexible definition of road classification. If the network is very large or just a rough result is needed, the range of arterials can be restricted to a higher level (e.g., arterials with median barrier). If it is a district network or detailed result is needed, the collectors can also be included in the range of arterials.Each vehicle follows a similar two-stage evacuation process. First stage is from an origin location (e.g., home) to an arterial access point, within a local road subnetwork. Second stage is from an arterial access point to a destination via the arterial subnetwork. It is obvious that the evacuation distance of the second stage is much longer than that of the first stage, and those measures on arterial subnetwork are cost effective. Thus, we leave this subnetwork unaggregated to ensure the accuracy of the results. In addition, as the travel time on local road has little effect on the evacuation time, a local road subnetwork can then be aggregated to one super origin node and several virtual branches.The aggregation process works as follows: firstly, a super origin node is set to accommodate the entire evacuation demand in each zone; secondly, a virtual branch access point is used to represent the whole local road access points on an arterial segment (i.e., the road section between two adjacent arterial-arterial intersections); thirdly, virtual branches connecting super origin node with adjacent virtual branch access points are introduced to describe the paths accessed into the relevant arterial segments.


## 2.2. Integrated Contraflow Strategy

Contraflow is generally the use of one or more lanes of inbound travel for traffic movement in the outbound direction, which increases the operational evacuation capacity [11]. The research regarding contraflow has concentrated on the effectiveness, feasibility, and safety issues of implementing this measure. The research regarding contraflow has concentrated on the effectiveness and feasibility by simulation or numerical analysis. Using microscopic simulation, Theodoulou and Wolshon, Lim and Wolshon, and Williams et al. assessed the adequacy of the contraflow plan in terms of effectiveness or termination design [12–14]. On the aspect of numerical analysis, heuristic algorithms are usually used to solve the evacuation contraflow problems, such as tabu-based [15], greedy-based, and bottleneck relief [16] and genetic algorithm [17]. In actual applications, this measure has been widely used for hurricane evacuation in the states of the U.S. that lie along the Atlantic and Gulf Coasts [18].However, the conventional contraflow strategy still addressed auto-based evacuation only. Thus, transit vehicles and automobiles were mixed together which reduced the efficiency of transit recycle operation. Concerning this issue, Ren et al. proposed a new variant of contraflow operation, named bus contraflow, for the evacuation of transit-based evacuees [19]. This approach transformed contraflow lanes into exclusive bus lanes during evacuation, which guaranteed transit priority without degrading the efficiency of normal outbound lanes.Based on the research results above, an integrated contraflow strategy is suggested for the global optimization of multimodal evacuation. Arterials in the evacuation network contain three configurations, as shown in Figure2, under the control of integrated contraflow strategy: (a) noncontraflow to shorten the strategy setup time; (b) full-lane contraflow to maximize the evacuation network capacity; and (c) bus contraflow to realize the transit cycle operation. The bus contraflow configuration is applied on the arterials serving as evacuation transit routes. For the arterials only serving automobiles, the integrated strategy deploys full-lane contraflow operation to the arterials with oversaturated flow (i.e., the evacuation flow exceeded the normal outbound capacity) and leaves the rest unchanged.Arterials configurations under the control of integrated contraflow strategy.
(a)
Noncontraflow operation
(b)
Full-lane contraflow operation
(c)
Bus contraflow operationSince there are two kinds of evacuation demands existing in the evacuation network, the application of the integrated contraflow strategy comprises two steps: solve the transit-based evacuation problem, firstly, and then address the auto-based evacuation problem. The detailed optimization procedures are as follows.Step  1. Transit-based evacuation traffic assignment:(a)
generate the transit-based demands at the super origin nodes;(b)
assign the transit-based evacuation flow according to the selected route choice model;(c)
apply the bus contraflow configuration on the arterial links serving as evacuation transit routes.Step  2. Auto-based evacuation traffic assignment:(a)
remove the bus contraflow lanes from the network and calculate the remaining capacity;(b)
generate the auto-based demands at the super origin nodes;(c)
assign the auto-based evacuation flow according to the selected route choice model;(d)
determine the configurations of each link (deploy full-lane contraflow operation to the arterial links with oversaturated flow and leave the rest unchanged as noncontraflow).


## 3. Model Formulation

In the integrated contraflow strategy proposed above, appropriate route choice models were needed to assign the transit-based and auto-based evacuation flow. Thus, a group of feasible optimization models are established in this section.


### 3.1. Network Notation

See the network notation in Notations section.A graphG=(N,A) is defined to represent an aggregated evacuation network, where N and A are the sets of nodes and links, respectively. Both node set N and link set A are made up of their own component parts. The node set N includes four exclusive parts: super origin node set NS, virtual access node set NA, intersection node set NI, and destination node set ND, where N=NS∪NA∪NI∪ND. Accordingly, the link set A includes two exclusive parts: roadway-section link set AR and virtual branch link set AB, where A=AR∪AB.As each component, part of node set and link set, has its own characteristics, some assumptions are needed to make definite notation and simplify the calculation. These assumptions can be classified as one of the following four groups:(i)
one-way assumption,(ii)
virtual access assumption,(iii)
link property assumption,(iv)
super destination assumption.


#### 3.1.1. One-Way Assumption

The optimization models proposed by many researchers changed most of the arterials into one-way roads during evacuation [15, 16, 20]. In addition, the research results of Shekhar and Xie proved that 100 percent degree of contraflow (i.e., two-way roads are all converted to one-way roads) was one of the optimum or near optimum solutions to their network design problems [21, 22]. Therefore, all arterial segments are one-way sections in the evacuation network in this study. This means that the noncontraflow links also operate in one direction and leave the lanes of the opposite direction closed. This assumption can reduce the computation complexity of the proposed models and diminish the confusion of evacuees.


#### 3.1.2. Virtual Access Assumption

An arterial segment is divided into two roadway-section links by the virtual access node, and these two links are assumed to have the same length (i.e., the node is located in the middle of this section). Also, these two links can have opposite operation directions during evacuation.


#### 3.1.3. Link Property Assumption

The link properties are determined by the link functions. A roadway-section link is used for calculating evacuation time; thus, it is treated as an ordinary graphical link, associated with capacity, length, and other travel attributes. A virtual branch link provides access to the arterial subnetwork; so its link properties contain capacity and direction but no travel cost.


#### 3.1.4. Super Destination Assumption

Auto-based evacuation usually contains several destination nodes, but this feature increases the difficulty of problem solving. Thus, a single “super” destination node connecting all network exit nodes is established in each evacuation model (i.e., one for transit-based evacuation and another for auto-based evacuation). In this way, all travelers have the same destination but may reach it through different network exits, each of which constitutes a “real” destination.


### 3.2. Transit-Based Evacuation Model

As the transit-based evacuation is usually managed by the local government, transit drivers have little opportunity to select their evacuation routes. Thus, the routing problem of transit-based evacuation has been considered as a minimum-cost flow problem in this paper. The objective is to route transit vehicles to their closest evacuation destination. The evacuation model has been formulated as follows:(1)min⁡ZD=∑(i,j)∈ARxij*lij,
subject to
(2)∑j∈Γixij*-∑k∈Γi-1xki*=0,∀i∈NA∪NI(3)∑i∈Γhxhi*=dh*,∀h∈NS(4)xij*≤cij*zij,∀(i,j)∈AR(5)0≤xij*,∀(i,j)∈A.Constraints (2) and (3) describe the flow conservation constraints, meaning that the inflow volume equals the outflow volume. Constraint (4) is used to ensure the proper allowed amount of transit-based flow on each link. When zij=1, it indicates that bus contraflow configuration is applied on link (i,j); otherwise, the link is not serving as evacuation transit routes. Constraint (5) places the lower bound on all transit-based flow variables.


### 3.3. Auto-Based Evacuation Model

Different from the transit drivers which have fixed route during evacuation, private drivers may be uncertain about the evacuation planning and also may be using unfamiliar routes. Thus, the routing problem of auto-based evacuation is formulated as a discrete network design model where the underlying traffic flow pattern follows a user equilibrium model. It has a bilevel structure. The top level minimizes total network evacuation time using the integrated contraflow strategy, while the traffic volumes and travel times in streets are derived from equilibrium traffic assignment in the bottom level. The model can be described as follows.Up-level model(6)min⁡ZT=∑(i,j)∈ARxijtij,
where
(7)tij=tij0(1+α(xijcij′)β),∀(i,j)∈AR,cij′=cij-cij*zij
subject to
(8)yij+yji≤1,∀(i,j),(j,i)∈AR(9)xij≤cij′yij,∀(i,j)∈AR(10)0≤xij,∀(i,j)∈A.
Low-level model
(11)min⁡ZU=∑(i,j)∈AR∫0xijtij(ω)dω,
subject to
(12)dpq=∑r∈RpqXrpq,∀(p,q)∈V,(13)xij=∑(p,q)∈V∑r∈RpqXrpqδij,r,∀(i,j)∈AR(14)Xrpq≥0,∀r∈Rpq.Equation (7) calculates the travel time and the remaining capacity for auto-based evacuation of each link. Constraint (8) is a contraflow constraint, and it restricts that arterial segments are all converted to one-way sections. The connectivity indicator,yij, for all (i,j)∈AR, is a 0-1 dummy variable. Constraint (9) shows the inherent relationship between the connectivity indicator of a link and its auto-based evacuation flow. When yij=1, it indicates that a positive flow on link (i,j) is allowed; when yij=0, it indicates that link (i,j) is blocked and accordingly xij=0. Constraints (10) and (14) place the lower bound on all auto-based evacuation flow variables. Constraints (12) and (13) describe the inherent relationships of evacuation flow rates at the link, path, and O-D levels.


## 3.1. Network Notation

See the network notation in Notations section.A graphG=(N,A) is defined to represent an aggregated evacuation network, where N and A are the sets of nodes and links, respectively. Both node set N and link set A are made up of their own component parts. The node set N includes four exclusive parts: super origin node set NS, virtual access node set NA, intersection node set NI, and destination node set ND, where N=NS∪NA∪NI∪ND. Accordingly, the link set A includes two exclusive parts: roadway-section link set AR and virtual branch link set AB, where A=AR∪AB.As each component, part of node set and link set, has its own characteristics, some assumptions are needed to make definite notation and simplify the calculation. These assumptions can be classified as one of the following four groups:(i)
one-way assumption,(ii)
virtual access assumption,(iii)
link property assumption,(iv)
super destination assumption.


### 3.1.1. One-Way Assumption

The optimization models proposed by many researchers changed most of the arterials into one-way roads during evacuation [15, 16, 20]. In addition, the research results of Shekhar and Xie proved that 100 percent degree of contraflow (i.e., two-way roads are all converted to one-way roads) was one of the optimum or near optimum solutions to their network design problems [21, 22]. Therefore, all arterial segments are one-way sections in the evacuation network in this study. This means that the noncontraflow links also operate in one direction and leave the lanes of the opposite direction closed. This assumption can reduce the computation complexity of the proposed models and diminish the confusion of evacuees.


### 3.1.2. Virtual Access Assumption

An arterial segment is divided into two roadway-section links by the virtual access node, and these two links are assumed to have the same length (i.e., the node is located in the middle of this section). Also, these two links can have opposite operation directions during evacuation.


### 3.1.3. Link Property Assumption

The link properties are determined by the link functions. A roadway-section link is used for calculating evacuation time; thus, it is treated as an ordinary graphical link, associated with capacity, length, and other travel attributes. A virtual branch link provides access to the arterial subnetwork; so its link properties contain capacity and direction but no travel cost.


### 3.1.4. Super Destination Assumption

Auto-based evacuation usually contains several destination nodes, but this feature increases the difficulty of problem solving. Thus, a single “super” destination node connecting all network exit nodes is established in each evacuation model (i.e., one for transit-based evacuation and another for auto-based evacuation). In this way, all travelers have the same destination but may reach it through different network exits, each of which constitutes a “real” destination.


## 3.1.1. One-Way Assumption

The optimization models proposed by many researchers changed most of the arterials into one-way roads during evacuation [15, 16, 20]. In addition, the research results of Shekhar and Xie proved that 100 percent degree of contraflow (i.e., two-way roads are all converted to one-way roads) was one of the optimum or near optimum solutions to their network design problems [21, 22]. Therefore, all arterial segments are one-way sections in the evacuation network in this study. This means that the noncontraflow links also operate in one direction and leave the lanes of the opposite direction closed. This assumption can reduce the computation complexity of the proposed models and diminish the confusion of evacuees.


## 3.1.2. Virtual Access Assumption

An arterial segment is divided into two roadway-section links by the virtual access node, and these two links are assumed to have the same length (i.e., the node is located in the middle of this section). Also, these two links can have opposite operation directions during evacuation.


## 3.1.3. Link Property Assumption

The link properties are determined by the link functions. A roadway-section link is used for calculating evacuation time; thus, it is treated as an ordinary graphical link, associated with capacity, length, and other travel attributes. A virtual branch link provides access to the arterial subnetwork; so its link properties contain capacity and direction but no travel cost.


## 3.1.4. Super Destination Assumption

Auto-based evacuation usually contains several destination nodes, but this feature increases the difficulty of problem solving. Thus, a single “super” destination node connecting all network exit nodes is established in each evacuation model (i.e., one for transit-based evacuation and another for auto-based evacuation). In this way, all travelers have the same destination but may reach it through different network exits, each of which constitutes a “real” destination.


## 3.2. Transit-Based Evacuation Model

As the transit-based evacuation is usually managed by the local government, transit drivers have little opportunity to select their evacuation routes. Thus, the routing problem of transit-based evacuation has been considered as a minimum-cost flow problem in this paper. The objective is to route transit vehicles to their closest evacuation destination. The evacuation model has been formulated as follows:(1)min⁡ZD=∑(i,j)∈ARxij*lij,
subject to
(2)∑j∈Γixij*-∑k∈Γi-1xki*=0,∀i∈NA∪NI(3)∑i∈Γhxhi*=dh*,∀h∈NS(4)xij*≤cij*zij,∀(i,j)∈AR(5)0≤xij*,∀(i,j)∈A.Constraints (2) and (3) describe the flow conservation constraints, meaning that the inflow volume equals the outflow volume. Constraint (4) is used to ensure the proper allowed amount of transit-based flow on each link. When zij=1, it indicates that bus contraflow configuration is applied on link (i,j); otherwise, the link is not serving as evacuation transit routes. Constraint (5) places the lower bound on all transit-based flow variables.


## 3.3. Auto-Based Evacuation Model

Different from the transit drivers which have fixed route during evacuation, private drivers may be uncertain about the evacuation planning and also may be using unfamiliar routes. Thus, the routing problem of auto-based evacuation is formulated as a discrete network design model where the underlying traffic flow pattern follows a user equilibrium model. It has a bilevel structure. The top level minimizes total network evacuation time using the integrated contraflow strategy, while the traffic volumes and travel times in streets are derived from equilibrium traffic assignment in the bottom level. The model can be described as follows.Up-level model(6)min⁡ZT=∑(i,j)∈ARxijtij,
where
(7)tij=tij0(1+α(xijcij′)β),∀(i,j)∈AR,cij′=cij-cij*zij
subject to
(8)yij+yji≤1,∀(i,j),(j,i)∈AR(9)xij≤cij′yij,∀(i,j)∈AR(10)0≤xij,∀(i,j)∈A.
Low-level model
(11)min⁡ZU=∑(i,j)∈AR∫0xijtij(ω)dω,
subject to
(12)dpq=∑r∈RpqXrpq,∀(p,q)∈V,(13)xij=∑(p,q)∈V∑r∈RpqXrpqδij,r,∀(i,j)∈AR(14)Xrpq≥0,∀r∈Rpq.Equation (7) calculates the travel time and the remaining capacity for auto-based evacuation of each link. Constraint (8) is a contraflow constraint, and it restricts that arterial segments are all converted to one-way sections. The connectivity indicator,yij, for all (i,j)∈AR, is a 0-1 dummy variable. Constraint (9) shows the inherent relationship between the connectivity indicator of a link and its auto-based evacuation flow. When yij=1, it indicates that a positive flow on link (i,j) is allowed; when yij=0, it indicates that link (i,j) is blocked and accordingly xij=0. Constraints (10) and (14) place the lower bound on all auto-based evacuation flow variables. Constraints (12) and (13) describe the inherent relationships of evacuation flow rates at the link, path, and O-D levels.


## 4. Solution Method

According to the methodological framework of integrated contraflow strategy, we develop a two-stage solution method to tackle the proposed optimization models. Firstly, the transit-based evacuation problem is solved using network branch and bound method; then, genetic algorithm (GA) is applied to search for the optimal or approximate optimal network configuration for auto-based evacuation. In this section, the detailed descriptions of algorithms are presented.The transit-based evacuation problem can be seen as a minimum-cost flow problem with multiple origin nodes and single super destination node. This is a mixed-integer linear programming problem that can be solved in a very efficient manner using the branch and bound method.The auto-based evacuation model has a bilevel structure, which is usually solved using heuristic algorithms [23]. GA is a population-based metaheuristic algorithm inspired by the genetic evolution process of species in the nature. It has been widely used to solve the one-way or contraflow design problem, Drezner and Salhi, Zargari and Taromi, and Karoonsoontawong and Lin have applied GA with various fitness functions in their studies [17, 24, 25]. Based on the general procedure of GA, four specific elements of the GA-based approach are introduced.


### 4.1. Solution Encoding

Discrete decision variables (i.e., link directions) are coded as chromosomes. The chromosomes are 2-row matrices, in which columns correspond to network links and rows correspond to their directions. When the binary variable is 1, it means that this link direction can be used by evacuation vehicles. Otherwise, it means that this link direction is closed. The length of each chromosome is equal to the total number of roadway-section links and intersection links.


### 4.2. Fitness Function

Since the purpose of this project is to minimize the total evacuation time for auto-based evacuees, this purpose function could be used as the fitness function. Therefore, the fitness function of this project is considered as a corresponding subproblem for a fixed set ofyij*.Up-level model(15)min⁡ZT′=∑(i,j)∈ARxijtij,subject to constraint (10)
(16)xij≤cij′yij*,∀(i,j)∈AR.
Low-level model
(17)min⁡ZU=∑(i,j)∈AR∫0xijtij(ω)dω,
subject to constraints (12)–(14).y
j
s
* is a fixed set of link connectivity indicator variables represented by a chromosome. The above subproblem can be solved using a sensitivity analysis based (SAB) algorithm which is very common in Network Design Problems with continuous variable. Since the objective function of UM has a linear form, the optimal solution is located at the boundary of feasible space. Therefore, the optimal value of the object is located where all constraints in (16) are satisfied and further increasing its value will make at least one of the constraints infeasible. For each objective value of up-level model, the user equilibrium assignment problem (LM) must be solved to find the equilibrium values. The convex nonlinear problem (LM) can be solved by a convex combinations based algorithm called Frank-Wolfe method, which is often used in NDP studies. For more detailed information, please refer to [26].


### 4.3. Crossover Operator

Because of the connectivity demand of the network, we adopted the crossover operator developed by Drezner and Wesolowsky [27]. The operator attempts to merge two parents in a way in which the set of links taken from each parent forms a connected set. Such a connected set is built by selecting one node in the network as the “pivot” node. For each pivot node, each link of the network is endowed with a count which represents the minimum number of links needed to get to pivot node. Then, the design of links with a count below the median is taken from one parent, while the design of links with a count above the median is selected from another parent. Based on the partitioning method described, the connectivity of two half networks can be inherited by the next generation. For more detailed information, please refer to [23, 27].


### 4.4. Connectivity Checking

Two types of network connectivity are checked in our study. Equation (18) checks the node connectivity by judging whether each node has at least one outgoing link. If the first test is successful, the network is subjected to complete connectivity checking using the shortest path generation method between each super origin node and the super destination node. If the shortest path cannot be generated, the network is considered as disconnected. Here, Dijkstra’s method is used as the shortest path generation method:
(18)∑j∈Γjyij*≥1,∀i∈NA∪NI.


## 4.1. Solution Encoding

Discrete decision variables (i.e., link directions) are coded as chromosomes. The chromosomes are 2-row matrices, in which columns correspond to network links and rows correspond to their directions. When the binary variable is 1, it means that this link direction can be used by evacuation vehicles. Otherwise, it means that this link direction is closed. The length of each chromosome is equal to the total number of roadway-section links and intersection links.


## 4.2. Fitness Function

Since the purpose of this project is to minimize the total evacuation time for auto-based evacuees, this purpose function could be used as the fitness function. Therefore, the fitness function of this project is considered as a corresponding subproblem for a fixed set ofyij*.Up-level model(15)min⁡ZT′=∑(i,j)∈ARxijtij,subject to constraint (10)
(16)xij≤cij′yij*,∀(i,j)∈AR.
Low-level model
(17)min⁡ZU=∑(i,j)∈AR∫0xijtij(ω)dω,
subject to constraints (12)–(14).y
j
s
* is a fixed set of link connectivity indicator variables represented by a chromosome. The above subproblem can be solved using a sensitivity analysis based (SAB) algorithm which is very common in Network Design Problems with continuous variable. Since the objective function of UM has a linear form, the optimal solution is located at the boundary of feasible space. Therefore, the optimal value of the object is located where all constraints in (16) are satisfied and further increasing its value will make at least one of the constraints infeasible. For each objective value of up-level model, the user equilibrium assignment problem (LM) must be solved to find the equilibrium values. The convex nonlinear problem (LM) can be solved by a convex combinations based algorithm called Frank-Wolfe method, which is often used in NDP studies. For more detailed information, please refer to [26].


## 4.3. Crossover Operator

Because of the connectivity demand of the network, we adopted the crossover operator developed by Drezner and Wesolowsky [27]. The operator attempts to merge two parents in a way in which the set of links taken from each parent forms a connected set. Such a connected set is built by selecting one node in the network as the “pivot” node. For each pivot node, each link of the network is endowed with a count which represents the minimum number of links needed to get to pivot node. Then, the design of links with a count below the median is taken from one parent, while the design of links with a count above the median is selected from another parent. Based on the partitioning method described, the connectivity of two half networks can be inherited by the next generation. For more detailed information, please refer to [23, 27].


## 4.4. Connectivity Checking

Two types of network connectivity are checked in our study. Equation (18) checks the node connectivity by judging whether each node has at least one outgoing link. If the first test is successful, the network is subjected to complete connectivity checking using the shortest path generation method between each super origin node and the super destination node. If the shortest path cannot be generated, the network is considered as disconnected. Here, Dijkstra’s method is used as the shortest path generation method:
(18)∑j∈Γjyij*≥1,∀i∈NA∪NI.


## 5. Case Study

To have a better understanding of the methods and models, it is necessary to carry out experiments in networks with realistic topology and size. Ningbo City, located on the east coast of the Pacific Ocean, is selected for the case study. This coastal city suffers an average of 3.1 typhoons each year. The evacuation network covers the low-lying areas of Ningbo City, which is approximately 10 km by 14 km in size.The evacuation destinations are set according to the Antityphoon Action Plan of Ningbo City [28]. The destinations of auto-based evacuation are the three access points to the highway system. Since the low-mobility population is planned to be evacuated using high-speed rail, the railway station is identified as the destination of transit-based evacuation.Using the proposed network aggregation method, the evacuation network is represented in Figure3. This aggregated network contained 1 transit-based evacuation destination node, 3 auto-based evacuation destination nodes, 18 super origin nodes, 22 arterial-arterial intersections, and 39 roadway sections. The network geometric data (such as section length, number of lanes, and design speed) was set according to the Urban Traffic Planning of Beilun District (2010–2020) [29].Figure 3
Evacuation network of Ningbo City study area.By assuming a typhoon red warning in which all residents in the study area are required to evacuate, thus, a total of 350,000 people are estimated to be evacuated using 69,000 auto vehicles and a number of transit vehicles. Detailed to each zone in Figure3, the population and the number of auto vehicles can be calculated using the data provided by the Urban Traffic Planning of Beilun District (2010–2020) [29].Both transit-based and auto-based evacuation demands are assumed to be concentrated in super origin nodes. The auto-based demand can be set to the total number of vehicles in the zone directly, while the transit-based demand needs to be calculated as shown in formulation (17). In the case study, the parameter a is set to 2.9 (the average number of family members in the cities of China) and the parameter b is set to 35 (the general number of seats for 12-meter bus). The surge demand rates are approximated by using the historical diurnal curves of evacuation demand generation, such as those presented by Wang et al. [10]. Consider
(19)Vtran⁡i=Pi-aVautoib,
where Vtran⁡i is the transit-based evacuation demand of zone i,  Vautoi is the auto-based evacuation demand of zone i,  Pi is the number of residents of zone i,  a is a parameter, the number of occupants of auto vehicles, and   b is a parameter, the number of occupants of transit vehicles.The proposed solution algorithm was implemented by Matlab. Firstly, the transit-based evacuation problem was solved using branch and bound method; then, GA was applied in the auto-based evacuation problem. As GA is one of the heuristic algorithms, the Matlab procedure of the second step was run five times to find a better solution. The best solution of the five runs was then selected as the final plan which was used for the result analysis summarized below.Figure4 shows the transit-based evacuation (TBE) plan of the proposed network. The TBE problem has been formulated as a minimum-cost flow model in the paper. For each super origin node, one virtual branch has been selected as the access link of transit vehicles, as this branch can provide the shortest path to the TBE destination among the connected virtual branches. In the arterial subnetwork, those shortest paths merge into several evacuation transit routes which can realize the transit cycle operation. And the bus contraflow configuration is applied to the arterial links serving as evacuation transit routes.Figure 4
Optimal route planning for transit-based evacuation.The next step is applying the bilevel auto-based evacuation (ABE) model to the remaining network. To ensure convergence of results, the population number and the iteration number of GA were set to 50 and 300, respectively. And due to the trade-off between solution quality and computational effort, the number of “pivot” nodes in each generation was chosen to be equal to 1/5 of the population with random selection. Details of convergence levels to optimal or approximate optimal solution and the best solution of modeling are highlighted in Figure5. Inspection of results displayed in Figure 5 reveals that, after about 120 iterations, the model solution reached convergence.Figure 5
Details of convergence levels to optimal or approximate optimal solution.By loading the network reconfiguration results of ABE into Figure2, we can get the optimal or approximate optimal evacuation plan for multimodal evacuation, as shown in Figure 6. For each local road subnetwork, the traffic flow on virtual branches is related to the condition of adjacent arterials, and some branches may have a zero-flow rate. This phenomenon shows the uncertain evacuation demand of the arterial subnetwork. On the other hand, the full-lane contraflow operation is deployed on the arterials close to ABE destinations, which can be used to determine the terminals of full-lane contraflow operation in the practice.Figure 6
Optimal or approximate optimal evacuation plan for multimodal evacuation.


## 6. Conclusions and Future Work

During an evacuation, car owners need evacuation traffic management, whereas transit-dependent residents need evacuation transportation support [30]. Thus, an evacuation traffic management method provides more efficient evacuation by considering both car-based and transit-based evacuation needs. With this purpose in mind, this study presents an integrated contraflow strategy to improve the efficiency of multimodal evacuation.The integrated contraflow strategy is based on the phenomenon that the transit-based evacuees and the auto-based evacuees will be evacuated to different destinations. The former are supposed to withdraw the hazardous area using their own vehicles, and the latter may need to be sent to the processing centers within the hazardous area for further evacuation. The integrated contraflow strategy takes a two-step procedure to realize the multimodal optimization: solve the transit-based evacuation problem, firstly, and then address the auto-based evacuation problem.The two-step optimization procedure was then modeled. As the transit-based evacuation is usually managed by the local government, transit drivers have little opportunity to select their evacuation routes. Thus, the transit-based evacuation model was formulated as a minimum-cost flow model. On the other hand, private drivers may be uncertain about their destination, a bilevel network flow model was then developed for auto-based evacuation. The optimization or approximate optimal evacuation plan of the evacuation network was obtained in the top level, while the traffic volumes and travel times in streets were derived from equilibrium traffic assignment in the bottom level.And to better reflect the real world evacuation, a new network aggregation method was also described in this study. The arterial subnetwork was a large-scale network with uncertain evacuation demand, as evacuees actually have the choice of accessing adjacent arterials through the local road subnetwork. However, it was impossible to optimize an evacuation network containing all arterials and local roads. The network aggregation method in this study was a balance between accuracy and efficiency. The arterial subnetwork was left unaggregated to ensure the accuracy of the results, while the local road subnetworks were aggregated to simplify the representation and calculation. This method also gathered transit-based evacuation demand of each zone, which reduced the number of origin nodes to accommodate the application of transit priority.There are a number of directions to pursue in the context of this study. The routing problem in the local road subnetwork should be analyzed in the future. The management of arterial-arterial intersection can also be discussed. For example, the crossing-conflicts are expected to be eliminated to improve the evacuation effectiveness and safety. Finally, the transit priority at intersection may also be considered for the further improvement of the transit-based evacuation.



---

*Source: 159473-2014-05-13.xml*