Building evacuation path optimization method and system based on shortest global evacuation time

Abstract

The application relates to the field of building evacuation path optimization, and discloses a building evacuation path optimization method and system based on shortest global evacuation time, which can solve the problem that the path optimization method in the prior art cannot truly and accurately reflect the influence of crowd congestion on the evacuation process and cannot reasonably consider the actual situation of crowd evacuation under the congestion state in the path optimization process. The method comprises the following steps: generating a corresponding evacuation road network model from a building plan of a case to be analyzed; determining an evacuation personnel distribution scheme; determining a shortest path evacuation scheme, calculating an evacuation simulation result of the scheme, and obtaining a global evacuation time and a group number of the last completed evacuation; determining an evacuable group set according to a two-way mobilization strategy; setting an initial optimization scheme; iteratively optimizing the evacuation paths of groups in a first optimization adjustment area and a second optimization adjustment area. Finally, an optimized evacuation path scheme and corresponding evacuation process simulation calculation results are output.

Description

Technical Field

[0001] This invention relates to the field of building evacuation route optimization technology, specifically to a method and system for optimizing building evacuation routes based on the shortest global evacuation time. Background Technology

[0002] With economic development and accelerated urbanization, urban populations are becoming increasingly dense. Simultaneously, the scarcity of urban land resources for construction is becoming increasingly prominent, making the development of multi-story buildings and large public spaces an inevitable choice in cities. These buildings are large in space and multifunctional, often housing large numbers of people. In the event of sudden emergencies such as earthquakes, fires, floods, or terrorist attacks, they are highly susceptible to causing significant casualties. Therefore, the safety of people in various large complexes, high-rise buildings, and other densely populated places within cities has become a focus of attention for all sectors of society. In the event of an emergency within a building, if the people inside can evacuate quickly and safely, casualties can be effectively reduced or even avoided. This highlights the crucial importance of efficient evacuation in ensuring the safety of people inside buildings. In conclusion, determining efficient emergency evacuation routes for people inside buildings through scientific and rational methods has strong practical application needs.

[0003] Existing research generally employs intelligent algorithms such as genetic algorithms, ant colony optimization, and particle swarm optimization to solve evacuation path optimization problems. These algorithms typically use impassable locations at congestion points as constraints to prevent stampedes caused by extreme overcrowding. However, in most real-world evacuations, while people can usually pass through congested areas, their movement speed is significantly reduced. Therefore, this approach fails to accurately reflect the impact of crowd congestion on evacuation and cannot adequately consider the actual situation of crowd evacuation under congestion conditions during optimization. Crowd congestion has a significant impact on the overall evacuation efficiency within buildings, making it necessary to accurately and reasonably consider its influence during evacuation path optimization.

[0004] This application uses the Chinese invention patent with application number CN202410420273.5, entitled "Macroscopic Simulation Method and Device for Crowd Evacuation Considering the Reduction of Passage Speed ​​in Crowded Areas," as a simulation calculation tool for the evacuation process in the path optimization iteration process, and proposes a method for optimizing the evacuation path of people in buildings that can take into account the actual situation of crowd evacuation under crowded conditions. Summary of the Invention

[0005] This invention solves the problem that existing path optimization methods cannot accurately reflect the impact of crowd congestion on the evacuation process, and cannot reasonably consider the actual situation of crowd evacuation under congestion conditions during path optimization, i.e., crowd congestion has a serious impact on the overall evacuation efficiency of the building.

[0006] To solve the above-mentioned technical problems, the present invention adopts the following technical solution:

[0007] Option 1: A method for optimizing evacuation routes within a building based on the shortest global evacuation time, the method comprising:

[0008] Step 1: Generate the corresponding evacuation road network model G(V,E) from the building floor plan of the case to be analyzed;

[0009] Step 2: Determine the evacuation personnel distribution scheme P based on the evacuation road network model G(V,E) obtained in Step 1. num ;

[0010] Step 3: Based on the evacuation personnel distribution plan P determined in Step 2 num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ;

[0011] Step 4: Calculate the shortest evacuation path scheme P based on Step 3. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 that completed the evacuation;

[0012] Step 5: Based on the two-way mobilization strategy, determine the sets of evacuation groups to be optimized, Ord_FSR_SV_set and Ord_SSR_SV_set;

[0013] Step Six: Based on the Ord_FSR_SV_set and Ord_SSR_SV_set of the evacuation groups to be optimized determined in Step Five, set the initial optimization scheme P. R_oe ;

[0014] Step 7: Based on the initial optimization scheme P set in Step 6 R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole.

[0015] Step 8: Based on the initial optimization scheme P set in Step 6 R_oeIteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation.

[0016] Step 9: Output the final optimized evacuation route plan P R_oe And the corresponding simulation calculation results of the evacuation process.

[0017] Furthermore, a preferred implementation is provided, in step three, the shortest evacuation path scheme P is determined. R_min Calculated using the Floyd algorithm.

[0018] Furthermore, a preferred implementation is provided, wherein in step six, an initial optimization scheme P is set. R_oe The method is to find the shortest evacuation path scheme P R_min As the initial optimization scheme P in the optimization iteration process R_oe That is, let P R_oe =P R_min , t g_oe =t g0 At the same time, take m FSR =0.

[0019] Furthermore, a preferred implementation is provided, wherein step seven is based on the initial optimization scheme P set in step six. R_oe The method for iteratively optimizing the evacuation paths of the population within the first optimization adjustment area is as follows:

[0020] S7.1, In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_FSR_SV_set[m FSR ];

[0021] S7.2, Calculate P R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0022] S7.3, Based on the global evacuation time t g_temp Determine if the iteration has terminated

[0023] Furthermore, a preferred implementation is provided, in step eight, based on the initial optimization scheme P set in step six. R_oe The method for iteratively optimizing the evacuation paths of the population within the second optimization adjustment area is as follows:

[0024] S8.1. In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_SSR_SV_set[m SSR ].

[0025] S8.2, Calculate P R_tempThe evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0026] S8.3, Based on the global evacuation time t g_temp Determine whether the iteration has terminated.

[0027] Furthermore, a preferred implementation is provided, wherein step seven is based on the initial optimization scheme P set in step six. R_oe The iterative optimization of the first optimization adjustment of the evacuation path of the group within the region also includes the step of determining whether the iteration should terminate.

[0028] Furthermore, a preferred implementation is provided, in S3, based on the global evacuation time t g_temp The method for determining whether the iteration has terminated is as follows:

[0029] If t g_temp <t g_oe Then update P R_oe With t g_oe That is, let P R_oe =P R_temp , t g_oe =t g_temp At the same time, it proceeds to the next iteration;

[0030] If t g_temp >t g_oe If the iteration stops, exit step seven.

[0031] Option 2: This option proposes a building evacuation route optimization system based on the shortest global evacuation time. The system includes:

[0032] The evacuation road network model construction module is used to generate the corresponding evacuation road network model G(V,E) from the building floor plans of the case to be analyzed.

[0033] Determine the distribution plan for evacuees P num The evacuation road network model G(V,E) obtained from the module based on the evacuation road network model determines the evacuation personnel distribution scheme P. num ;

[0034] Shortest evacuation route scheme P R_min The determination module is used to determine the distribution plan P of evacuees. num The evacuation personnel distribution plan P determined by the module num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ;

[0035] The group number k0 determination module is used to determine the shortest path evacuation route scheme P. R_min The module determines the shortest evacuation path scheme P. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation;

[0036] The module for determining the optimizable evacuation group set is used to determine the optimizable evacuation group sets Ord_FSR_SV_set and Ord_SSR_SV_set based on the two-way mobilization strategy;

[0037] Set the initial optimization scheme P R_oe This module is used to determine the optimizable evacuation population sets Ord_FSR_SV_set and Ord_SSR_SV_set, and to set the initial optimization scheme P. R_oe ;

[0038] The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole.

[0039] The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation.

[0040] The output module is used to output the final optimized evacuation route plan P. R_oe And the corresponding simulation calculation results of the evacuation process.

[0041] Option 3: A computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the method for determining the formula described in any one of Options 1.

[0042] Option 4: A computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the method for determining the formula as described in any one of Options 1.

[0043] The advantages of this invention are:

[0044] This invention proposes a method and system for optimizing evacuation routes within buildings based on the shortest global evacuation time. During the optimization process, a crowd evacuation simulation method that considers the reduction in pedestrian flow rate at congested areas is used as the simulation calculation tool for the evacuation process in the iterative steps. Compared with existing evacuation route optimization methods, this method can consider the actual situation of crowd evacuation under congested conditions during the optimization of evacuation routes, and can further improve the passage capacity of each intermediate node.

[0045] The method used in this invention optimizes the evacuation routes of a multi-story building and compares the evacuation results of the optimized scheme with those of the shortest path evacuation scheme. The results show that the proposed optimization method can make the utilization rate of each exit of a single building more balanced and reduce the overall evacuation time.

[0046] That is, the present invention is also applicable to the field of optimizing evacuation routes for people in buildings. Attached Figure Description

[0047] Figure 1 This is a flowchart of the optimization method using a two-way mobilization strategy as described in Implementation Method 1.

[0048] Figure 2 This is a schematic diagram of the simplified process of the horizontal road section as described in Implementation Method Eleven.

[0049] Figure 3 This is a schematic diagram of the vertical road segment simplification process described in Implementation Method Eleven.

[0050] Figure 4 For the multi-story building example described in Implementation Method Eleven, in the shortest path scheme P R_min Floor plan diagram of the evacuation area covered by each exit - 01 floor.

[0051] Figure 5 For the multi-story building example described in Implementation Method Eleven, in the shortest path scheme P R_min Floor plan diagram of the evacuation area covered by each exit - 02 floor plan.

[0052] Figure 6 For the multi-story building example described in Implementation Method Eleven, in the shortest path scheme P R_min Floor plan diagram of the evacuation area covered by each exit - 03 floor plan.

[0053] Figure 3 (a) is a schematic diagram of the actual passable road section in the vertical direction. Figure 3 (b) is a schematic diagram of the 2D representation of the vertical edge. Detailed Implementation

[0054] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them.

[0055] Implementation Method 1, see [link] Figure 1 This embodiment describes a method for optimizing evacuation routes for people within a building based on the shortest global evacuation time. The method includes:

[0056] Step 1: Generate the corresponding evacuation road network model G(V,E) from the building floor plan of the case to be analyzed;

[0057] Step 2: Determine the evacuation personnel distribution scheme P based on the evacuation road network model G(V,E) obtained in Step 1. num ;

[0058] Step 3: Based on the evacuation personnel distribution plan P determined in Step 2 num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ;

[0059] Step 4: Calculate the shortest evacuation path scheme P based on Step 3. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 that completed the evacuation;

[0060] Step 5: Based on the two-way mobilization strategy, determine the sets of evacuation groups to be optimized, Ord_FSR_SV_set and Ord_SSR_SV_set;

[0061] Step Six: Based on the Ord_FSR_SV_set and Ord_SSR_SV_set of the evacuation groups to be optimized determined in Step Five, set the initial optimization scheme P. R_oe ;

[0062] Step 7: Based on the initial optimization scheme P set in Step 6 R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole.

[0063] Step 8: Based on the initial optimization scheme P set in Step 6 R_oeIteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation.

[0064] Step 9: Output the final optimized evacuation route plan P R_oe And the corresponding simulation calculation results of the evacuation process.

[0065] Implementation Method Two: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method One. Step three involves determining the shortest evacuation route scheme P. R_min Calculated using the Floyd algorithm.

[0066] Implementation Method 3: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method 1. In step six, an initial optimization scheme P is set. R_oe The method is to find the shortest evacuation path scheme P R_min As the initial optimization scheme P in the optimization iteration process R_oe That is, let P R_oe =P R_min , t g_oe =t g0 At the same time, take m FSR =0.

[0067] Implementation Method Four: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method One. Step Seven is based on the initial optimization scheme P set in Step Six. R_oe The method for iteratively optimizing the evacuation paths of the population within the first optimization adjustment area is as follows:

[0068] S7.1, In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_FSR_SV_set[m FSR ];

[0069] S7.2, Calculate P R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0070] S7.3, Based on the global evacuation time t g_temp Determine whether the iteration has terminated.

[0071] Implementation Method 5: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method 1. Step 8 is based on the initial optimization scheme P set in Step 6. R_oeThe method for iteratively optimizing the evacuation paths of the population within the second optimization adjustment area is as follows:

[0072] S8.1. In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_SSR_SV_set[m SSR ].

[0073] S8.2, Calculate P R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0074] S8.3, Based on the global evacuation time t g_temp Determine whether the iteration has terminated.

[0075] Implementation Method Six: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method One. Step Seven is based on the initial optimization scheme P set in Step Six. R_oe The iterative optimization of the first optimization adjustment of the evacuation path of the group within the region also includes the step of determining whether the iteration should terminate.

[0076] Implementation Method Seven: This implementation method further defines the building evacuation route optimization method based on the shortest global evacuation time described in Implementation Method Six. In S3, the global evacuation time t is used as the basis for optimization. g_temp The method for determining whether the iteration has terminated is as follows:

[0077] If t g_temp <t g_oe Then update P R_oe With t g_oe That is, let P R_oe =P R_temp , t g_oe =t g_temp At the same time, it proceeds to the next iteration;

[0078] If t g_temp >t g_oe If the iteration stops, exit step seven.

[0079] Implementation Method 8: This implementation method proposes a building evacuation route optimization system based on the shortest global evacuation time. The system includes:

[0080] The evacuation road network model construction module is used to generate the corresponding evacuation road network model G(V,E) from the building floor plans of the case to be analyzed.

[0081] Determine the distribution plan for evacuees P num The evacuation road network model G(V,E) obtained from the module based on the evacuation road network model determines the evacuation personnel distribution scheme P. num ;

[0082] Shortest evacuation route scheme P R_min The determination module is used to determine the distribution plan P of evacuees. num The evacuation personnel distribution plan P determined by the module num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ;

[0083] The group number k0 determination module is used to determine the shortest path evacuation route scheme P. R_min The module determines the shortest evacuation path scheme P. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation;

[0084] The module for determining the optimizable evacuation group set is used to determine the optimizable evacuation group sets Ord_FSR_SV_set and Ord_SSR_SV_set based on the two-way mobilization strategy;

[0085] Set the initial optimization scheme P R_oe This module is used to determine the optimizable evacuation population sets Ord_FSR_SV_set and Ord_SSR_SV_set, and to set the initial optimization scheme P. R_oe ;

[0086] The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole.

[0087] The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation.

[0088] The output module is used to output the final optimized evacuation route plan P. R_oe And the corresponding simulation calculation results of the evacuation process.

[0089] Implementation Method Nine: This implementation method provides a computer device, including a memory and a processor. The memory stores a computer program. When the processor runs the computer program stored in the memory, the processor executes the method for determining the formula according to any one of Implementation Methods One to Seven.

[0090] Implementation Method 10: This implementation method provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the method for determining the formula in any one of Implementation Methods 1 to 7.

[0091] Implementation Method Eleven: This implementation method presents an example, which is used to explain the above-described Implementation Methods One to Ten. See also... Figures 1 to 6 This implementation method is described below.

[0092] This embodiment proposes a method for optimizing evacuation routes within buildings that takes into account the actual evacuation situation of crowds under congestion. This method can quantitatively consider the reduction in pedestrian speed at congested locations during the optimization process and establish corresponding optimization strategies based on the physical formation mechanism of global evacuation time within the building. This enables a more balanced utilization rate of each exit of a single building, reducing overall evacuation time.

[0093] The working process of the building evacuation route optimization method proposed in this embodiment is as follows: Figure 1 As shown, it specifically includes 9 steps:

[0094] Step 1: Generate the corresponding evacuation road network model G(V,E) from the building floor plan of the case to be analyzed;

[0095] Step 2: Determine the distribution plan for evacuated personnel. num ;

[0096] Step 3: Determine the shortest evacuation route scheme P R_min The set of alternative evacuation routes S for each group ap And the group alternative evacuation path weight matrix D ap ;

[0097] Step 4: Calculate P R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation;

[0098] Step 5: Based on the two-way mobilization strategy, determine the sets of evacuation groups that can be optimized, Ord_FSR_SV_set and Ord_SSR_SV_set;

[0099] Step 6: Set the initial optimization scheme PR_oe ;

[0100] Step 7: Iterative optimization. The first optimization adjusts the evacuation routes of the population within the area.

[0101] Step 8: Iterative optimization of the second optimization adjustment of the evacuation routes of the population within the area.

[0102] Step 9: Output the final optimized evacuation route plan P R_oe And the corresponding simulation calculation results of the evacuation process.

[0103] The working principle of the above nine steps will be explained in detail below.

[0104] Step 1: Generate the corresponding evacuation road network model G(V,E) from the building floor plan of the case to be analyzed;

[0105] Based on the building floor plan of the case study, the spatial information of the evacuation scenario is transformed into a corresponding evacuation road network model G(V,E) according to the modeling method of the geometric network model of evacuation paths in the invention entitled "Macroscopic Simulation Method and Device for Crowd Evacuation Considering the Reduction of Passage Rate in Congested Areas". The modeling method of the geometric network model of evacuation paths within a building, as proposed in the invention entitled "Macroscopic Simulation Method and Device for Crowd Evacuation Considering the Reduction of Passage Rate in Congested Areas", mainly includes rules for setting nodes and edges. In the following sections, we will refer to the geometric network model of evacuation paths within a building as the evacuation road network. The node setting rules and edge setting rules in the evacuation road network modeling method will be introduced separately below.

[0106] 1.1.1. Node Configuration Rules

[0107] Let G(V,E) be the evacuation network within a building. Each room or area with a specific function, the building's exits, passageways, and the ends of staircases are designated as nodes (vertex, denoted as V). The walkable paths between nodes are designated as edges (edges, denoted as E), thus forming the evacuation network. The nodes V in the evacuation network G(V,E) can be divided into three categories, and their respective setting rules are shown in Table 1.

[0108]

[0109] The setting of source nodes is also related to the number of people. Currently, we stipulate that if there are more than 10 people in a room, multiple source nodes should be set up. That is, the room is divided into multiple areas, and each area is set up with a corresponding source node, ensuring that the number of people in each source node does not exceed 10. Considering that the location of each person in the room / area is different, and the distance from the room / area exit varies, we use the geometric center of the room / area as the simplified node position. That is, the evacuation departure position of all people in the room / area is simplified to the geometric center of the room / area. Therefore, in our simulation method, each source node contains only one group (each group has ≤10 people), so the number of source nodes is equal to the number of evacuation groups, that is, there is a one-to-one correspondence between the source node and the evacuation groups it contains. Therefore, we set the source node and the evacuation groups it contains in the simulation method to have the same number, that is, the number of the source node is the number of the evacuation group it contains.

[0110] Internal building traffic connections refer to corridors, lobbies, staircases, etc. Intermediate nodes are typically located where evacuation routes converge or where traffic capacity changes significantly. These locations are where congestion is likely to occur during emergency evacuations; in other words, intermediate nodes encompass all locations where congestion may occur during an actual evacuation. In the evacuation network, the node numbering order is source node, intermediate node, exit node, with a starting value of 0.

[0111] 1.1.2. Rules for setting edges

[0112] All traffic connections within the building are simplified as edges E to represent passable road segments between nodes. Each edge in the evacuation road network is a directed edge, connecting one node at each end; that is, each edge has only two nodes. The weight of an edge is the length of the actual passable road segment corresponding to its origin and terminus.

[0113] Accessible pathways within a building can be categorized into horizontal and vertical pathways based on spatial type. Details regarding the simplification of the edges of horizontal pathways include... Figure 1 As shown. In the event of emergencies such as earthquakes and fires that damage building structures, obstacles may be created that affect the passage of people. Therefore, as... Figure 2 As shown in the diagram, the actual passable road segments from node 1 to node 57 indicate that for obstacles such as furniture and building debris present during evacuation, the actual passable evacuation road segments need to maintain a certain distance from these obstacles to ensure continuous accessibility and personnel safety during the evacuation process. In other words, the proposed evacuation road network modeling method can reflect the details of the evacuation process where evacuees avoid obstacles. Figure 1The green dashed line represents the actual passable road segment during the evacuation process, and the black solid line represents the simplified edge E of the actual passable road segment. The simplified edge E connects the first and last nodes with a straight line. It only indicates the passability between the nodes and the direction of the road segment, and cannot reflect the actual shape of the passable road segment during the evacuation process.

[0114] According to current international standards, staircases are the only legal evacuation method in multi-story and high-rise buildings. As the most traditional evacuation method, staircases have always been the preferred vertical evacuation option in the event of a building hazard. Therefore, in the construction of evacuation networks for multi-story and high-rise buildings, we only use staircases for vertical evacuation; that is, the evacuation network only includes vertical edges simplified from the vertically passable evacuation routes corresponding to staircases. Details of the simplification process for the edges corresponding to vertical routes are as follows: Figure 2 As shown. Among them, Figure 3 (a) indicates the actual passable vertical road section. Figure 3 (b) shows the representation of the unidirectional edge corresponding to the vertical road segment in the 2D planar diagram of the evacuation road network. Similar to horizontal road segments, the evacuation road network modeling method proposed in this paper can also consider the impact of obstacles in vertical road segments on the evacuation process. Furthermore, considering that the evacuation process in multi-story buildings aims to leave the building and reach a safe area outside, the direction of vertical road segments in the evacuation road network is always from top to bottom, i.e., from nodes on higher floors to nodes on lower floors. In the 2D planar diagram of the evacuation road network, the edge corresponding to the vertical road segment is represented by a yellow unidirectional solid line, the specific representation of which is as follows: Figure 3 As shown in (b). Similar to the horizontal sides, the representation of the vertical sides also cannot reflect the actual shape of the passageway during the evacuation process.

[0115] 1.1.3. Schematic diagram of evacuation road network

[0116] According to the edge setting rules in Section 1.1.2, in the evacuation road network diagram, the edges corresponding to horizontally passable evacuation road sections are mainly divided into two categories: one-way edges are represented by solid black single-arrow lines, with the arrow pointing to the end point of the one-way edge; two-way edges are represented by solid blue double-arrow lines, each with an arrow pointing to the two endpoints of the two-way edge (end-vertices). The edges corresponding to vertically passable road sections are one-way edges from top to bottom, represented by solid yellow single-arrow lines. Figures 4 to 6 This is a case study of a multi-story building in the shortest path solution P. R_min A schematic diagram showing the evacuation areas covered by each exit. Figures 4 to 6 The diagram also shows the evacuation road network of this multi-story building case. The rules for setting the nodes and edges of this evacuation road network all follow the relevant requirements of Sections 1.1.1 and 1.1.2.

[0117] 1.2. Step Two: Determine the evacuation personnel distribution plan P num ;

[0118] Determine the initial number of people in each room, i.e., the evacuation personnel distribution plan P. num And according to P num The settings of the source node in G(V,E) are updated according to the situation.

[0119] 1.3. Step 3: Determine the shortest evacuation route scheme P R_min The set of alternative evacuation routes S for each group ap And the group alternative evacuation path weight matrix D ap ;

[0120] The following further explains that the Floyd algorithm determines the path information of the shortest path between all pairs of nodes in the evacuation network, and then generates the shortest path evacuation scheme P. R_min The set of alternative evacuation routes S for each group ap And the group alternative evacuation path weight matrix D ap The process.

[0121] 1.3.1. Initial evacuation route plan P R_min

[0122] This implementation method uses the shortest path evacuation scheme P R_min As the initial evacuation route scheme for the iterative optimization process, the Floyd algorithm is used to calculate the shortest path information between all pairs of nodes in the evacuation network. As described in Section 1.1.1, the source node number in the evacuation network is the number of the evacuee groups it contains. Therefore, after the Floyd algorithm determines the shortest path information between all pairs of nodes in the evacuation network, the initial evacuation route scheme, i.e., the shortest path evacuation route scheme P, can be determined from the source node number set. R_min Specifically, this study unifies all safe zones in the evacuation road network as an abstract node V. s Then, connect each outlet to the abstract node V. s The length and weight of each edge are set to 1m. Therefore, the distance from a source node to the abstract node V is... s The shortest path is the global shortest evacuation path from the source node within the building, and the path length of this evacuation path is longer than the path from the source node to the abstract node V. s The shortest path length is less than 1m. Repeat the above operation for all source nodes in the source node number set (each corresponding to a group of people) to obtain the shortest evacuation route scheme P for the building. R_min .

[0123] 1.3.2. Group Alternative Path Sets (Sap)

[0124] Based on the shortest path information between all node pairs in the evacuation road network, the set of alternative evacuation routes S for each group can be further determined. ap This alternative path set stores the accessible paths from each evacuation group to all building exits, and its data storage structure is shown in Table 2. The example data in Table 2 comes from... Figures 4 to 6 The set of group of alternative evacuation routes S for the multi-story building example shown ap The set of alternative evacuation routes S for the group ap It is a matrix whose row index values ​​correspond to the source node V in the building evacuation road network. s The number is consistent with the personnel group number, and the column index corresponds to the exit node V in the building evacuation road network. e Each element represents the shortest accessible path from a given group to a given exit, and is represented as an array containing the node numbers along the shortest accessible path from the start to the end. This is within the set of alternative evacuation paths S for the group. ap In the case of a certain element S ap [i][j] is an empty array [], indicating that there is no passable path from the source node i to the exit j, that is, the group of people i corresponding to the source node cannot reach the exit j during the evacuation process.

[0125] Furthermore, in generating the set of alternative evacuation routes S for the group ap Simultaneously, a weight matrix D of alternative evacuation paths for the group was also generated. ap The row index and column index of this matrix are related to S. ap Consistent. D ap A certain element D in ap [i][j] and the element S in the set of alternative evacuation routes for the group. ap [i][j] correspond one-to-one. D ap The values ​​of [i][j] represent the shortest passable path S from group i to exit j. ap The total length of [i][j]. When S ap When [i][j] is an empty array [] (the source node i and the exit node j are not connected), its corresponding D ap [i][j] takes the value inf, which is infinity. In subsequent optimization iterations, the evacuation path adjustment for group i will be selected sequentially from low to high based on the length values ​​of each alternative path.

[0126]

[0127] 1.4. Step Four: Calculate P R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation;

[0128] Based on the invention titled "Macroscopic Simulation Method and Device for Crowd Evacuation Considering the Reduction of P in Congested Areas," P was calculated. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation;

[0129] 1.5. Step 5: Based on the two-way mobilization strategy, determine the sets of optimizable evacuation groups, Ord_FSR_SV_set and Ord_SSR_SV_set;

[0130] This implementation method establishes a two-way mobilization optimization strategy based on the physical formation mechanism of global evacuation time within a building. Furthermore, through this two-way mobilization strategy, P... R_min k0 and S ap Two optimizable evacuation population sets, Ord_FSR_SV_set and Ord_SSR_SV_set, are determined sequentially. The specific details of the bidirectional evacuation strategy are as follows:

[0131] First, exit V, the last exit where evacuation has been completed. el The evacuation groups within the designated evacuation area are divided into two groups (each forming a separate set) based on their position relative to the stairwell connected to the exit. One group is located on the side where the last group (k) to complete its evacuation is situated, while the remaining group is located on the other side of the stairwell. This patent designates the evacuation area on the side containing the last group to complete its evacuation as the First Optimization Adjustment Region. The evacuation area on the other side, which does not contain the last group to complete its evacuation, is designated as the Second Optimization Adjustment Region.

[0132] Then, according to the order of adjustment during the optimization iteration process, the two group sets are sorted separately. The set containing the last group k to complete evacuation globally is the set that first undergoes optimization iteration (corresponding to the first optimization adjustment region). It is sorted from high to low according to its distance from the current exit (the last exit to complete evacuation under the shortest path solution). The sorted set is denoted as Ord_FSR_SV_set. For the other group set, it needs to be sorted according to the following two sorting rules in sequence:

[0133] First, the groups are arranged according to their floor, starting from the top floor and going down (the higher the floor, the longer the evacuation distance, and the later the evacuation order).

[0134] Secondly, for evacuation groups within the same floor, they are further sorted from low to high according to their distance from the nearest exit in the direction to be adjusted (the closer to the nearest exit in the direction to be adjusted, the farther away from the original exit. This way, the groups in the original exit evacuation area are moved from the outside to the inside, which can avoid conflicts in the flow of people).

[0135] The final set of people within the second optimized adjustment region, after sorting, is denoted as Ord_SSR_SV_set. After classifying and sorting these people, the first and second optimized adjustment regions are optimized sequentially according to the optimization iteration criteria. Once optimization is complete, the final optimized evacuation route plan is obtained. This concludes the explanation of the two-way mobilization strategy.

[0136] 1.6. Step Six: Set the initial optimization scheme P R_oe

[0137] The shortest path evacuation scheme P R_min As the initial optimization scheme P in the optimization iteration process R_oe That is, let P R_oe =P R_min , t g_oe =t g0 Simultaneously take m FSR =0.

[0138] 1.7. Step Seven: Iterative Optimization. The first optimization is to adjust the evacuation routes of the population within the area.

[0139] To achieve a more balanced utilization rate of all exits in a building, this patent takes a holistic approach from the perspective of the overall evacuation of a single building, using the overall evacuation time t as a reference. g The shortest is the optimization objective, and the corresponding iteration termination criterion is shown in equation (1).

[0140] t g_temp ≥t g_oe (1)

[0141] In the formula, t g_temp t represents the global evacuation time (s) corresponding to the updated evacuation path scheme in the current iteration step. g_oe Let be the global evacuation time (s) corresponding to the optimal evacuation path scheme in the current iteration step.

[0142] In this step, the evacuation routes of the population within the first optimization adjustment area will be optimized and adjusted. The ordered set of population numbers within the first optimization adjustment area is Ord_FSR_SV_set.

[0143] Each optimization iteration can be further divided into three sub-steps, as follows:

[0144] Iteration: Each iteration adjusts the evacuation path of only one population, whose population number is Ord_FSR_SV_set[m FSR The specific adjustment operation is to set the group's Ord_FSR_SV_set[m FSR The evacuation path is adjusted to the shortest evacuation path between the group and its second nearest (or second nearest) exit (this path is actually the group's Ord_FSR_SV_set[m FSR [The second shortest evacuation route in the overall building layout]. After adjustment, a new evacuation route scheme P is formed. R_temp At the same time, let m FSR =m FSR +1.

[0145] Evacuation simulation calculation: Based on the macroscopic evacuation simulation method proposed in the invention entitled "Macroscopic Simulation Method and Device for Crowd Evacuation Considering the Reduction of Passage Speed ​​in Congested Areas", P was calculated. R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0146] Judgment: According to the iteration termination criterion shown in equation (5-1), for t g_temp Make a judgment.

[0147] If t g_temp <t g_oe Then update P R_oe With t g_oe That is, let P R_oe =P R_temp , t g_oe =t g_temp At the same time, it will move on to the next iteration.

[0148] If t g_temp >t g_oe If the iteration stops, exit step seven.

[0149] 1.8. Step 8: Iterative optimization of the second optimization adjustment of the evacuation routes of the population within the region.

[0150] In this step, the evacuation paths of the population within the second optimization adjustment region will be optimized and adjusted. The ordered numbering set of the population within the second optimization adjustment region is Ord_SSR_SV_set. The optimization objective and iteration termination criteria in this step are consistent with those in step seven. Before the first iteration begins, m needs to be set... SSR =0. Consistent with step seven, each optimization iteration in step eight can also be further divided into three steps, as follows:

[0151] Iteration: Each iteration adjusts the evacuation path of only one population, whose group number is Ord_SSR_SV_set[mSSR The specific adjustment operation is to set the group Ord_SSR_SV_set[m SSR The evacuation path is adjusted to the shortest evacuation path between the group and its second nearest (or second nearest) exit (this path is actually the group's Ord_SSR_SV_set[m SSR [The second shortest evacuation route in the overall building layout]. After adjustment, a new evacuation route scheme P is formed. R_temp At the same time, let m SSR =m SSR +1.

[0152] Evacuation simulation calculation: P is calculated based on the macroscopic evacuation simulation method proposed in Chapter 4. R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ;

[0153] Judgment: According to the iteration termination criterion shown in equation (5-1), for t g_temp Make a judgment.

[0154] If t g_temp <t g_oe Then update P R_oe With t g_oe That is, let P R_oe =P R_temp , t g_oe =t g_temp At the same time, it will move on to the next iteration.

[0155] If t g_temp >t g_oe If the iteration stops, exit step eight.

[0156] 1.9. Step Nine: Output the final optimized evacuation route plan P R_oe And the corresponding simulation calculation results of the evacuation process.

[0157] After completing the iterative optimization steps seven and eight, the final optimized evacuation path scheme P is output. R_oe And the evacuation simulation calculation results corresponding to this scheme.

[0158] The above outlines the working steps and principles of the building evacuation route optimization method proposed in this embodiment. The parameter symbols used in this optimization method are summarized in Table 3.

[0159]

[0160] The following is a specific embodiment of the building evacuation route optimization method proposed in this patent. This example is a hospital in City H, a three-story building, which includes a vertical evacuation process. The implementation process of the building evacuation route optimization method proposed in this patent on this three-story building example is as follows:

[0161] 1. From steps one and two, we obtain the evacuation road network model G(V,E) and the evacuation personnel distribution scheme P for the example to be analyzed. num This creates an input data file.

[0162] Based on the building space layout and functional use shown in the floor plan of this multi-story example building, and combined with our building evacuation network establishment rules, we established the following... Figures 4-6 The multi-layered evacuation road network shown is an example. In the mathematical model of this multi-layered evacuation road network, there are 161 source nodes, numbered sequentially from 0 to 160. Specifically: the first layer has 49 source nodes, numbered 0 to 48; the second layer has 56 source nodes, numbered 49 to 104; and the third layer has 56 source nodes, numbered 105 to 160. The number of evacuees, Neg, contained in evacuation group i corresponding to a given source node i is also shown. i exist Figures 4-6 The source node symbol is displayed in bold blue. There are 32 intermediate nodes in total, and their distribution across each floor is shown in Table 4. There are 6 exit nodes, all on the first floor, numbered 193 to 198. The total number of nodes in the evacuation network for this multi-story example is 199, with the abstract node of the safety zone numbered 199. The total number of people involved in the evacuation within the entire building is 555, with 191 on the first floor, 184 on the second floor, and 180 on the third floor. The representation of the three types of nodes in the evacuation network diagram for multi-story buildings is detailed in Table 1 and will not be repeated here.

[0163] The total number of directed edges in the multi-layered evacuation road network is 430, and the weight values ​​of each edge are currently calculated manually. The representation of various edge types in the evacuation road network plan view is detailed in Section 1.1.2 and will not be repeated here. In the 3D diagram of the evacuation road network, the edges corresponding to vertical road segments are displayed as red dashed lines, and the start and end points of the vertical edges are marked with solid green dots.

[0164]

[0165] After processing in steps one and two, a geometric network model of the evacuation routes for the three-story building (referred to as the evacuation network) data file is generated and input into the optimization method's calculation program. This file contains four data tables:

[0166] Table 1: Link Information stores relevant information about each edge in the evacuation road network model, specifically including: 1) edge ID, 2) edge start and end point information, 3) edge length weight value, and 4) edge segment type (horizontal or vertical).

[0167] ID stands for: number.

[0168] Table 2: Number of Source Nodes, storing information about source nodes in the evacuation road network model, specifically including: the ID of the source node (which corresponds one-to-one with the ID of the evacuation group), and the number of people in the evacuation group corresponding to the source node.

[0169] Therefore, Table 2 shows the initial distribution of evacuees within this building instance.

[0170] Table 3: Middle Node capacity, storing information about intermediate nodes in the evacuation road network model, specifically including: 1) the ID of the intermediate node; 2) the passable width W of the intermediate node (representing the passability of the intermediate node); 3) the spatial form of the actual evacuation scenario at the location of the intermediate node (represented by the specific value of OPS: OPS = 0.4 represents the spatial form of the evacuation scenario corresponding to the first type of crowd gathering pattern; OPS = 0.3 represents the spatial form of the evacuation scenario corresponding to the second type of crowd gathering pattern).

[0171] Table 4: Exit capacity, storing exit node information in the evacuation road network model, specifically including: 1) Exit node ID; 2) Passable width W of the exit node; 3) Spatial form of the actual evacuation scenario at the corresponding location of the exit node (represented by specific OPS values: OPS = 0.4 indicates the spatial form of the evacuation scenario corresponding to the first type of crowd gathering pattern; OPS = 0.3 indicates the spatial form of the evacuation scenario corresponding to the second type of crowd gathering pattern).

[0172] 2. Input the data files from steps one and two into the calculation program corresponding to the proposed optimization method. After completing the calculations corresponding to steps three through nine, output the final optimized evacuation route scheme P. R_oe And the corresponding simulation calculation results of the evacuation process.

[0173] The evacuation route network data file of the three-story building example formed in steps one and two is input into the calculation program of the building evacuation route optimization method proposed in this patent. Running the program will optimize the evacuation routes of the three-story building. After completing the calculations corresponding to steps three to nine, the final optimized evacuation route scheme P is obtained. R_oe And the simulation calculation results of the evacuation process corresponding to the optimized scheme.

[0174] The key results involved in the calculation process are explained below:

[0175] Initial evacuation route plan P R_min

[0176] Compared with the initial evacuation route scheme P in this example R_min The corresponding evacuation areas A of each exit of the building i (i is the exit node number), such as Figures 4-6 As shown. Figures 4-6 In a certain evacuation area A i The final exit for all evacuated groups within the area is exit i. Figures 4-6 In the diagram, dashed lines (red or green) are used to mark the evacuation area range of each exit in the single-layer evacuation road network. To clearly distinguish the boundaries of each evacuation area, the dashed lines of adjacent evacuation areas are marked with different colors (red or green).

[0177] Optimize evacuation route plan P R_oe

[0178] Optimize evacuation route plan P R_oe The data storage structure is shown in Table 5. The example data in Table 5 comes from the optimized evacuation path scheme P of this multi-story building example. R_oe .

[0179]

[0180]

[0181] Initial evacuation route plan P R_min The data storage structure is also similar to P R_oe Consistency.

[0182] Simulation calculation results P_Locs of the evacuation process corresponding to the optimized scheme

[0183]

[0184] Where: 1) Group ID: Evacuation group ID; 2) t d : The moment when the entire building evacuation ends; 3)n d : The number of program calculation steps corresponding to the end of the global evacuation; 4) The column index and row index in Table 6 are not displayed in the actual results file (i.e., the bold text in Table 6).

[0185] The simulation results of the evacuation process corresponding to each evacuation route are stored in the personnel location state matrix P_Locs. In the personnel location state matrix P_Locs, the column index corresponds to the group number in each source node, and the row index corresponds to the loop time step (time interval 0.1s). The position of personnel at a certain moment in the evacuation process is identified in P_Locs by the corresponding position label. Since the node and edge numbers are integers starting from 0, in order to effectively distinguish whether personnel are on an edge or at a node, we take the position label of personnel on an edge as the edge number, and take the position label of personnel waiting at a node as 100000 × node number. In addition, in P_Locs, we uniformly set the position labels of all safe zones to -1. The data storage structure of P_Locs corresponding to this three-story building example is shown in Table 6.

[0186] Next, the optimized evacuation route scheme P calculated by the proposed optimization method will be used. R_oe The evacuation simulation results and the shortest path evacuation scheme P R min The evacuation simulation results (i.e., the initial evacuation route plan) are compared to illustrate the optimization effect of the optimization method.

[0187] The shortest path evacuation scheme P in this example R_min The corresponding evacuation areas A of each exit of the building i (i is the exit node number), such as Figures 4-6 As shown. Figures 4-6 In a certain evacuation area A i All evacuation groups within the building ultimately exit through exit i. The optimized evacuation route scheme P for this 3-story building example is obtained through calculation using the proposed optimization method. R_oe Compared to the shortest path evacuation route scheme P R_min Optimize evacuation route plan P R_oe Five evacuation groups have had their evacuation routes adjusted. The specific adjustments are as follows:

[0188] Groups 155 and 154 will be evacuated from Exit 197 to Exit 194.

[0189] Groups 150, 138, and 137 will be evacuated from Exit 197 to Exit 198.

[0190] During the global evacuation time t g Above, optimize the evacuation route plan P R_oe Compared to the shortest path evacuation route scheme P R_min The time was shortened by 8.0 seconds, and the relevant results are shown in Table 7.

[0191]

[0192] Next, we will further compare the internal evacuation situations of the evacuation areas covered by each exit under the two evacuation route schemes. First, we will compare the personnel distribution in each evacuation area. Specifically, the shortest path evacuation route scheme P... R_min The distribution of personnel in each evacuation area is shown in Table 8. Optimize the evacuation route plan P. R_oe The distribution of personnel in each evacuation area is shown in Table 9. Combining Tables 8 and 9 with the specific adjustment information for the evacuation routes, it can be seen that the optimized evacuation route scheme P for the multi-level example... R_oe Exit 197 (shortest path solution P) R_min The evacuation area of ​​the last exit to be evacuated was shifted to the adjacent exits 194 and 198, thereby relieving the evacuation pressure on exit 197 and increasing the utilization rate of exits 194 and 198.

[0193]

[0194]

[0195] Next, we compared the evacuation completion times at each exit. Table 10 shows the evacuation completion times at each exit under both schemes. As can be seen from Table 10, after alleviating the evacuation pressure at exit 197, the evacuation completion time at exit 197 decreased to some extent. Meanwhile, the evacuation completion times at the two adjacent exits (exits 194 and 198) increased with the increase in the number of people in their respective evacuation areas. This indicates that the optimized evacuation route scheme P... R_oe Further utilization of the passable resources at exits 194 and 198 is possible. Furthermore, the results in Tables 7 and 10 both show that the optimized evacuation route scheme P... R_oe Under the guidance of the algorithm, the exit where the evacuation was finally completed in the multi-level case changed from the original exit 197 to exit 194. Correspondingly, the group that was finally evacuated became the group 154, which was the furthest from exit 194 within the evacuation area of ​​exit 194.

[0196]

[0197] Combining the optimization results of single-story and multi-story examples, it can be seen that the evacuation path optimization method proposed in this embodiment, after adjusting the evacuation paths of some evacuation groups, further narrows the gap between the completion time of the last exit to complete evacuation within a single building and other exits, and the completion times of each exit are also relatively balanced. This indicates that the proposed optimization algorithm can effectively balance the utilization rate of exits in a single building. Although the adjusted evacuation paths increase the total evacuation distance for the corresponding groups, from the perspective of global evacuation, the optimized evacuation path scheme P... R_oe It can reduce the overall evacuation time.

[0198] Those skilled in the art will understand that the above description is merely a preferred embodiment of the present invention, and the features described in the various embodiments and / or claims of this disclosure can be combined or combined in various ways, even if such combinations or combinations are not explicitly described in this disclosure. This is not intended to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing embodiments or make equivalent substitutions for some of the technical features. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

[0199] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention. Clearly, those skilled in the art can make various alterations and modifications to the invention without departing from its spirit and scope. Thus, if these modifications and modifications of the invention fall within the scope of the claims and their equivalents, the invention is also intended to include these modifications and modifications.

Claims

1. A method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, characterized in that: The method includes: Step 1: Generate the corresponding evacuation road network model G(V,E) from the building floor plan of the case to be analyzed; Step 2: Determine the evacuation personnel distribution scheme P based on the evacuation road network model G(V,E) obtained in Step 1. num ; Step 3: Based on the evacuation personnel distribution plan P obtained in Step 2 num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ; Step 4: Calculate the shortest evacuation path scheme P based on Step 3. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 that completed the evacuation; Step 5: Based on the two-way mobilization strategy, determine the sets of evacuation groups to be optimized, Ord_FSR_SV_set and Ord_SSR_SV_set; Step Six: Based on the Ord_FSR_SV_set and Ord_SSR_SV_set of the evacuation groups to be optimized determined in Step Five, set the initial optimization scheme P. R_oe ; Step 7: Based on the initial optimization scheme P set in Step 6 R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole. Step 8: Based on the initial optimization scheme P set in Step 6 R_oe Iteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation. Step 9: Output the final optimized evacuation route plan P R_oe And the corresponding simulation calculation results of the evacuation process; The two-way mobilization strategy described in step five is as follows: First, the last exit V that has completed evacuation. el The evacuation groups within the evacuation area are divided into two parts according to their position relative to the stairwell connected to the exit. Each part is set up. One part of the group is on the side where the last group to complete the evacuation is located, and the remaining group is on the other side of the stairwell. The evacuation area on the side where the last group to complete the evacuation is located is called the first optimization adjustment area, and the evacuation area on the other side that does not contain the last group to complete the evacuation is called the second optimization adjustment area. Then, according to the order of adjustment in the optimization iteration process, the two group sets are sorted separately; the set containing the last group k to complete evacuation globally is the set that first undergoes optimization iteration, corresponding to the first optimization adjustment region, and is sorted from high to low according to the distance from the current exit, i.e., the last exit to complete evacuation under the shortest path scheme. The sorted set is denoted as Ord_FSR_SV_set; while the group set on the other side needs to be sorted according to the following two sorting rules in sequence: First, the groups are arranged according to their floor, starting from the top floor and going down. Secondly, for evacuation groups within the same floor, they are further sorted from low to high according to their distance from the nearest exit in the direction to be adjusted. The final set of people within the second optimized adjustment region after sorting is denoted as Ord_SSR_SV_set.

2. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, as described in claim 1, is characterized in that... Step 3 involves determining the shortest evacuation route scheme P. R_min Calculated using the Floyd algorithm.

3. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, as described in claim 1, is characterized in that... Step six involves setting the initial optimization scheme P. R_oe The method is to find the shortest evacuation path scheme P R_min As the initial optimization scheme P in the optimization iteration process R_oe That is, let P R_oe =P R_min , t g_oe =t g0 At the same time, take m FSR =0.

4. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, as described in claim 1, is characterized in that... Step seven is based on the initial optimization scheme P set in step six. R_oe The method for iteratively optimizing the evacuation paths of the population within the first optimization adjustment area is as follows: S7.1, In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_FSR_SV_set[m FSR ]; S7.2, Calculate P R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ; S7.3, Based on the global evacuation time t g_temp Determine whether the iteration has terminated.

5. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, as described in claim 1, is characterized in that... Step eight is based on the initial optimization scheme P set in step six. R_oe The method for iteratively optimizing the evacuation paths of the population within the second optimization adjustment area is as follows: S8.

1. In each iteration, only the evacuation path of one population is adjusted. This population is numbered Ord_SSR_SV_set[m SSR ]; S8.2, Calculate P R_temp The evacuation simulation results of the scheme yielded the global evacuation time t. g_temp ; S8.3, Based on the global evacuation time t g_temp Determine whether the iteration has terminated.

6. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time according to claim 1, characterized in that, Step seven is based on the initial optimization scheme P set in step six. R_oe The iterative optimization of the first optimization adjustment of the evacuation path of the group within the region also includes the step of determining whether the iteration should terminate.

7. The method for optimizing evacuation routes for people within a building based on the shortest global evacuation time, as described in claim 6, is characterized in that... S3 is based on the global evacuation time t g_temp The method for determining whether the iteration has terminated is as follows: If t g_temp < t g_oe Then update P R_oe With t g_oe That is, let P R_oe =P R_temp , t g_oe =t g_temp At the same time, it proceeds to the next iteration; If t g_temp > t g_oe If the iteration stops, exit step seven.

8. A building evacuation route optimization system based on the shortest global evacuation time, characterized in that, The system includes: The evacuation road network model construction module is used to generate the corresponding evacuation road network model G(V,E) from the building floor plans of the case to be analyzed. Determine the distribution plan for evacuees P num This module is used to determine the distribution scheme P of evacuees based on the evacuation road network model G(V,E) obtained by the evacuation road network model construction module. num ; Shortest evacuation route scheme P R_min The determination module is used to determine the distribution plan P of evacuees. num The evacuation personnel distribution plan P obtained by the module num Determine the shortest evacuation route scheme P R_min The shortest path evacuation scheme P R_min This includes determining the set of alternative evacuation routes S for each group. ap And the group alternative evacuation path weight matrix D ap ; The group number k0 determination module is used to determine the shortest evacuation path scheme P. R_min The module determines the shortest evacuation path scheme P. R_min The evacuation simulation results of the scheme yielded the global evacuation time t. g0 The group numbered k0 was the last to complete the evacuation; The module for determining the optimizable evacuation group set is used to determine the evacuation group sets Ord_FSR_SV_set and Ord_SSR_SV_set to be optimized based on the two-way mobilization strategy; Set the initial optimization scheme P R_oe This module is used to determine the set of evacuation groups to be optimized, namely Ord_FSR_SV_set and Ord_SSR_SV_set, and to set the initial optimization scheme P. R_oe ; The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group in the first optimization adjustment area, which is the evacuation area on one side of the last group to complete evacuation in the whole. The first optimization adjustment region optimization module is used to optimize the initial optimization scheme P based on the settings. R_oe The initial optimization scheme P set by the module R_oe Iteratively optimize the evacuation path of the group within the second optimization adjustment area; the second optimization adjustment area is the evacuation area on the other side that does not include the last group to complete evacuation. The output module is used to output the final optimized evacuation route plan P. R_oe And the corresponding simulation calculation results of the evacuation process; The specific two-way mobilization strategy described in the optimizable evacuation group aggregation module is as follows: First, the last exit V that has completed evacuation. el The evacuation groups within the evacuation area are divided into two parts according to their position relative to the stairwell connected to the exit. Each part is set up. One part of the group is on the side where the last group to complete the evacuation is located, and the remaining group is on the other side of the stairwell. The evacuation area on the side where the last group to complete the evacuation is located is called the first optimization adjustment area, and the evacuation area on the other side that does not contain the last group to complete the evacuation is called the second optimization adjustment area. Then, according to the order of adjustment in the optimization iteration process, the two group sets are sorted separately; the set containing the last group k to complete evacuation globally is the set that first undergoes optimization iteration, corresponding to the first optimization adjustment region, and is sorted from high to low according to the distance from the current exit, i.e., the last exit to complete evacuation under the shortest path scheme. The sorted set is denoted as Ord_FSR_SV_set; while the group set on the other side needs to be sorted according to the following two sorting rules in sequence: First, the groups are arranged according to their floor, starting from the top floor and going down. Secondly, for evacuation groups within the same floor, they are further sorted from low to high according to their distance from the nearest exit in the direction to be adjusted. The final set of people within the second optimized adjustment region after sorting is denoted as Ord_SSR_SV_set.

9. A computer device, characterized in that, It includes a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor performs the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, A computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the method according to any one of claims 1 to 7.

Images