CN114882715B - Staged optimization method for emergency traffic operation - Google Patents
Staged optimization method for emergency traffic operation Download PDFInfo
- Publication number
- CN114882715B CN114882715B CN202210493310.6A CN202210493310A CN114882715B CN 114882715 B CN114882715 B CN 114882715B CN 202210493310 A CN202210493310 A CN 202210493310A CN 114882715 B CN114882715 B CN 114882715B
- Authority
- CN
- China
- Prior art keywords
- rescue
- evacuation
- traffic
- constraint
- vehicles
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 136
- 238000000034 method Methods 0.000 title claims abstract description 59
- 230000000694 effects Effects 0.000 claims description 28
- 230000008030 elimination Effects 0.000 claims description 3
- 238000003379 elimination reaction Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 9
- 238000007726 management method Methods 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 239000000470 constituent Substances 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
- G08G1/087—Override of traffic control, e.g. by signal transmitted by an emergency vehicle
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
- G08G1/0145—Measuring and analyzing of parameters relative to traffic conditions for specific applications for active traffic flow control
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Business, Economics & Management (AREA)
- Emergency Management (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a staged optimization method for emergency traffic operation. The method comprises the following steps: establishing constraint conditions and objective functions of rescue traffic operation optimization, and establishing intersection conflict steering constraint conditions; calling solvers such as Cplex, gurobi and the like to solve a mixed integer linear programming model taking constraint conditions of rescue traffic operation optimization and constraint conditions of intersection conflict steering as constraint conditions, and obtaining a rescue traffic operation optimization scheme enabling a rescue vehicle to arrive at a disaster area most quickly; establishing constraint conditions and objective functions of evacuation traffic operation optimization for the preferential passage of rescue vehicles; and (3) calling a solver such as Cplex, gurobi and the like to solve a mixed integer linear programming model taking an objective function of evacuation traffic operation optimization as an optimization objective, and obtaining an evacuation traffic operation optimization scheme for enabling rescue vehicles to pass preferentially and enabling the evacuation vehicles to safely transfer from a disaster area to a safety area as soon as possible. The invention can provide an emergency traffic operation optimization scheme for different evacuation and rescue traffic demands under local emergencies.
Description
Technical Field
The invention relates to the technical field of comprehensive traffic emergency guarantee, in particular to a staged optimization method for emergency traffic operation.
Background
When coping with local emergencies such as dangerous chemical explosion leakage and fire, an optimal traffic route for the evacuation vehicles for transferring disaster-stricken people and the rescue vehicles for transporting emergency resources to run on a road network is not unique and conflicts exist. The rescue vehicles that pass preferentially can obstruct the passage of the evacuation vehicles. How to ensure orderly and smooth efficient operation of emergency traffic under local emergency, so that disaster-stricken personnel can safely transfer to a safe area from the disaster-stricken area as soon as possible, and rescue vehicles can reach the disaster-stricken area as soon as possible is always one of hot spots and difficulties focused by students and government departments in emergency management practice.
In the prior art, a scheme adopts static travel time to determine an emergency traffic route under a local emergency, and then when the evacuation traffic route is optimized through a double-layer planning model, the emergency traffic route of the vehicles which pass preferentially is reserved. Obviously, the staged optimizing method for emergency traffic operation cannot consider that the traffic route of the vehicles which pass preferentially changes dynamically along with traffic situation, and is suitable for lower emergency traffic requirements.
In addition, the method aims at minimizing the number of the evacuation vehicles running on the road network under the local emergency, establishes a mixed integer linear programming model, and is difficult to ensure that the rescue vehicles select the optimal traffic route on the road network when optimizing the traffic route of the emergency evacuation and rescue vehicles on the road network.
And the method also aims at minimizing weighted values of evacuation cost, rescue cost, retrograde cost and traffic flow conflict cost under local emergency, and establishes a minimum cost flow model to optimize the traffic route of emergency evacuation and rescue vehicles on the road network. Obviously, when the weighted evacuation cost and the rescue cost cannot ensure that the traffic routes of the evacuation vehicles and the rescue vehicles collide, the rescue vehicles preferentially pass through the road network.
The emergency traffic operation staged optimization method in the prior art ignores the non-uniqueness of the optimal rescue traffic operation scheme when the evacuation and rescue vehicles dynamically operate on the road network. In practical application, the emergency management department needs to select a scheme with the least influence on evacuation traffic operation from a plurality of optimal rescue traffic operation schemes so as to consider rescue traffic and evacuation traffic operation effects.
Disclosure of Invention
The embodiment of the invention provides a staged optimization method for emergency traffic operation, which aims to solve the problem of coordinated optimization of orderly smooth and efficient operation of emergency evacuation and rescue vehicles on a large-scale road network under a local emergency.
In order to achieve the above purpose, the present invention adopts the following technical scheme.
A staged optimization method for emergency traffic operation, comprising:
step S10, acquiring emergency scenes, evacuation traffic demands, rescue traffic demands, road network structures and attribute data, establishing constraint conditions and objective functions for rescue traffic operation optimization according to the acquired data, and establishing intersection conflict steering constraint conditions;
step S20, calling a solver to solve a mixed integer linear programming model which takes constraint conditions of the rescue traffic operation optimization and constraint conditions of intersection conflict steering as constraint conditions and takes an objective function of the rescue traffic operation optimization as an optimization target, and obtaining a rescue traffic operation optimization scheme which enables a rescue vehicle to arrive at a disaster area at the highest speed;
step S30, establishing constraint conditions and objective functions of evacuation traffic operation optimization for preferential passing of rescue vehicles based on the rescue traffic operation optimization scheme;
and S40, calling a solver to solve the mixed integer linear programming model which takes the constraint condition of the evacuation traffic operation optimization and the conflict steering constraint condition of the intersection as the constraint condition and takes the objective function of the evacuation traffic operation optimization as the optimization objective, and obtaining an evacuation traffic operation optimization scheme which is used for leading the rescue vehicles to pass preferentially and leading the evacuation vehicles to be safely transferred from the disaster area to the safety area as soon as possible.
Preferably, the obtaining the emergency scene, the evacuation traffic demand, the rescue traffic demand, the road network structure and the attribute data includes:
determining the traffic capacity Q of any road section i on road network of emergency area i Velocity v of free flow i Density ρ of clogging i jam The macroscopic traffic flow parameters i epsilon L, L are road segment sets in an emergency area, the other road segments forming an intersection with the road segment i are numbered j, k and L, and the inflow and outflow relation and state of the emergency traffic flow among the road segments are determined, wherein the macroscopic traffic flow parameters comprise the accumulated inflow emergency vehicle number U, the accumulated outflow emergency vehicle number V, the intersection steering emergency vehicle number f and the bearing emergency vehicle number x of each road segment in different time;
determining evacuation traffic outlet of evacuation vehicles from disaster-stricken area entering road network and road network evacuation traffic outlet of road network leaving road network entering external safety area, and further respectively using symbol L for road segment set bearing evacuation vehicles leaving disaster-stricken area and entering external safety area 2 ο 、L 2 · A representation; determining a rescue traffic entrance for a rescue vehicle to enter an emergency area road network from the outside and reach a disaster-stricken area, and further enabling the bearing rescue vehicle to enter the emergency area from the outsideThe road segment sets reaching the disaster-stricken area are respectively marked by L 1 · 、L 1 ο A representation;
determining a danger level omega of an area around a disaster position under a local emergency scene so as to orderly evacuate disaster-stricken personnel of each area and allocate rescue resources based on the danger level, wherein the method comprises the following steps: how many disaster-stricken personnel should be evacuated from what disaster-stricken area at what time
How many rescue resources are allocated from where at what time +.>
Etc.; determining road hazard class omega i And evaluating disaster threats faced by different roads in the transferring process of the disaster-stricken personnel based on the danger level.
Determining the evacuation traffic demand E of a disaster-stricken area d And rescue traffic demand R for handling emergencies d 。
Preferably, the establishing constraint conditions and objective functions of rescue traffic operation optimization according to the acquired data includes:
taking the rescue vehicle reaching the disaster area as soon as possible as an optimization target, establishing a linear programming model to optimize the dynamic loading process of the rescue vehicle running on the road network, and establishing constraint conditions and objective functions of the rescue traffic running optimization shown in constraint type (1) to (20)
s.t.
The target function formula (1) takes time as weight, maximizes the number of rescue vehicles reaching the disaster-affected area in different time as an optimization target, and ensures that the rescue vehicles reach the disaster-affected area as soon as possible under local emergency; constraint formulas (2) and (12) show that when rescue vehicles dynamically transfer on a road network, the number of the rescue vehicles borne on each road section is kept, constraint formulas (3) to (6) simulate the dynamic operation process of the rescue vehicles on the road network, constraint formulas (7) to (10) calculate the number of the rescue vehicles flowing into and flowing out of each road section, constraint formulas (11) and (12) show that all the rescue vehicles called from the outside of a disaster-stricken area enter the disaster-stricken area, constraint formulas (13) limit the rescue vehicles to leave the emergency area from a rescue traffic inlet at the boundary of the emergency area, constraint formulas (14) show that the rescue vehicles enter the road traffic capacity limit of the emergency area from the outside, constraint formulas (15) show that the free flow time of the road limits the rescue vehicles to pass through roads, constraint formulas (16) and (17) show that no rescue vehicles are operated on the emergency area road network before the rescue work starts, and constraint formulas (18) to (20) give the definition of the decision variables of the rescue traffic operation after the rescue work starts, and finally reach the disaster-stricken area;
table 1 mathematical symbols and their meanings
Preferably, the establishing the intersection conflict steering constraint condition includes:
the steering (i, j) and the steering (k, l) from the road section i to the road section j are in interleaving conflict, namely Γ= { (i, j), (k, l) }, when an emergency vehicle runs on the road network in a local emergency, an interleaving conflict elimination measure is adopted to eliminate the conflict steering of the intersection in space, the steering of the traffic of the emergency vehicle on the road network is controlled, and intersection conflict steering constraint conditions shown in constraint formulas (43) to (45) are established:
preferably, the calling solver solves a mixed integer linear programming model with constraint conditions of the rescue traffic operation optimization and constraint conditions of intersection conflict steering as constraint conditions and an objective function of the rescue traffic operation optimization as an optimization target, and obtains a rescue traffic operation optimization scheme enabling a rescue vehicle to arrive at a disaster area at the highest speed, and the method comprises the following steps:
calling a solver to solve a mixed integer linear programming model taking constraint conditions of rescue traffic operation optimization shown in constraint formulas (2) to (20) and constraint conditions of intersection conflict steering shown in constraint formulas (43) to (45) as constraint conditions and taking an objective function of rescue traffic operation optimization shown in an objective function formula (1) as an optimization target to obtain a rescue traffic operation optimization scheme f which enables rescue vehicles to arrive at a disaster area at the highest speed under a local emergency 1 Sum effect maxZ 1 。
Preferably, the method further comprises:
the target function formula (46) is designed to replace the target function formula (1), and the optimal arrival scheme f of the disaster area rescue vehicle is obtained by the target function formula (1) 1 For constraint, constraint equation (47) and constraint equation (48) are constructed,
s.t.
constraint type (2) to (10), (12) to (20), (48)
Invoking a solver to solve a mixed integer linear programming model taking a constraint formula (47) and a constraint formula (48) as constraint conditions and taking a target function formula (46) as an optimization target, and acquiring a rescue traffic operation optimization scheme f 1 Different rescue traffic operation optimization schemes with the same rescue traffic requirements and rescue effects.
Preferably, the establishing constraint conditions and objective functions of evacuation traffic operation optimization for preferential passage of the rescue vehicles based on the rescue traffic operation optimization scheme includes:
based on the rescue traffic operation optimization scheme, establishing constraint conditions and objective functions of evacuation traffic operation optimization of the preferential passing of the rescue vehicles shown in constraint formulas (21) to (42):
s.t.
the target function formula (21) takes the hazard level of the disaster area and the hazard level of the road as weights respectively, and minimizes the number of the evacuation vehicles staying in the disaster area and the road, so that the disaster personnel can safely transfer from the disaster area as soon as possible;
the evacuation vehicles for transferring disaster-stricken persons should satisfy the constraints (22) to (42) when running on the road network. Constraint formulas (22) represent that the number of the evacuation vehicles carried on each road section is kept when the evacuation vehicles are dynamically transferred on the road network, constraint formulas (23) to (26) simulate the dynamic running process of the evacuation vehicles on the road network, constraint formulas (27) to (30) calculate the number of the evacuation vehicles flowing into and flowing out of each road section, constraint formulas (31) and (32) represent that disaster-stricken persons are completely transferred from a disaster-stricken area to a safe area, and the evacuation vehicles let the rescue vehicles pass until the rescue vehicles pass through when the evacuation vehicles collide with the traffic routes of the rescue vehicles in the running process of the evacuation traffic which faces the rescue priority;
when the rescue vehicle occupies road sections j, i, m (j, i, m E L) · ) Taking the road section k, l, i, j as an example, the constraint type (33) prohibits the evacuation vehicles from entering the road section i; constraint type (34) prohibits the evacuation vehicles from entering the steering conflicting with the rescue vehicle steering (j, i) at the intersection, constraint type (35) restricts the evacuation vehicles from entering the emergency area from the outside through the emergency area boundary rescue traffic entrance, constraint type (36) indicates the road traffic capacity restriction of the evacuation vehicles entering the external safety area, constraint type (37) indicates the free road travel time restriction of the evacuation vehicles from passing through the road, constraint type (38) and constraint type (39) indicate that no evacuation vehicles are operated on the emergency area road network before the evacuation work starts, constraint type (40) to (42) give the definition domain of the evacuation traffic operation decision variable, namely, after the evacuation work starts, the evacuation vehicles are transferred to leave the disaster-stricken area and reach the safety area.
Preferably, the method for solving the mixed integer linear programming model with the constraint condition of evacuation traffic operation optimization and the constraint condition of intersection conflict steering as the constraint condition and the objective function of evacuation traffic operation optimization as the optimization target by using the call solver comprises the steps of:
invoking a solver to solve a mixed integer linear programming model taking constraint conditions of evacuation traffic operation optimization of preferential passage of rescue vehicles shown in constraint formulas (21) to (42) and constraint conditions of collision and steering of intersections shown in constraint formulas (43) to (45) as constraint conditions, taking an objective function of evacuation traffic operation optimization of preferential passage of rescue vehicles shown in an objective function formula (21) as an optimization objective, acquiring evacuation traffic operation optimization schemes of preferential passage of rescue vehicles, and safely transferring the evacuation vehicles from a disaster area to a safe area as soon as possible, and acquiring evacuation traffic operation optimization schemes f corresponding to different rescue traffic operation optimization schemes under any rescue traffic requirement 2 Sum effect minZ 2 ；
Changing evacuation and rescue traffic demands, circularly executing the processing process, obtaining emergency traffic operation optimization schemes and effects corresponding to different evacuation and rescue traffic demands, analyzing how different optimal rescue traffic operation schemes corresponding to the same rescue traffic demands and rescue effects influence the evacuation traffic operation effects under different evacuation and rescue traffic demands, and obtaining the optimal evacuation traffic operation optimization schemes for the rescue vehicles to pass preferentially and for the evacuation vehicles to safely transfer from a disaster area to a safety area as soon as possible according to analysis results.
According to the technical scheme provided by the embodiment of the invention, the method provided by the embodiment of the invention provides an emergency traffic operation optimization scheme for different evacuation and rescue traffic demands under local emergencies by searching the optimal emergency evacuation and rescue traffic operation scheme when the rescue vehicle runs preferentially.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of the constituent modules of an emergency traffic operation staged optimization method provided by an embodiment of the invention;
FIG. 2 is a schematic diagram of an evacuation vehicle and rescue vehicle according to an embodiment of the present invention;
fig. 3 is a schematic diagram of an intersection interleaving conflict turning provided in an embodiment of the present invention;
FIG. 4 is a schematic diagram of a process flow of an emergency traffic operation staged optimization method according to an embodiment of the present invention;
fig. 5 is an exemplary schematic diagram of a local emergency scenario provided in an embodiment of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary only for explaining the present invention and are not to be construed as limiting the present invention.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless expressly stated otherwise, as understood by those skilled in the art. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or coupled. The term "and/or" as used herein includes any and all combinations of one or more of the associated listed items.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
For the purpose of facilitating an understanding of the embodiments of the invention, reference will now be made to the drawings of several specific embodiments illustrated in the drawings and in no way should be taken to limit the embodiments of the invention.
Example 1
The mathematical symbols and the meanings adopted by the emergency traffic operation staged optimization method are shown in table 1.
Table 1 mathematical symbols and their meanings
Aiming at the defects of the existing emergency traffic operation staged optimization method in the application of the technical field of comprehensive traffic emergency guarantee under the local emergency, if the optimal traffic operation effect can be obtained when the rescue vehicles pass preferentially, the optimal traffic operation effect can also be obtained for the evacuation vehicles going away, and the overall emergency management effect can be improved. Based on the method, the invention provides an improved emergency traffic operation staged optimization method, which is used for analyzing the influence of the non-uniqueness of an optimal rescue traffic operation scheme on the evacuation traffic operation when emergency evacuation and rescue vehicles run on the road network under a local emergency in practical application, searching the optimal emergency evacuation and rescue traffic operation scheme when the rescue vehicles run preferentially, and providing an emergency traffic operation optimization scheme for different evacuation and rescue traffic requirements under the local emergency.
As shown in fig. 1, the emergency traffic operation staged optimization method provided by the invention adopts the following three modules to optimize the traffic operation process of evacuation vehicles and rescue vehicles on a road network, and comprises the following steps: the system comprises an emergency traffic dynamic loading module, an emergency traffic control module and an objective function equivalent conversion module.
(1) Dynamic loading module for emergency traffic operation
The dynamic loading process of the traffic operation of the emergency evacuation and rescue vehicles on the road network adopts a staged optimization method: the first stage, taking the rescue vehicle reaching the disaster area as soon as possible as an optimization target, establishing a linear programming model to optimize the dynamic loading process of the rescue vehicle running on the road network, and obtaining an optimal rescue traffic running scheme; and in the second stage, the evacuation vehicles are used for safely transferring disaster-stricken personnel from the disaster-stricken area to the safety area as soon as possible, a linear programming model is established, a rescue traffic route is reserved until the rescue vehicles pass, and the dynamic loading process of the evacuation vehicles on the road network is optimized.
The first stage: establishing rescue traffic operation optimization constraint conditions and objective functions shown in constraint modes (1) to (20)
s.t.
The target function formula (1) takes time as weight, maximizes the number of rescue vehicles reaching the disaster-affected area in different time as an optimization target, and ensures that the rescue vehicles reach the disaster-affected area as soon as possible under local emergency. Constraint (2) shows that the number of rescue vehicles borne on each road section is conserved when the rescue vehicles dynamically transfer on the road network. The constraint type (3) to (6) simulate the dynamic operation process of the rescue vehicle on the road network. The constraint type (7) to (10) calculates the number of rescue vehicles flowing into and out of each road section. Constraint equations (11) and (12) indicate that rescue vehicles called from outside the disaster area all enter the disaster area. Constraint (13) limits the rescue vehicle from leaving the emergency area from the rescue traffic entrance at the emergency area boundary. Constraint (14) represents a road traffic capacity limit for the rescue vehicle to enter the emergency area from the outside. Constraint (15) indicates that the free travel time of the road limits the passage of rescue vehicles through the road. Without loss of generality, constraint formulas (16) and (17) show that no rescue vehicle is running on the road network in the emergency area before the rescue work starts. Constraint type (18) to (20) are used for giving a definition domain of a rescue traffic operation decision variable, namely after a rescue operation is started, a rescue vehicle enters an emergency area road network from the outside and finally reaches a disaster area.
And a second stage: establishing constraint conditions and objective functions of evacuation traffic operation optimization of preferential passage of rescue vehicles shown in constraint formulas (21) to (42)
s.t.
The target function formula (21) takes the hazard level of the disaster area and the hazard level of the road as weights respectively, and minimizes the number of the evacuated vehicles staying in the disaster area and the road, so that the disaster personnel can safely transfer from the disaster area as soon as possible. The evacuation vehicles for transferring disaster-stricken persons should satisfy the constraints (22) to (42) when running on the road network. Constraint (22) represents conservation of the number of evacuation vehicles carried on each road section when the evacuation vehicles are dynamically transferred on the road network. The constraints (23) to (26) simulate the dynamic operation of an evacuated vehicle on a road network. The constraint type (27) to (30) calculates the number of evacuated vehicles flowing into and out of each road section. Constraint formulas (31) and (32) represent that disaster-stricken persons are all transferred from the disaster-stricken area to the safety area. In the evacuation traffic running process facing the rescue priority, when the evacuation vehicles collide with the traffic route of the rescue vehicles, the evacuation vehicles let the rescue vehicles pass through until the rescue vehicles pass through.
FIG. 2 is a schematic diagram of an evacuation vehicle passing rescue vehicle according to an embodiment of the present invention, as shown in FIG. 2, when the rescue vehicle occupies road sections j, i, m (j, i, m ε L) · ) Taking the road section k, l, i, j as an example, the constraint type (33) prohibits the evacuation vehicles from entering the road section i; constraint (34) prohibits the evacuation vehicle from entering a turn (e.g., turn (k, l) ∈Λ) that conflicts with the rescue vehicle turn (j, i) (i.e., from road segment j to i) at the intersection (j,i) ). The restraint (35) restricts the entry of evacuation vehicles from outside into the emergency area through the emergency area boundary rescue traffic portal. Constraint (36) represents a road traffic capacity limit for evacuating vehicles into an external safety area. Constraint (37) indicates that road free travel time limits the passage of evacuated vehicles through the road. Without loss of generality, constraint (38) and constraint (39) indicate that no evacuation vehicles are running on the emergency area road network before evacuation work begins. Constraint (40) to (42) give the definition domain of evacuation traffic operation decision variables, i.e. after the evacuation work is started, evacuation vehicle transfer is acceptedThe disaster personnel leave the disaster-stricken area and arrive at the safe area.
(2) Emergency traffic control module
Fig. 3 is a schematic diagram of intersection interleaving conflict steering provided in an embodiment of the present invention, as shown in fig. 3, steering (i, j) and steering (k, l) from a road section i to a road section j are interleaving conflicts, i.e. Γ= { (i, j), (k, l) }, when an emergency vehicle runs on a road traffic network in a local emergency, the present invention adopts interleaving conflict elimination measures (constraint formula (43) and constraint formula (45)) to eliminate intersection conflict steering spatially, and controls steering (constraint formula (44)) of the emergency vehicle running on the road traffic network.
Establishing intersection conflict steering constraint conditions shown in constraint formulas (43), (44) and (45)
(3) Objective function equivalence conversion
The optimal route is not unique when the rescue vehicle runs on the road network, and different optimal rescue traffic running schemes can obtain the same rescue effect. The invention designs the optimal arrival scheme of the rescue vehicle in the disaster-affected area, which is obtained by the target function (1), by replacing the target function (46) with the target function (1)
And (3) constructing a constraint formula (47) and a constraint formula (48) for constraint, and obtaining different rescue traffic operation optimization schemes with the same rescue effect as the target function formula (1). The objective function (46) optimizes and integrates the number of rescue vehicles flowing into each road by taking the road danger level as a weight.
Establishment of
s.t.
Constraint type (2) to (10), (12) to (20), (48)
Example two
The specific processing flow of the emergency traffic operation staged optimization method provided by the invention is shown in fig. 4, and comprises the following processing steps:
step S10, basic data such as emergency scenes, evacuation traffic demands, rescue traffic demands, road network structures and attributes are determined.
Fig. 5 is an exemplary schematic diagram of a local emergency scenario provided in an embodiment of the present invention. Determining the traffic capacity Q of any road segment i (i.e. L) on the road network of an emergency area (e.g. the area enclosed by nodes 1, 7, 49, 54 of FIG. 5) i Velocity v of free flow i Density ρ of clogging i jam The macroscopic traffic flow parameters are used as limiting conditions for the dynamic operation process of the emergency vehicle on the road network; the different road sections are numbered i, j, k, l (see fig. 2), and the inflow and outflow relation and state of the emergency traffic flow among the road sections are determined, namely the accumulated inflow emergency vehicle number U, the accumulated outflow emergency vehicle number V, the intersection steering emergency vehicle number f and the carried emergency vehicle number x of the road sections in different time.
Determining evacuation traffic outlet (such as node 34 in fig. 5) of evacuation vehicles from disaster-stricken area into road network, and road network evacuation traffic outlet (such as nodes 1, 7, 49 and 54 in fig. 5) of road network from road network into external safety area, and respectively using symbol L to collect road sections carrying evacuation vehicles from disaster-stricken area into external safety area 2 °、L 2 Representation; determining rescue traffic entrances from outside into an emergency area road network and to a disaster-stricken area (e.g. nodes 1, 7 of fig. 5,35. 49, 54) and further respectively using symbols L to respectively carry road segment sets of rescue vehicles entering an emergency area from an external area and reaching a disaster-stricken area 1 ·、L 1 And °.
In the case of a local emergency (e.g., the local area surrounded by nodes 34, 35, 39, 40 of fig. 5), the risk level ω of the area surrounding the disaster location (e.g., area I, II, III, IV of fig. 5) is determined to sequentially evacuate disaster-stricken persons from each area based on the risk level, and rescue resources are allocated, e.g., how many disaster-stricken persons should be evacuated from what disaster-stricken area
How many rescue resources are allocated from where at what time +.>
Etc.; determining road hazard class omega i And evaluating disaster threats faced by different roads in the transferring process of the disaster-stricken personnel based on the danger level.
Determining the evacuation traffic demand E of a disaster-stricken area d And rescue traffic demand R for handling emergencies d 。
And step S20, calling solvers such as Cplex, gurobi and the like to solve the mixed integer linear programming model taking the target function formula (1) as an optimization target by using constraint formulas (2) to (20) and constraint formulas (43) to (45) as limiting conditions, and obtaining a rescue traffic operation optimization scheme enabling the rescue vehicle to reach the disaster area at the highest speed.
According to the determined emergency area, a mathematical programming model for optimizing emergency traffic operation is established by adopting the staged optimization method provided by the invention, basic data such as emergency scenes, rescue traffic demands, road network structures, attributes and the like determined in the first step are taken as input, solvers such as Cplex, gurobi and the like are called to solve, constraint formulas (2) to (20) and constraint formulas (43) to (45) are taken as constraint conditions, and a mixed integer linear programming model with a target function formula (1) as an optimization target is taken to obtain an optimal rescue traffic operation scheme f under a local emergency 1 Sum effect maxZ 1 。
And step S30, taking the optimal arrival scheme of the rescue vehicle entering the disaster-stricken area obtained in the step S20 as input, calling solvers such as Cplex, gurobi and the like to solve the mixed integer linear programming model taking the target function formula (46) as an optimization target and taking the constraint formula (47) and the constraint formula (48) as limiting conditions, thereby obtaining different rescue traffic operation optimization schemes with the same rescue traffic requirements and rescue effects as the step S20.
Optimal arrival scheme of rescue vehicle in disaster area obtained in step S20
For constraint, a constraint formula (47) and a constraint formula (48) are constructed, solvers such as Cplex, gurobi and the like are called to solve the constraint formula (47) and the constraint formula (48) to limit conditions, a mixed integer linear programming model with a target function formula (46) as an optimization target is used, and different rescue traffic operation optimization schemes with the same rescue effect as that of the step S20 under the local emergency are obtained.
Step S40, constructing a constraint type (33) and a constraint type (34) by taking the rescue traffic operation optimization schemes obtained in the step S20 and the step S30 as constraint conditions of evacuation traffic operation optimization respectively
Step S50, calling solvers such as Cplex, gurobi and the like to solve a mixed integer linear programming model which uses constraint formulas (22) to (42) and constraint formulas (43) to (45) as limiting conditions and uses a target function formula (21) as an optimization target, and obtaining an evacuation traffic operation optimization scheme for enabling rescue vehicles to pass preferentially and enabling evacuation vehicles to safely transfer from a disaster area to a safe area as soon as possible
On the basis of input data, inputting evacuation traffic demands, calling solvers such as Cplex, gurobi and the like to solve the evacuation traffic running optimization schemes f corresponding to different rescue traffic running optimization schemes under any rescue traffic demands by taking a target function (21) as an optimization target evacuation traffic running optimization model under the constraint conditions of constraint formulas (22) to (42) and constraint formulas (43) to (45) 2 Sum effect min Z 2 。
Step S60, circularly executing the steps S20 to S50, and obtaining an emergency evacuation and rescue traffic operation optimization scheme and effects thereof under different evacuation and rescue traffic demands.
And (5) changing evacuation and rescue traffic demands, and circularly executing the steps S20 to S50 to obtain emergency traffic operation optimization schemes and effects corresponding to different evacuation and rescue traffic demands. Analyzing how different optimal rescue traffic running schemes corresponding to the same rescue traffic requirements and rescue effects influence the evacuation traffic running effects under different evacuation and rescue traffic requirements, wherein the influence has a difference between the different evacuation and rescue traffic requirements; whether the obtained optimal evacuation traffic running scheme is an actually available optimal scheme.
In summary, the emergency traffic operation staged optimization method of the invention has the advantages in practical application:
(1) When the rescue vehicle is optimized to run on the road network, a non-unique optimal rescue traffic running scheme can be obtained, the defect that different optimal solutions cannot be obtained in actual application of the existing method is overcome, the optimal emergency evacuation and rescue traffic running scheme when the rescue vehicle runs preferentially is sought, and the emergency traffic running optimization scheme is provided for different evacuation and rescue traffic requirements under local emergencies.
(2) The influence of different optimal rescue traffic running schemes corresponding to the same rescue traffic demands and rescue effects on the evacuation traffic running effects under different evacuation and rescue traffic demands can be analyzed, and the difference of the influence among different evacuation and rescue traffic demands;
(3) And whether the optimal evacuation traffic running scheme obtained by solving the phased optimization model is an optimal scheme can be verified.
Those of ordinary skill in the art will appreciate that: the drawing is a schematic diagram of one embodiment and the modules or flows in the drawing are not necessarily required to practice the invention.
From the above description of embodiments, it will be apparent to those skilled in the art that the present invention may be implemented in software plus a necessary general hardware platform. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present invention.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for apparatus or system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, with reference to the description of method embodiments in part. The apparatus and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The present invention is not limited to the above-mentioned embodiments, and any changes or substitutions that can be easily understood by those skilled in the art within the technical scope of the present invention are intended to be included in the scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.
Claims (5)
1. A method for staged optimization of emergency traffic operation, comprising:
step S10, acquiring emergency scenes, evacuation traffic demands, rescue traffic demands, road network structures and attribute data, establishing constraint conditions and objective functions for rescue traffic operation optimization according to the acquired data, and establishing intersection conflict steering constraint conditions;
step S20, calling a solver to solve a mixed integer linear programming model which takes constraint conditions of the rescue traffic operation optimization and constraint conditions of intersection conflict steering as constraint conditions and takes an objective function of the rescue traffic operation optimization as an optimization target, and obtaining a rescue traffic operation optimization scheme which enables a rescue vehicle to arrive at a disaster area at the highest speed;
step S30, establishing constraint conditions and objective functions of evacuation traffic operation optimization for preferential passing of rescue vehicles based on the rescue traffic operation optimization scheme;
step S40, calling a solver to solve a mixed integer linear programming model which takes constraint conditions of evacuation traffic operation optimization and the intersection conflict steering constraint conditions as constraint conditions and takes an objective function of the evacuation traffic operation optimization as an optimization target, and obtaining an evacuation traffic operation optimization scheme which is used for leading rescue vehicles to pass preferentially and leading the evacuation vehicles to safely transfer from a disaster area to a safety area as soon as possible;
the obtaining the emergency scene, the evacuation traffic demand, the rescue traffic demand, the road network structure and the attribute data comprises the following steps:
determining the traffic capacity Q of any road section i on road network of emergency area i Velocity v of free flow i Density ρ of clogging i jam The macroscopic traffic flow parameters i epsilon L, L are road segment sets in an emergency area, the other road segments forming an intersection with the road segment i are numbered j, k and L, and the inflow and outflow relation and state of the emergency traffic flow among the road segments are determined, wherein the macroscopic traffic flow parameters comprise the accumulated inflow emergency vehicle number U, the accumulated outflow emergency vehicle number V, the intersection steering emergency vehicle number f and the bearing emergency vehicle number x of each road segment in different time;
determining evacuation traffic outlet of evacuation vehicles from disaster-stricken area entering road network and road network evacuation traffic outlet of road network leaving road network entering external safety area, and further respectively using symbol L for road segment set bearing evacuation vehicles leaving disaster-stricken area and entering external safety area 2 °、L 2 · A representation; determining a rescue traffic entrance for a rescue vehicle to enter an emergency area road network from the outside and reach a disaster-stricken area, and further entering the bearing rescue vehicle from the outside areaThe road segment sets reaching the disaster-stricken area are respectively marked by L 1 · 、L 1 A degree;
determining a danger level omega of an area around a disaster position under a local emergency scene so as to orderly evacuate disaster-stricken personnel of each area and allocate rescue resources based on the danger level, wherein the method comprises the following steps: how many disaster-stricken personnel should be evacuated from what disaster-stricken area at what time
How many rescue resources are allocated from where at what time +.>
Determining road hazard class omega i Evaluating disaster threats faced by different roads in the transferring process of disaster-stricken personnel based on the danger level;
determining the evacuation traffic demand E of a disaster-stricken area d And rescue traffic demand R for handling emergencies d ；
The constraint condition and the objective function for establishing rescue traffic operation optimization according to the acquired data comprise:
taking the rescue vehicle reaching the disaster area as soon as possible as an optimization target, establishing a linear programming model to optimize the dynamic loading process of the rescue vehicle running on the road network, and establishing constraint conditions and objective functions of the rescue traffic running optimization shown in constraint type (1) to (20)
The target function formula (1) takes time as weight, maximizes the number of rescue vehicles reaching the disaster-affected area in different time as an optimization target, and ensures that the rescue vehicles reach the disaster-affected area as soon as possible under local emergency; constraint formulas (2) and (12) show that when rescue vehicles dynamically transfer on a road network, the number of the rescue vehicles borne on each road section is kept, constraint formulas (3) to (6) simulate the dynamic operation process of the rescue vehicles on the road network, constraint formulas (7) to (10) calculate the number of the rescue vehicles flowing into and flowing out of each road section, constraint formulas (11) and (12) show that all the rescue vehicles called from the outside of a disaster-stricken area enter the disaster-stricken area, constraint formulas (13) limit the rescue vehicles to leave the emergency area from a rescue traffic inlet at the boundary of the emergency area, constraint formulas (14) show that the rescue vehicles enter the road traffic capacity limit of the emergency area from the outside, constraint formulas (15) show that the free flow time of the road limits the rescue vehicles to pass through roads, constraint formulas (16) and (17) show that no rescue vehicles are operated on the emergency area road network before the rescue work starts, and constraint formulas (18) to (20) give the definition of the decision variables of the rescue traffic operation after the rescue work starts, and finally reach the disaster-stricken area;
table 1 mathematical symbols and their meanings
The establishing constraint conditions and objective functions of evacuation traffic operation optimization for the preferential passing of the rescue vehicles based on the rescue traffic operation optimization scheme comprises the following steps:
based on the rescue traffic operation optimization scheme, establishing constraint conditions and objective functions of evacuation traffic operation optimization of the preferential passing of the rescue vehicles shown in constraint formulas (21) to (42):
s.t.
the target function formula (21) takes the hazard level of the disaster area and the hazard level of the road as weights respectively, and minimizes the number of the evacuation vehicles staying in the disaster area and the road, so that the disaster personnel can safely transfer from the disaster area as soon as possible;
the evacuation vehicles for transferring disaster victims run on the road network and should meet constraint formulas (22) to (42), the constraint formulas (22) represent that the number of the evacuation vehicles carried on each road section is kept when the evacuation vehicles are dynamically transferred on the road network, the constraint formulas (23) to (26) simulate the dynamic running process of the evacuation vehicles on the road network, the constraint formulas (27) to (30) calculate the number of the evacuation vehicles flowing into and out of each road section, the constraint formulas (31) and (32) represent that the disaster victims are completely transferred from the disaster victims to the safe area, and the evacuation vehicles let the rescue vehicles pass when the evacuation vehicles collide with the traffic routes of the rescue vehicles in the process of the evacuation traffic running facing the rescue priority;
when the rescue vehicle occupies road sections j, i, m (j, i, m E L) · ) Taking the road section k, l, i, j as an example, the constraint type (33) prohibits the evacuation vehicles from entering the road section i; constraint type (34) prohibits the evacuation vehicles from entering the steering conflicting with the rescue vehicle steering (j, i) at the intersection, constraint type (35) restricts the evacuation vehicles from entering the emergency area from the outside through the emergency area boundary rescue traffic entrance, constraint type (36) indicates the road traffic capacity restriction of the evacuation vehicles entering the external safety area, constraint type (37) indicates the free road travel time restriction of the evacuation vehicles from passing through the road, constraint type (38) and constraint type (39) indicate that no evacuation vehicles are operated on the emergency area road network before the evacuation work starts, constraint type (40) to (42) give the definition domain of the evacuation traffic operation decision variable, namely, after the evacuation work starts, the evacuation vehicles are transferred to leave the disaster-stricken area and reach the safety area.
2. The method of claim 1, wherein establishing intersection conflict steering constraints comprises:
the steering (i, j) and the steering (k, l) from the road section i to the road section j are in interleaving conflict, namely Γ= { (i, j), (k, l) }, when an emergency vehicle runs on the road network in a local emergency, an interleaving conflict elimination measure is adopted to eliminate the conflict steering of the intersection in space, the steering of the traffic of the emergency vehicle on the road network is controlled, and intersection conflict steering constraint conditions shown in constraint formulas (43) to (45) are established:
3. the method according to claim 2, wherein the step of calling the solver to solve a mixed integer linear programming model using the constraint condition of the rescue traffic operation optimization and the constraint condition of the intersection collision steering as constraint conditions and using the objective function of the rescue traffic operation optimization as an optimization target to obtain a rescue traffic operation optimization scheme enabling a rescue vehicle to arrive at a disaster area at the highest speed comprises the steps of:
calling a solver to solve a mixed integer linear programming model taking constraint conditions of rescue traffic operation optimization shown in constraint formulas (2) to (20) and constraint conditions of intersection conflict steering shown in constraint formulas (43) to (45) as constraint conditions and taking an objective function of rescue traffic operation optimization shown in an objective function formula (1) as an optimization target to obtain a rescue traffic operation optimization scheme f which enables rescue vehicles to arrive at a disaster area at the highest speed under a local emergency 1 Sum effect maxZ 1 。
4. A method according to claim 3, wherein the method further comprises:
the target function formula (46) is designed to replace the target function formula (1), and the optimal arrival scheme f of the disaster area rescue vehicle is obtained by the target function formula (1) 1 For constraint, constraint equation (47) and constraint equation (48) are constructed,
s.t.
the constraint formulas (2) to (10), (12) to (20) (48) call a solver to solve, the constraint formula (47) and the constraint formula (48) are used as limiting conditions, a mixed integer linear programming model with the target function formula (46) as an optimization target is used, and the rescue traffic operation optimization scheme f is obtained 1 Different rescue traffic operation optimization schemes with the same rescue traffic requirements and rescue effects.
5. The method of claim 1, wherein the step of calling the solver to solve a mixed integer linear programming model using the constraint condition of the evacuation traffic operation optimization and the collision steering constraint condition of the intersection as constraint conditions and using the objective function of the evacuation traffic operation optimization as an optimization target to obtain an evacuation traffic operation optimization scheme for optimizing the preferential passage of rescue vehicles and safely transferring the evacuation vehicles from the disaster area to the safety area as soon as possible comprises the steps of:
invoking a solver to solve a mixed integer linear programming model taking constraint conditions of evacuation traffic operation optimization of preferential passage of rescue vehicles shown in constraint formulas (21) to (42) and constraint conditions of collision and steering of intersections shown in constraint formulas (43) to (45) as constraint conditions, taking an objective function of evacuation traffic operation optimization of preferential passage of rescue vehicles shown in an objective function formula (21) as an optimization objective, acquiring evacuation traffic operation optimization schemes of preferential passage of rescue vehicles, and safely transferring the evacuation vehicles from a disaster area to a safe area as soon as possible, and acquiring evacuation traffic operation optimization schemes f corresponding to different rescue traffic operation optimization schemes under any rescue traffic requirement 2 Sum effect minZ 2 ；
Changing evacuation and rescue traffic demands, circularly executing the processing process, obtaining emergency traffic operation optimization schemes and effects corresponding to different evacuation and rescue traffic demands, analyzing how different optimal rescue traffic operation schemes corresponding to the same rescue traffic demands and rescue effects influence the evacuation traffic operation effects under different evacuation and rescue traffic demands, and obtaining the optimal evacuation traffic operation optimization schemes for the rescue vehicles to pass preferentially and for the evacuation vehicles to safely transfer from a disaster area to a safety area as soon as possible according to analysis results.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210493310.6A CN114882715B (en) | 2022-05-07 | 2022-05-07 | Staged optimization method for emergency traffic operation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210493310.6A CN114882715B (en) | 2022-05-07 | 2022-05-07 | Staged optimization method for emergency traffic operation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114882715A CN114882715A (en) | 2022-08-09 |
| CN114882715B true CN114882715B (en) | 2023-05-23 |
Family
ID=82674547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210493310.6A Active CN114882715B (en) | 2022-05-07 | 2022-05-07 | Staged optimization method for emergency traffic operation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114882715B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016169290A1 (en) * | 2015-04-21 | 2016-10-27 | 华南理工大学 | Decision-making supporting system and method oriented towards emergency disposal of road traffic accidents |
| CN113689696A (en) * | 2021-08-12 | 2021-11-23 | 北京交通大学 | Multi-mode traffic collaborative evacuation method based on lane management |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6539300B2 (en) * | 2001-07-10 | 2003-03-25 | Makor Issues And Rights Ltd. | Method for regional system wide optimal signal timing for traffic control based on wireless phone networks |
| JP2020502718A (en) * | 2016-12-19 | 2020-01-23 | スルグリーン・エルエルシー | Connected adaptive vehicle traffic management system with digital prioritization |
| CN106683413A (en) * | 2017-02-07 | 2017-05-17 | 德阳力久云智知识产权运营有限公司 | Rapid rescue system based on emergency lane |
| CN107705592A (en) * | 2017-10-24 | 2018-02-16 | 上海理工大学 | Towards the coordinating control of traffic signals optimization method of emergency relief vehicle driving path |
| EP3509020A1 (en) * | 2018-01-09 | 2019-07-10 | Robert Bosch GmbH | Mass evacuation utilizing a fleet of autonomous vehicles |
| CN109410606B (en) * | 2018-03-22 | 2021-05-04 | 合肥革绿信息科技有限公司 | Main road cooperative annunciator control method based on video |
| CN111882909B (en) * | 2020-08-03 | 2022-05-24 | 上海理工大学 | Emergency rescue scheduling and dynamic path integration method based on double-layer planning |
| CN112084677A (en) * | 2020-09-21 | 2020-12-15 | 郑州航空工业管理学院 | Preventive maintenance and control chart combined availability optimization method suitable for emergency production system |
| CN113724510B (en) * | 2021-07-22 | 2022-08-16 | 东南大学 | Emergency signal priority and social vehicle dynamic path induction collaborative optimization method |
-
2022
- 2022-05-07 CN CN202210493310.6A patent/CN114882715B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016169290A1 (en) * | 2015-04-21 | 2016-10-27 | 华南理工大学 | Decision-making supporting system and method oriented towards emergency disposal of road traffic accidents |
| CN113689696A (en) * | 2021-08-12 | 2021-11-23 | 北京交通大学 | Multi-mode traffic collaborative evacuation method based on lane management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114882715A (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Peng et al. | A self-learning dynamic path planning method for evacuation in large public buildings based on neural networks | |
| Kuligowski | Computer evacuation models for buildings | |
| Jiang et al. | Automated rule-based constructability checking: Case study of formwork | |
| WO2014080040A2 (en) | Method and system for evacuation support | |
| CN109768894B (en) | Air traffic dependent network vulnerability identification and control method and system | |
| CN113689696B (en) | Multi-mode traffic collaborative evacuation method based on lane management | |
| KR101308789B1 (en) | Method for automated evacuation regulation checking for high-rise buildings using bim | |
| Cho et al. | An automated direction setting algorithm for a smart exit sign | |
| CN114882715B (en) | Staged optimization method for emergency traffic operation | |
| Borst et al. | BIM for Simulation | |
| Rehak et al. | Identifying critical elements of road infrastructure using cascading impact assessment | |
| Coar et al. | Methodology and challenges of fire following earthquake analysis: an urban community study considering water and transportation networks | |
| Ma et al. | Method of bottleneck identification and evaluation during crowd evacuation process | |
| CN111709591B (en) | Method and device for configuring emergency site | |
| Kinsey et al. | Investigating evacuation lift dispatch strategies using computer modelling | |
| Cortés et al. | Design and analysis of a tool for planning and simulating dynamic vertical transport | |
| Kimms et al. | An exact network flow formulation for cell‐based evacuation in urban areas | |
| Rahman et al. | Impact of evacuation design parameter on users' evacuation time using a multi-agent simulation | |
| A Konstantinidou et al. | A multi-objective network design model for post-disaster transportation network management | |
| Lo et al. | Using agent-based simulation model for studying fire escape process in metro stations | |
| Lee | Using a guiding network to determine efficient evacuation routes in a public building | |
| Sangsawang et al. | Capacitated single‐allocation hub location model for a flood relief distribution network | |
| Wagoum et al. | Conception, development, installation and evaluation of a real time evacuation assistant for complex buildings | |
| Schadschneider et al. | HERMES: An evacuation assistant for large sports arenas based on microscopic simulations of pedestrian dynamics | |
| Porto et al. | BIM as a structural safety study tool in case of fire-BIMSCIP |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |