A method for dispatching rescue resources for emergency response to hazardous chemical accidents

Abstract

The present invention provides a method for dispatching rescue resources for emergency response to hazardous chemical accidents. Hazardous chemical accidents have a domino effect. In the process of emergency rescue dispatch, the resource demand and dispatch of secondary accidents must be taken into account. The method is as follows: when an emergency occurs, set F is the set of primary disaster affected points, set M is the set of secondary disaster affected points, and for each estimated secondary disaster affected point M, v , with probability ρ v Secondary disasters occur; Set L is the emergency resource rescue point; Under emergency conditions, the types of emergency resources required by the primary disaster affected point F and the secondary disaster affected point M are recorded as R = {R j |j=1,2,…j}; emergency resource types R1, R2, R3 are sorted according to resource supply rules and time order matrix SP |L|×|F∪M| Allocate resources to each disaster site, allowing for the rapid development of emergency resource dispatch plans that meet the resource needs of each site. Maximizing the needs of disaster sites while balancing timeliness and cost-effectiveness is crucial for rescue efforts.

Description

Technical Field

[0001] The present invention belongs to the technical field of disaster prevention command and dispatch, and specifically relates to a method for dispatching rescue resources for emergency disposal of hazardous chemical accidents. Background Art

[0002] Hazardous chemicals are flammable, explosive, toxic, and harmful. If large quantities of hazardous chemicals are stored in hazardous chemical warehouses or laboratories, and if hazard management and use are not standardized, management scope is limited, and real-time monitoring is impossible, hazardous chemical accidents may occur. Hazardous chemical accidents often trigger a series of secondary disasters. Therefore, during the resource scheduling design process, both primary and secondary disasters should be considered simultaneously.

[0003] The goal of emergency dispatch is to quickly develop a resource dispatch plan that meets the resource needs of the disaster site. Maximizing the needs of the disaster site while balancing timeliness and cost-effectiveness is crucial to rescue efforts.

[0004] A heuristic algorithm is an algorithm based on intuition or experience. It provides a feasible solution for each instance of the combinatorial optimization problem at an acceptable cost (in terms of computational time and space). The degree to which this feasible solution deviates from the optimal solution is generally unpredictable. Currently, heuristic algorithms are primarily based on natural-object-based algorithms, including ant colony algorithms, simulated annealing, and neural networks. Summary of the Invention

[0005] In order to solve the above problems, the present invention provides a method for dispatching rescue resources for emergency response to hazardous chemical accidents, which can quickly formulate an emergency resource dispatch plan that can meet the resource needs of the disaster site, thereby shortening the time of resource dispatch.

[0006] The technical solutions of the present invention are as follows:

[0007] A method for dispatching rescue resources for emergency response to hazardous chemical accidents. Hazardous chemical accidents have a domino effect. If a hazardous chemical accident occurs, it will trigger one or more secondary accidents. During the emergency rescue dispatch process, the resource requirements and dispatch of both the initial accident and the secondary accidents must be considered. The method includes the following steps:

[0008] Step S1: When a hazardous chemicals incident occurs, the set F = {F f |f=1,2,…|F|} is the set of initial accident-affected points, and the set M={M v |v=1,2,…|M|} is the set of secondary accident affected points. For each initial accident, the probability ρ v A domino effect occurs; the set L = {L i|i=1,2,…|L|} is the emergency resource rescue point; in the emergency state, the types of emergency resources required by the initial accident disaster point F and the secondary accident disaster point M are recorded as R={R j |j=1,2,…j};

[0009] Use map software to find the shortest path from each rescue point to the disaster site and determine the shortest rescue time t ic , construct the time order matrix SP from the rescue point to the disaster point |L|×|F∪M| ;t ic From rescue point L i Rescue time to disaster site c, c∈F∪M;

[0010] Step S2: Classify the emergency rescue demand level of hazardous chemical accidents according to the handling standards of hazardous chemical accidents, and divide the urgency into four levels. Determine the rescue urgency of resource j for initial accidents and secondary accidents according to the disaster level of the affected site;

[0011] Step S3: Classify the emergency resource types R into three categories: R1, R2, and R3, satisfying R=R1∪R2∪R3, where R1 is the set of emergency resource types required only for the initial accident, R2 is the set of emergency resource types required only for the secondary accident, and R3 is the set of public emergency resource types required for both the initial and secondary accidents.

[0012] Step S4: sort the emergency resource types R1, R2, and R3 according to the resource supply rules and time order matrix SP |L|×|F∪M| Allocate resources to each disaster site;

[0013] Step S5: Check whether the resource requirements of the disaster-stricken site have been dispatched. If all resources have been dispatched, proceed to step S5; otherwise, return to step S3.

[0014] Step S6: Summarize and obtain a satisfactory emergency resource scheduling plan.

[0015] Compared with the prior art, the present invention has the following beneficial effects:

[0016] The present invention provides a method for dispatching rescue resources for emergency response to hazardous chemical accidents. The method can quickly formulate an emergency resource dispatch plan that can meet the resource needs of the disaster-stricken area, thereby shortening the time for resource dispatch. In addition, the method has the advantages of the timeliness principle and the maximum matching principle. The timeliness principle: the allocation of emergency resources emphasizes efficiency, and the dispatch process is subject to strict time constraints. The shorter the transportation time, the better. Therefore, the time factor needs to be considered as the optimization target of the dispatch plan. The maximum matching principle: Since the number and type of resource storage at the rescue point are different, the role played by the same rescue point when dispatched to different disaster-stricken areas is also different. Therefore, it is necessary to match the rescue capacity of the rescue point with the disaster situation at the disaster-stricken area based on the resource advantages of each rescue point.

[0017] Based on the domino effect of hazardous chemical accidents, the present invention divides hazardous chemical accidents into two types: initial accidents and secondary accidents. Taking into account the urgency of rescue needs after the accident, the present invention establishes an emergency rescue resource scheduling model with multiple resources, multiple rescue points, and multiple disaster-stricken points, with the shortest emergency time and the lowest transportation cost as the objective function. A heuristic algorithm is also designed to solve multiple emergency resource scheduling models. It can quickly formulate emergency resource scheduling plans that can meet the resource needs of disaster-stricken points, thereby shortening the time of resource scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 Schematic diagram of the method of the present invention.

[0019] Figure 2 This is a schematic diagram of a collection of emergency resource types, namely, emergency resources R1, R2, and R3 of the present invention. DETAILED DESCRIPTION

[0020] The present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.

[0021] See also Figure 1 A method for dispatching rescue resources for emergency response to hazardous chemical accidents. Hazardous chemical accidents have a domino effect. If an accident occurs with a hazardous chemical within a park and spreads to adjacent facilities, it can trigger one or more secondary accidents, resulting in more serious consequences. During the emergency rescue dispatch process, the resource requirements and dispatch of both the initial accident and the secondary accidents must be considered. The method includes the following steps:

[0022] Step S1: When a hazardous chemicals incident occurs, the set F = {F f |f=1,2,…|F|} is the set of initial accident-affected points, and the set M={M v |v=1,2,…|M|} is the set of secondary accident affected points. For each initial accident, the probability ρ vA domino effect occurs; the set L = {L i |i=1,2,…|L|} is the emergency resource rescue point; in the emergency state, the types of emergency resources required by the initial accident disaster point F and the secondary accident disaster point M are recorded as R={R j |j=1,2,…j};

[0023] Use Baidu Map to find the shortest path from each rescue point to the disaster site and determine the shortest rescue time t ic , construct the time order matrix SP from the rescue point to the disaster point |L|×|F∪M| ;t ic From rescue point L i The rescue time to the disaster site c, (c∈F∪M);

[0024] Step S2: Classify the emergency rescue demand level of hazardous chemical accidents according to the handling standards of hazardous chemical accidents, divide the urgency into four levels, and determine the rescue urgency of resource j for initial accidents and secondary accidents according to the disaster level of the disaster site.

[0025] Step S3: Classify the emergency resource types R into three categories: R1, R2, and R3, satisfying R=R1∪R2∪R3, where R1 is the set of emergency resource types required only for the initial accident, R2 is the set of emergency resource types required only for the secondary accident, and R3 is the set of public emergency resource types required for both the initial and secondary accidents.

[0026] Step S4: sort the emergency resource types R1, R2, and R3 according to the resource supply rules and time order matrix SP |L|×|F∪M| Allocate resources to each disaster site;

[0027] Step S5: Check whether the resource requirements of the disaster-stricken site have been dispatched. If all resources have been dispatched, proceed to step S6; otherwise, return to step S3.

[0028] Step S6: Summarize and obtain a satisfactory emergency resource scheduling plan.

[0029] After an emergency occurs, the primary goal of the present invention is to minimize the total time of resource scheduling, which is:

[0030]

[0031] in, Time for initial incident response dispatch;

[0032] The expected time for dispatching for a Level 2 accident;

[0033] Resource scheduling should minimize economic costs while meeting the time-first requirement. Another goal to be met is the total cost of emergency rescue:

[0034]

[0035] in, The total cost of transporting emergency resources to the initial accident site, The cost of transporting emergency resources to the site of a secondary accident.

[0036] Constraints on the availability of resources at the initial accident site:

[0037]

[0038] Indicates that the scheduling of initial accident emergency resources meets the supply and demand balance:

[0039]

[0040] Indicates that the scheduling of secondary accident emergency resources meets the supply and demand balance:

[0041]

[0042] Represents the resource availability constraint for secondary accident emergency dispatch

[0043]

[0044] When the rescue point provides resources, R if and R iv Take 1, when no resources are provided, R if and R iv Take 0

[0045]

[0046]

[0047] Shortest path and transit time parameters:

[0048] d if :Indicates the rescue point L i To the initial accident disaster point F f The shortest path distance

[0049] d iv :Indicates the rescue point L i To the secondary accident site M v The shortest path distance

[0050] t if :From rescue point L i To the disaster site F fThe shortest emergency dispatch time, in hours;

[0051] t iv :From rescue point L i To the disaster site M v The shortest emergency dispatch time, in hours;

[0052] Other parameters:

[0053] n i :Rescue point L i The unit cost of transporting material i, in yuan;

[0054] ρ v : The probability of a secondary accident occurring under the domino effect;

[0055] Initial accident disaster point F f resource requirements;

[0056] Second level accident disaster site M v resource requirements;

[0057] Rescue Point L i For the jth resource R j Storage capacity;

[0058] After the initial accident disaster site resource dispatch, the rescue point L i For the jth resource R j Available quantity;

[0059] Related variables:

[0060] R if :0~1 variable, indicating the rescue point L i To the initial accident disaster point F f Whether resource distribution occurs

[0061] R iv :0~1 variable, indicating the rescue point L i To the secondary accident site M v Whether resource distribution occurs

[0062] Decision variables:

[0063] Rescue Point L i For the disaster site F f The jth resource R j the supply of

[0064] Rescue Point L i For the disaster site Mv The jth resource R j the supply of

[0065] In the present invention, the emergency rescue demand levels of hazardous chemical accidents are divided according to the handling standards of hazardous chemical accidents, and the urgency is divided into four levels, corresponding to Level I (especially serious accidents, red warnings), Level II (serious accidents, orange warnings), Level III (major accidents, yellow warnings), and Level IV (general accidents, blue warnings).

[0066] Assume that the emergency indexes of the initial accident site and the secondary accident site of hazardous chemicals accident are and and All ∈ [1,4], when and The smaller the value, the more serious the accident and the more urgent the rescue needs.

[0067] The urgency of the initial accident-affected point to resource j is:

[0068]

[0069] The urgency of the secondary accident site to resource j is:

[0070]

[0071] The time sequence matrix SP from the rescue point to the disaster point is constructed |L|×|F∪M| Specifically: (1) Set a f represents the resource scheduling plan for the initial accident-affected point f, β v represents the resource scheduling plan for the secondary accident affected site M;

[0072]

[0073] In the matrix, the jth row represents the vector of the jth resource dispatched by each rescue point to the initial accident disaster point f and the secondary accident disaster point v, which is recorded as and The i-th column shows the rescue points L i The resource vector dispatched to the disaster-stricken points f and m. If the vector is 0, it means that the rescue point does not participate in the emergency; let θ = {a1, a 2, …,a |F| ,β1,β2,…,β |M|} T Allocate a network scheduling scheme for emergency resources;

[0074] (2) For any scheduling scheme θ, if a f , β vThe j-th row vector in makes all constraints hold, then the scheduling scheme θ is feasible for the j-th resource. If all scheduling schemes θ are feasible with respect to the jth resource, then scheduling scheme j is called a feasible scheme for resource scheduling;

[0075] (3) For any rescue point in the rescue point set L, the time from the initial accident disaster point f and the secondary accident disaster point v is sorted in ascending order from small to large, and t is recorded as ρc is the shortest time in the time sequence from the rescue point to the disaster site, that is, t 1c is the shortest time, t 2c is the second shortest time, t |L|c is the longest distance; thus constructing a time sorting matrix SP from the rescue point to the disaster point |L|×|F∪M| ,as follows:

[0076]

[0077] Among them, the matrix SP |L|×|F∪M| Each element of SP (ρ,c) =(i ρc, t ρc ) is a tuple, the first item i ρc It represents the rescue point with the shortest distance to the disaster site c. The second term t ρc is the corresponding shortest time.

[0078] The algorithm's principle: Resources are delivered promptly to each disaster site based on the urgency of the rescue needs. By analyzing the resource needs of different disaster sites over time, the order of resource distribution is determined. This minimizes the total cost of transportation.

[0079] In the method, the specific method of scheduling and allocating the emergency resource type R3 to each disaster-affected point c is as follows:

[0080] Step 3.1 Allocate resources to the disaster site according to the following resource supply rules;

[0081] The rescue needs of the initial accident sites will be ranked from the smallest to the largest, with resources allocated first to the most urgent sites. This rule also applies to resource allocation for secondary accident sites.

[0082] Step 3.2 According to the resource supply rule, for each disaster point c, the matrix SP |L|×|F∪M| Get the time sequence vector from c to each rescue point

[0083] {(i 1c ,t 1c ),(i 2c ,t 2c),…,(i |L|c ,t |L|c )} T ;

[0084] Step 3.3 Calculate each rescue point L i The transportation costs to the disaster site c are arranged in ascending order to determine the order of resource supply to the rescue site.

[0085] Step 3.4: Based on the initial accident site with the highest level of urgency in resource needs from step 3.1, the emergency resource quantity required by the site is obtained according to the order of resource supply from the rescue sites from step 3.3 until the rescue needs are met. (If there are initial accident sites with the same level of urgency in rescue needs, the one with the closest distance will be prioritized).

[0086] The emergency resource type R3 is the secondary accident disaster site M v The specific methods for resource scheduling and resource allocation are as follows:

[0087] Step 5.1: For resource R3, after completing the initial resource distribution to the disaster site, update the quantity of R3 resources at each rescue point and distribute them according to the rescue urgency of the secondary accident disaster site.

[0088] Step 5.2 repeats all steps in the "Specific Method for Scheduling and Allocating Emergency Resource Type R to Each Disaster Site c" above until the public emergency resource R3 required by the initial and secondary accident sites is allocated. Steps 3.1 through 3.4, and steps 5.1 through 5.2, are intended to allocate R3 to the initial accident first and then to the secondary accident for resource scheduling and allocation.

[0089] The specific method of scheduling and allocating resources for the emergency resource type R1 to each initial accident disaster point is: for the emergency resource R1 required by the initial accident disaster point, repeat all the steps in the above "the specific method of scheduling and allocating resources for the emergency resource type R to each disaster point c" to obtain the resource allocation plan for R1.

[0090] The specific method of scheduling and allocating resources for the emergency resource type R2 to each secondary accident disaster site is: for the emergency resources R2 required by the secondary accident disaster site, repeat all the steps in the above "the specific method of scheduling and allocating resources for the emergency resource type R to each disaster site c" to obtain the resource allocation plan for R2.

[0091] Finally, the satisfactory plans for dispatching all rescue emergency resources at the initial accident disaster site and the secondary accident disaster site after the hazardous chemicals accident are summarized, and the dispatching is completed.

[0092] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention's description and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for dispatching rescue resources for emergency response to hazardous chemical accidents, characterized by: Hazardous chemical accidents have a domino effect. If a hazardous chemical accident occurs, it will trigger one or more secondary accidents. During the emergency rescue and dispatch process, the resource requirements and dispatch of the initial accident and secondary accidents must be considered simultaneously. The method includes the following steps: Step S1: When a hazardous chemicals incident occurs, the set F = {F f |f=1,2,…|F|} is the set of initial accident-affected points, and the set M={M v |v=1,2,…|M|} is the set of secondary accident affected points. For each initial accident, the probability ρ v A domino effect occurs; the set L = {L i |i=1,2,…|L|} is the emergency resource rescue point; in the emergency state, the types of emergency resources required by the initial accident disaster point F and the secondary accident disaster point M are recorded as R={R j |j=1,2,…j}; Use map software to find the shortest path from each rescue point to the disaster site and determine the shortest rescue time t ic , construct the time order matrix SP from the rescue point to the disaster point |L|×|F∪M| ;t ic From rescue point L i Rescue time to disaster site c, c∈F∪M; Step S2: Classify the emergency rescue demand level of hazardous chemical accidents according to the handling standards of hazardous chemical accidents, and divide the urgency into four levels. Determine the rescue urgency of resource j for initial accidents and secondary accidents according to the disaster level of the affected site; Step S3: Classify the emergency resource types R into three categories: R A , R B , R C , satisfying R = R A ∪R B ∪R C , where R A is the set of emergency resource types required only for the initial accident, R B is the set of emergency resource types required for only level 2 accidents, R C The collection of types of public emergency resources required for both initial and secondary incidents; Step S4: Change the emergency resource type R A , R B , R C According to the resource supply rules and time sorting matrix SP |L|×|F∪M| Allocate resources to each disaster site; the resource supply rule is to meet the needs of the disaster sites in descending order of urgency, with the disaster sites with higher urgency being given priority in resource allocation; Step S5: Check whether the resource requirements of the disaster-stricken site have been dispatched. If all resources have been dispatched, proceed to step S6; otherwise, return to step S3. Step S6: Summarize and obtain the final emergency resource scheduling plan; In the steps S4-S6, emergency resource scheduling is completed through the following model: after an emergency occurs, the primary goal to be met is to minimize the total time of resource scheduling. The total time is: in, Time for initial incident response dispatch; The expected time for dispatching for a Level 2 accident; Resource scheduling should minimize economic costs while meeting the shortest time requirement. Another goal to be met is to minimize the total cost of emergency rescue: in, The total cost of transporting emergency resources to the initial accident site, Costs for transporting emergency resources to the site of a secondary incident; in: d if :Indicates the rescue point L i To the initial accident disaster point F f The shortest path distance; d iv :Indicates the rescue point L i To the secondary accident site M v The shortest path distance; t if :From rescue point L i To the disaster site F f The shortest emergency dispatch time, in hours; t iv :From rescue point L i To the disaster site M v The shortest emergency dispatch time, in hours; n i :Rescue point L i The unit cost of transporting material i, in yuan; ρ v : The probability of a secondary accident occurring under the domino effect; R if :0~1 variable, indicating the rescue point L i To the initial accident disaster point F f Whether resource distribution occurs; R iv :0~1 variable, indicating the rescue point L i To the secondary accident site M v Whether resource distribution occurs; Decision variables: Rescue Point L i For the disaster site F f The jth resource R j the supply of Rescue Point L i For the disaster site M v The jth resource R j supply.

2. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 1, characterized in that: The model satisfies the following constraints: Constraints on the availability of resources at the initial accident site: The dispatch of initial accident emergency resources satisfies the supply and demand balance: The dispatch of secondary accident emergency resources satisfies the supply and demand balance: Resource availability constraints for secondary accident emergency dispatch: When the rescue point provides resources, R if and R iv Take 1, when no resources are provided, R if and R iv Take 0 in: Initial accident disaster point F f resource requirements; Secondary accident disaster site M v resource requirements; Rescue Point L i For the jth resource R j Storage capacity; After the initial accident disaster site resource dispatch, the rescue point L i For the jth resource R j Available quantity.

3. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 2, characterized in that: The emergency rescue demand level of hazardous chemical accidents is divided into four levels according to the handling standards of hazardous chemical accidents, corresponding to Level I, Level II, Level III, and Level IV respectively; Assume that the emergency indexes of the initial accident site and the secondary accident site of hazardous chemicals accident are and and All∈[1,4], when and The smaller the value, the more serious the accident and the more urgent the rescue needs; The urgency of the initial accident-affected point to resource j is: The urgency of the secondary accident site to resource j is:

4. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 1, characterized in that: The time sequence matrix SP from the rescue point to the disaster point is constructed |L|×|F∪M| Specifically: (1) Set a f represents the resource scheduling plan for the initial accident-affected point f, β v represents the resource scheduling plan for the secondary accident affected site M; In the matrix, the jth row represents the vector of the jth resource dispatched by each rescue point to the initial accident disaster point f and the secondary accident disaster point v, which is recorded as and The i-th column shows the rescue points L i The resource vector dispatched to the disaster-stricken points f and m. If the vector is 0, it means that the rescue point does not participate in the emergency; let θ = {a1, a2, ..., a |F| ,β1,β2,…,β |M| } T Allocate a network scheduling scheme for emergency resources; (2) For any scheduling scheme θ, if a f , β v The j-th row vector in makes all constraints hold, then the scheduling scheme θ is feasible for the j-th resource if If the scheduling scheme θ is feasible for the jth resource, then the scheduling scheme θ is called a feasible scheme for resource scheduling; (3) For any rescue point in the rescue point set L, the time from the initial accident disaster point f and the secondary accident disaster point v is sorted in ascending order from small to large, and t is recorded as ρc is the shortest time in the time sequence from the rescue point to the disaster site, that is, t 1c is the shortest time, t 2c is the second shortest time, t |L|c is the longest distance; thus constructing a time sorting matrix SP from the rescue point to the disaster point |L|×|F∪M| ,as follows: Among them, the matrix SP |L|×|F∪M| Each element of SP (ρ,c) =(i ρc ,t ρc ) is a tuple, the first item i ρc It represents the rescue point with the shortest distance to the disaster site c. The second term t ρc is the corresponding shortest time.

5. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 3, characterized in that: The emergency resource type R C The specific method of resource scheduling and allocation for each disaster site c is: Step 3.1 Allocate resources to the disaster site according to the following resource supply rules; The rescue needs of the initial accident disaster sites are ranked from small to large in terms of urgency. The initial accident disaster sites with high urgency will be given priority in resource allocation; The allocation of resources to secondary accident sites also follows this rule; Step 3.2 According to the resource supply rule, for each disaster point c, the matrix SP |L|×|F∪M| Get the time sequence vector from c to each rescue point {(i 1c ,t 1c ),(i 2c ,t 2c ),…,(i |L|c ,t |L|c )} T ; Step 3.3 Obtain each rescue point L i The transportation costs to the disaster site c are arranged in ascending order to determine the order of resource supply to the rescue site; Step 3.4: Based on the initial accident disaster site with the highest urgency of resource demand in step 3.1, obtain the required amount of emergency resources according to the resource supply order of the rescue site in step 3.3 until the rescue demand is met.

6. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 5, characterized in that: The emergency resource type R C The second-level accident site M v The specific methods for resource scheduling and resource allocation are as follows: Step 5.1 for resource type R C After completing the initial resource distribution to the disaster site, the R C The amount of resources will be updated and allocated according to the urgency of rescue efforts at the affected sites of Level 2 accidents and disasters; Step 5.2 Repeat steps 3.2 to 3.3, and obtain the number of emergency resources required by the secondary accident disaster site in the order of the rescue urgency, until the public emergency resources R required by the initial accident disaster site and the secondary accident disaster site are obtained. C Allocation completed.

7. The method for dispatching rescue resources for emergency response to hazardous chemical accidents according to claim 5, characterized in that: The emergency resource type R A The specific method of resource scheduling and allocation for each initial accident disaster site is as follows: the emergency resources R required for the initial accident disaster site A Repeat steps 3.2 to 3.3, and obtain the number of emergency resources required by the initial accident disaster site in the order of the rescue urgency, until the initial accident disaster site needs the resources R A Allocation completed, get R A resource allocation plan; The emergency resource type R B The specific method of resource scheduling and allocation for each secondary accident disaster site is as follows: the emergency resources R required for the secondary accident disaster site B Repeat steps 3.2 to 3.3 to obtain the number of emergency resources required by the secondary accident disaster site in the order of the rescue urgency, until the resources R required by the secondary accident disaster site are B Allocation completed, get R B resource allocation plan; Finally, the final plan for dispatching all rescue emergency resources at the initial accident disaster site and the secondary accident disaster site after the hazardous chemicals accident is summarized, and the dispatch is completed.

Images