Optimization of an Airport Departure Hall Evacuation Plan Based on a Time-Varying Network Algorithm

,


Introduction
Te Civil Aviation Administration of China was deployed to implement "paperless" convenient travel services across the industry. Civil aviation is becoming more and more intelligent, travel is becoming more and more convenient, and travel by air has become the choice of more and more people. As a result, the terminal building has become a dense area for passengers in the airport, and in the event of an emergency, the traditional evacuation method leaves some passengers unable to fnd an efective escape route in time and makes the terminal area prone to regional congestion. Terefore, it is important to study the optimization of the emergency evacuation plan for passengers in terminal buildings. Previously, some experts have performed related research. Antonova et al. [1] employed AnyLogic software to analyze inbound passenger fow to check congestion points. Yang et al. [2] sought to meet the transportation demand for taxis and alleviate the problem of mismatch between the supply and demand of taxis. Guo et al. [3] used the exit fow equilibrium method based on crowd evacuation dynamics theory to clarify the reasons that hinder the evacuation of aircraft cabin passengers. Han et al. [4] proposed an extended route selection model based on the set of available evacuation routes to simulate the choice of pedestrians in selecting the appropriate route during evacuation in emergency situations. Khamis et al. [5] proposed an artifcial bee colony optimization method based on a stochastic approach, which requires fewer control parameters to be adjusted in fnding the optimal exit. Zhao et al. [6] improved the efciency of pedestrian evacuation through diferent obstacle types. Jin et al. [7] compared diferent evacuation strategies in subway under node failure situation. To further investigate the infuence of adjacent exit evacuation behavior and familiarity on exit selection, Kinateder et al. [8] conducted the frst experimental test of the exit familiarity assumption and investigated how it interacts with social infuences to determine exit selection during evacuation. Kallianiotis et al. [9] studied the efect of passenger evacuation speed and evacuation route selection on evacuation time. Fahad et al. [10] studied the factors infuencing the severity of damage and predicted the number of future collisions. Li [11] analyzed the efect of indoor space layout on evacuation efciency. Jiaojiao and Jin [12] established an evaluation system on the analysis of passenger evacuation bottleneck factors and proposed a risk evaluation method. Jiang et al. [13] simulated the evacuation process through simulation software and analyzed the congestion characteristics of the platform stairs during peak hours. Wang et al. [14] discussed the infuence of risk factors on the frequency of urban trafc accidents while considering the temporal and spatial correlation and heterogeneity of trafc accidents. Li et al. [15] took the old dormitory building of a large university as an example and used the Pathfnder software platform to perform multiple evacuation simulations with parameter settings for the building and occupants. Chen et al. [16] examined the infuence of socioeconomic factors, travel day characteristics, and behavioral factors on evacuation and destination selection decisions.
Recently, the dynamic evacuation problem has become a hot research topic. Zhang et al. [17] proposed to solve the path optimization problem based on a priori evacuation network with the breadth-frst search strategy and dynamically update the evacuation path based on real-time information. Hu and Cai [18] proposed a method to improve the evacuation efciency of people on board cruise ships by controlling the density of passengers. Cao et al. [19] developed a microscopic simulation model to describe the fuzzy behavior of pedestrians under view-limited conditions and defned seven fuzzy sets for the evacuation process. Wang et al. [20] proposed a mixed integer nonlinear multiobjective programming model and used a combination of simulated annealing (SA) algorithm and particle swarm optimization (PSO) algorithm to solve the complex model. Liu et al. [21] presented a real-time evacuation route approach based on emotion and geodesic under the infuence of individual emotion and multihazard circumstances. Yu et al. [22] developed dynamically updatable data structures and a matrix-based greedy search algorithm to support dynamic evacuation path search for multiple evacuees. Facing the dynamic situation, Zhao et al. [23] used dynamic planning to search for the optimal paths and informed everyone how to move toward the exit. Neural networks are good at learning the hidden knowledge from sample date. Peng et al. [24] used neural networks to decide which paths are available for people to evacuate dynamically.
Efective emergency evacuation routes are essential for the safety of people in an accident, and the basic requirement is that travelers get the best route in a short time to adapt to dynamic changes [17]. Based on dynamic evacuation, can the traditional evacuation scheme be further optimized if the real-time change of spatiotemporal crowding is considered. Terefore, this study intends to propose a dynamic evacuation path optimization method to change the optimal evacuation path of passengers in real time by considering the spatiotemporal crowding of regional passengers.

Constructed Evacuation Network Diagram
2.1. Airport Departure Hall Plan. In this paper, we focus on the efciency of passenger evacuation at the departure hall of Shenzhen Bao'an International Airport as a simulation site, and the plan of the departure hall is shown in Figure 1. Passengers frst enter the departure hall from the gate lobby and then check in at diferent check-in areas (such as selfservice check-in, manual check-in, and VIP lounge checkin); if they have large luggage, they need to go to the check-in counters on both sides of the departure hall for check-in and fnally arrive at the security check waiting area to queue for the security check through these security check channels.

Evacuation Network Diagram.
Te evacuation rules are set as follows: from the moment of starting evacuation, all business handling areas (check-in area and security check waiting area), nonbusiness handling areas (stores, toilets, rest areas, etc.), and passengers who have not completed a security check stop active processes, and then passengers immediately seek to reach the safety area through gates 1 to 7, and the evacuation process ends when the number of passengers in the departure hall is 0.
In this paper, the evacuation process is simplifed to point-to-point evacuation, so the departure hall foor plan is abstracted into source nodes, root nodes, and edges to form an evacuation network diagram, as shown in Figure 2. In the evacuation process of passengers in the departure hall, all of the areas where passengers are to be evacuated (such as the security check waiting area, security check waiting area entrance area, check-in area, and other business processing areas and nonbusiness processing areas such as stores, toilets and rest areas) can be attributed to the source node in the area by using the principle of proximity and travel to the root node (safety exit) through the optional evacuation path (edge) to complete the overall process. Te evacuation network has 38 source nodes in the security check waiting area, which is set as the A area, with each source node in turn set as A1-A38 from top to bottom; the security check waiting area entrance area has four source nodes, which is set as the B area, with each source node in turn set as B1-B4 from top to bottom; the check-in area has 19 source nodes, which is set as the C area, with each source node in turn set as C1-C19 from top to bottom. Tere are seven root nodes in the security exit area, and this area is designated as the D area, with each root node represented from top to bottom by D1-D7. In addition, there are various obstacles in the evacuation process of the terminal departure hall because all passengers to be evacuated are evacuated in the same direction, and the obstacles do not block the evacuation nodes, so this study does not consider the obstacles and only calculates the physical distance between nodes.

Evacuation Model Based on the Time-Varying Network Algorithm
Te paper establishes a linear programming model based on time-varying network algorithm evacuation rules to derive the optimal evacuation path set under the time-varying network algorithm evacuation rules to minimize the evacuation time of all passengers and achieve the global optimization of emergency evacuation of passengers by considering the spatial and temporal congestion of regional passengers.

Randomized Evacuation Rule Based on the Shortest Circuit
Algorithm. In the unguided conduct of random emergency evacuation, to reach the safe area as soon as possible, each traveler tends to choose the shortest evacuation path. Terefore, the principle of shortest circuit-based evacuation is that the traveler follows the physically shortest edge from the source node to the root node. Te paper assumes that all traveler behaviors are based on the shortest path principle when using the random evacuation rule. Terefore, if passengers are not evenly distributed at the beginning of the evacuation, the process may result in the majority of passengers concentrating on the few evacuation paths with the shortest distance to the safety point, which will inevitably result in congestion.

Evacuation Rules Based on the Time-Varying Network
Algorithm. Te shortest evacuation distance during passenger evacuation does not mean the shortest evacuation time, so the concept of spatiotemporal crowding is introduced. Spatiotemporal congestion is a description of the degree of congestion of moving objects in time and space [25]. According to the actual spatial distribution, each node in the terminal building corresponds to a slice region, and the object of the spatiotemporal crowding degree study is the region, so this paper precisely discusses the spatiotemporal crowding degree of the slice region corresponding to the node (hereafter referred to as the spatiotemporal crowding degree of the node).
In the evacuation process, travelers will pass through their respective evacuation paths and reach the safety area at diferent moments. Te spatiotemporal trajectory is sliced at the jth time interval at node i. Te total number of people at the node in the time interval is counted as the area of the node corresponding to the sliced area, and the fnal value of the spatiotemporal congestion of the travelers in the area at the jth time slice in the ith node is obtained: When studying passenger evacuation paths based on a time-varying network algorithm, it is necessary to set the upper limit of a reasonable value of spatiotemporal congestion in advance, unifed as 2 in this paper; that is, when 0 < F(i, Δt j ) < 2, the spatiotemporal congestion of the sliced area where the node is located is within a reasonable range. In addition, to simplify the model, it is stipulated that all passengers in any slice area automatically belong to the corresponding node; that is, the corresponding node in the slice area is regarded as the departure point for evacuating passengers in that area.
Before each real-time optimization of the passenger emergency evacuation path, it is necessary to determine whether the time of Δt j congestion within the time slice on   Mathematical Problems in Engineering the next target node i is within a reasonable range, that is, whether the passenger selection of this evacuation path can guarantee the evacuation speed. Based on Dijkstra's algorithm, the time-varying network algorithm is established by dynamically calculating the spatial and temporal congestion of regional travelers. Te optimal evacuation path is recalculated under the existing F(i, Δt j ) for each passenger to be assigned an evacuation path. Te specifc rules are as follows [26]: Step 1: Determine the starting evacuation location of passengers as the starting point of the time-varying network algorithm search.
Step 2: Due to the congestion in the evacuation process, the calculated lengths of all evacuation paths are no longer static and individually calculated, but the spatiotemporal congestion of the next destination node is considered.
Step 3: Te next destination node with the shortest evacuation time is selected by the linear programming model calculation of the time-varying network algorithm.
Step 4: Determine whether all subsequent selectable destination nodes have been computed, and if so, generate a traveler evacuation path; otherwise, continue the computation.
Step 5: Te path with the shortest evacuation time is selected as the searched area, and the current optimal evacuation path and the moment of passing through it are updated.
Step 6: Each time the calculation is completed, a new evacuation path P i is generated. P i is the optimal evacuation path for travelers at that node, the path is assigned to each traveler m, and the spatiotemporal congestion of regional travelers in all current evacuation paths is updated.
Step 7: Returning to Step 1, the optimal evacuation path of the next passenger m to be evacuated is calculated cyclically, and the evacuation path of passenger m is recalculated each time based on the spatiotemporal congestion on the evacuation path of m − 1 passengers according to equation (1) until all passengers are evacuated. Te fow chart of the time-varying network algorithm is shown in Figure 3 [27].
In summary, the time-varying network algorithm-based evacuation rule is used to assign optimal evacuation paths to travelers by calculating the spatiotemporal congestion of the time slices of the nodes and setting the real-time capacity limits of the area. Te core of the algorithm lies in building a mathematical model to assist in choosing the dominant path, which will be discussed in the next subsection [28].

Linear Programming mWodel Based on the Time-Varying
Network Algorithm. Based on the analysis of the spatiotemporal congestion of passengers, combined with the shortest circuit theory, the linear programming model of the time-varying network algorithm is established to determine the target exit and dominant path of diferent groups by calculating the minimum evacuation time. Finally, the evacuation path assigned to each group of passengers is the relative dominant path, and all evacuation paths achieve a Time-varying network algorithm to optimize passenger evacuation routes Update the region traveler spatiotemporal congestion within the spatiotemporal slices in all nodes The spatiotemporal congestion within the next destination node time slice is in a reasonable range when using the current evacuation path The optimal evacuation path can be selected by time-varying network algorithm calculation All passengers have been evacuated Te overall evacuation path of this algorithm is divided into three segments, and each segment fnds the corresponding optimal evacuation path by calculating the shortest evacuation time of passengers.
(1) Evacuation from area A to area B: Here, T n1 indicates the shortest evacuation time of passengers in the security waiting area (zone A) from the source node where they are located to a source node at the entrance of the security waiting area (zone B).
where A is 1 when passenger n is at the source node of the security waiting area, and 0, otherwise. When the temporal congestion in any of the sliced areas corresponding to the four nodes at the entrance to the security waiting area (area B) is within a reasonable range, at which B(i, Δt j ) � 1, S n1 is the shortest evacuation time from area A to area B within the time slice; if the spatiotemporal congestion in any area is not within a reasonable range, then B(i, Δt j ) � 0; that is, the shortest evacuation time from area A to area B within the time slice is denoted by S n2 . At this time, the source node b corresponding to the minimum value of spatiotemporal congestion F(i, Δt) is taken as the next target point in the optimized path, and e � b. A i B b , A i B e denotes the distance from a node in area A to a node in area B. v is the evacuation speed within the time slice of the traveler, and the evacuation speed is related to the gender of the traveler and the spatiotemporal congestion of the area, as shown in Table 1.
(2) Evacuation from area B to area C: Here, T n2 indicates the shortest evacuation time from the source node where the passenger is located to a source node in the check-in area (Area C) at the entrance to the security waiting area (Area B).
where B is 1 when passenger n is in the security check waiting area entrance source node; otherwise, it is 0. When the slicing area corresponding to 19 nodes in the check-in area (C area) which has any one area where the temporal congestion is within a reasonable range, then B(i, Δt j ) � 1, that is, S n3 is the shortest evacuation time from area B to area C within the time slice; if the spatiotemporal congestion in any region is not in a reasonable range, B(i, Δt j ) � 0, and the shortest evacuation time from region B to region C within the time slice is denoted by S n4 . At this point, the source node c corresponding to the minimum value of spatiotemporal congestion F(i, Δt) is taken as the next target point in the optimization path and f � c. B i C i , B i C f denotes the distance from a node in region B to a node in region C.
(3) Evacuation from area C to area D: Here, T n3 indicates the minimum evacuation time of passengers in the check-in area (Area C) from the source node where they are located to a source node at the security exit (Area D).
where C is 1 when traveler n is in the source node of the value plane area; otherwise, it is 0. When the temporal congestion of any one of the sliced areas corresponding to the seven nodes of the security exit (D area) is within a reasonable range, then B(i, Δt j ) � 1; that is, S n5 is the shortest evacuation time from the C area to the D area within the time slice; if the temporal congestion of any one area is not within a reasonable range, then B(i, Δt j ) � 0; that is, the shortest evacuation time from the C area to the D area within the time slice is expressed by S n6 . At this point, the source node d corresponding to the minimum value of spatiotemporal congestion F(i, Δt) is taken as the next target point in the optimization path, and g � d.C i D d , C i D g denotes the distance from a node in zone C to a node in zone D.
(4) Overall evacuation time T: where z is the total number of people in the terminal at the time of evacuation, and T is the overall evacuation time; that is, the time when the last passenger in the terminal evacuated to the safety exit also marks the end of the overall evacuation process.

Data Selection
(1) Peak hour refers to the time period in which the airport terminal has the highest passenger fow. Te peak hour at Shenzhen Bao'an International Airport is from 9:00 to 9:59 a.m. Based on the passenger occupancy rate, and calculated according to the average passenger occupancy rate of 80% for regular domestic fights in the civil aviation industry, the number of passengers during the airport peak hour is approximately 3,300: Here, A is the number of passengers in the selected time period, n is the number of departures in the peak hour at the airport, b i is the maximum capacity of the fight, and O is the average passenger seat rate of the fight in the civil aviation industry.
(2) Passenger process time is as shown in Table 2, and the data were acquired from 100 randomly selected passengers (including diferent attributes, such as diferent ages, genders, amounts of luggage carried, and diferent levels of familiarity with the ticketing process) on-site every day in January 2022. Te average time interval of each process for each person was obtained after 30 days of monitoring, and the passenger time was represented by a normal distribution.

(3) Proportion of passengers using check-in islands:
Based on the statistics of the number of fights of each airline in the airport from 9:00-9:59 each day in January 2022, the proportion of passengers going to diferent check-in islands for check-in is derived. (4) Te characteristics of the passengers to be evacuated are shown in Table 3 (5) Passenger evacuation speed: Table 1 shows the values of evacuation speed for passengers of diferent genders under diferent evacuation states and with temporal and spatial crowding.

Simulation Model Construction.
First, the CAD drawing is imported into the main view of AnyLogic software; second, the internal facilities (such as terminal perimeter, security check area, and check-in area) are created by the corresponding modules in the software. Te model in the software is presented as a fowchart of passenger behavior, which is realized by modules such as PedSource, PedGoTo, PedService, PedSink, and PedSelectOutput. Te model constructed in this paper includes two parts: departure process and passenger emergency evacuation.
In the event of an emergency in the departure lobby, the "Evacuate" button initiates the passenger evacuation mode, at which point the PedSource module stops generating passengers, indicating that no more passengers are entering the terminal, and the evacuation process is realized through the lower ports of each module. When emergency evacuation begins, all passengers in the module enter the connected PedGoTo module through the lower port. Te shortest  Mathematical Problems in Engineering circuit algorithm and the time-varying network algorithm are written in JAVA as function modules and incorporated into the PedGoTo module of the evacuation process, which means that when the passengers enter the PedGoTo module, the function is run to calculate the result: the optimal evacuation path for the passengers. Another event module is set to defne the evacuation speed of passengers, and the corresponding conditional statements are written according to Table 1 to show the evacuation speeds of passengers under diferent temporal and spatial congestion conditions.

Simulation Analysis of Evacuation Based on the Principle of the Shortest Circuit.
Te process of terminal passenger evacuation simulation is as follows: according to the business processes of departing passengers, departing passengers move inside the terminal building, and when the number of passengers entering the terminal building inside the departure hall reaches 3,300, after several simulations, the average number of passengers not passing the security check inside the terminal building is assumed to be 1,300. With these 1,300 people evacuated, the simulation was initiated according to the principle of the shortest circuit until the number of passengers in the departure hall was 0. Te curve of the number of evacuees at each exit as a function of time after 30 simulations is shown in Figure 4.
From Figure 4, it can be determined that all passengers evacuate to the safe area in 496 s. B and D are bottleneck areas for evacuation mainly because of the uneven distribution of equipment. In D, doors 3 and 5 maintain a high number of passengers evacuated from the beginning of evacuation to the end of evacuation, the curve corresponding to door 4 has an infection point at 150 s, and the slope change increases when passengers in the security check waiting area start to use door 4 for evacuation. Te numbers of evacuees at exits 1, 2, 6, and 7 after 150 s are nearly constant, indicating that passengers do not use these four exits. Among all exits, the numbers of passengers using doors 3, 4, and 5 to complete the evacuation are the largest, and the numbers of evacuees using doors 1 and 2 are the smallest.
Comprehensive analysis of the frst simulation results shows that to reach the safe area as soon as possible, most travelers follow the principle of the shortest circuit, so some shorter surface routes will be chosen by too many people, leading to increased spatiotemporal congestion and slower escape speed. In addition, the herd mentality also aggravates the congestion of these paths.

Simulation Analysis of Evacuation Based on a Time-Varying Network
Algorithm. Te above discussion shows that the optimal evacuation path changes in real time, and the shortest path is not the optimal path for the dynamic evacuation process, while some evacuation paths are not advantageous in terms of length but become the new optimal path because of their rapid escape speed. Te evacuation method based on the time-varying network algorithm refects these ideas.
Te time slice Δt j of the new algorithm is set to 1 second in the simulation; that is, it is calculated once every 1 second in the background. To prevent travelers from repeatedly switching between two diferent evacuation paths, the algorithm sets the self-triggering time interval to 5 seconds: when the spatiotemporal congestion of an evacuation node is not within a reasonable range, those travelers of this evacuation node who need to change their routes receive the updated path every 5 seconds (for the convenience of calculation, the transition time is uniformly set to 0 seconds; that is, after updating the path, travelers can immediately implement evacuation along the new path). Te interval between two adjacent updates of evacuation paths by passengers also must not exceed 5 seconds [29]. In this way, in practical application, the application software refreshes the evacuation path every 5 seconds, and the change time of the path is greater than or equal to 5 seconds, which reduces the inconvenience to passengers caused by the rapid change of the evacuation path.
After 30 simulations were averaged, the curve of the number of evacuees at each exit as a function of time was obtained, as shown in Figure 5. Compared with Figure 4, there is no signifcant infection point in any curve after optimization, and the temporal crowding of passengers at each exit is within the permissible range. Most of the exits were reasonably used in the evacuation process. Te trafc of the original congested Gate 5 was diverted to Gates 6 and 7, and Gates 2 and 3 were chosen by some passengers as the second-best path, which also played a diverting role. Passengers of Gate 5 were the frst to evacuate to the safety area, approximately 5 s after the start of evacuation, while those of Gate 1 started to evacuate to the safety area only at 30 s. Tis is because most passengers were closest to Gate 5 and farthest from Gate 1 during the evacuation process. Figure 6 shows the comparison of the number of evacuees at each exit before and after optimization. Analysis shows that after optimization, the number of evacuees at Gates 4 and 5 is signifcantly reduced compared with that  Mathematical Problems in Engineering 7 before optimization, while the number of evacuees at Gates 2, 6, and 7 is increased, the passengers at the exits with high spatial and temporal congestion are diverted, and the number of evacuation channels becomes more balanced. Te number of passengers to be evacuated and evacuation efciency curves of the two evacuation methods are shown in Figure 7, where the evacuation efciency is obtained by ftting the curve of the number of passengers to be evacuated per unit time. Te evacuation time is 422 seconds after optimization by the time-varying network algorithm, which shortens the evacuation time by 74 s compared with that before optimization, and the evacuation efciency is improved by 14%. Analysis of the change curve of the number of evacuees with time shows that the diference between the evacuation efects of the two methods before 3 minutes is not signifcant; that is, the infection point appears at 3 minutes, after which the number of evacuees per unit time of the new evacuation method increases, revealing obvious advantages. Analysis of the evacuation efciency before and after optimization shows that the nonoptimized evacuation efciency curve exhibits the frst infection point in the second minute because the evacuation efciency decreases from the second minute due to the congestion at the entrance of the security waiting area; the optimized curve exhibits the frst infection point in the frst minute and the second infection point in the second minute, and the infection time is earlier and the overall evacuation efciency is improved.
We summarize the evacuation process in three stages: (1) Beginning stage: When an emergency occurs, passengers closer to the exit can be evacuated to the safe area quickly without congestion, and the efciency of passenger evacuation is high. (2) Congestion phase: In the absence of efective guidance, a large number of passengers in the security checkpoint evacuate according to the shortest path principle, and the evacuation path is unevenly distributed, with a large number of passengers using the same evacuation path, resulting in congestion. After optimization by the time-varying network algorithm, passengers fnd the exit more quickly under path guidance, unblocking the congestion point and improving efciency. (3) End phase: Te evacuation of passengers in the terminal building comes to an end, and the remaining passengers are evacuated to the safe area by the evacuation path, and then the evacuation is over.

Conclusion
Based on the shortest circuit algorithm, we proposed an optimization method for passenger evacuation in airports. It can perform excellently in evacuation scenarios and signifcantly shorten evacuation time. Te strategy makes the departure hall emergency evacuation more orderly, safe, efcient, and robust. Te Shenzhen Bao'an International Airport terminal departure hall was used as a simulation object to verify the efects of the two evacuation methods, and the results showed those as follows: (1) Te extent of the spatiotemporal congestion of passengers in the departure hall's middle area afects the passengers' escape time and evacuation efciency (2) Te efectiveness of the time-varying network algorithm was evaluated based on the shortest circuit principle. Te results show that the proposed strategy can reduce the 74-second-evacuation time and increase 14% efciency. (3) Te new method can provide a reference and guidance for the development of passenger evacuation plans for large airports To guide evacuation, we use real-time knowledge of the congestion pattern in the designated area. Ten, the individual evacuation plan is implemented through "paperless" departure service software used by passengers, and the optimal evacuation route for each passenger is transmitted to the cell phone software. According to the principle of isotropic evacuation and shortest path, the evacuation paths of passengers to be evacuated do not cross during the evacuation process. In the actual evacuation, evacuated passengers do not necessarily follow the optimal evacuation path, but it can provide a reference for the evacuation decisions of evacuated passengers [30].
Te time-varying network algorithm incorporates regional passenger spatial and temporal congestion variables, performs real-time path intervention in the evacuation process, calculates and assigns advantageous paths, develops reasonable evacuation plans for passengers of diferent spatial and temporal conditions and dynamically guides passengers, which can minimize congestion, reduce overall evacuation time, and improve evacuation efciency. However, it does not take into account the real-time state of the evacuation network. In the case of an actual evacuation, some source nodes and edges in the network may become impassable. Terefore, how to combine the staged evacuation strategy with dynamic path planning needs further research.

Data Availability
Te raw/processed data required to reproduce these fndings cannot be shared at this time as the data also form part of an ongoing study.

Conflicts of Interest
Te authors declare that there are no conficts of interest.