Rescue Team Scheduling Method, Device and Equipment Based on Earthquake Rescue Response Circle

Abstract

The present application relates to a method, device, and equipment for dispatching rescue teams based on earthquake rescue response circles. The method comprises: parsing an earthquake rescue mission to obtain an earthquake rescue response circle, a target to be rescued, and candidate rescue teams; determining the rescue team from the candidate rescue teams that will participate in the earthquake rescue mission based on the distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued; constructing a rescue cost index based on the distance between the rescue team and the target to be rescued, the capability satisfaction, and the urgency of the target to be rescued; using a clustering method to obtain an initial target to be rescued allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index; constructing a rescue team dispatching model based on the rescue cost index; optimizing the initial target to be rescued allocation plan based on the rescue team dispatching model to obtain an optimal rescue team dispatching plan. This method enables effective rescue team dispatching and efficient execution of earthquake rescue missions.

Description

Technical Field

[0001] The present application relates to the technical field of resource scheduling, and in particular to a rescue team scheduling method, device and equipment based on an earthquake rescue response circle. Background Art

[0002] Earthquakes, as a typical unconventional emergency, are difficult to predict and prevent, and therefore pose a significant threat to the safety of life and property. After an earthquake, scientifically dispatching rescue teams and assigning rescue routes can effectively ensure the smooth progress of rescue efforts and play a vital role in mitigating loss of life and property.

[0003] However, the traditional rescue team dispatching method has problems such as inaccurate rescue, low efficiency and poor emergency response when applied in actual situations. Summary of the Invention

[0004] Based on this, it is necessary to provide a rescue team dispatching method, device, computer equipment and storage medium based on earthquake rescue response circle to address the above technical problems.

[0005] A rescue team dispatching method based on an earthquake rescue response circle, the method comprising:

[0006] Parsing a preset earthquake rescue mission to obtain an earthquake rescue response circle for the earthquake rescue mission and a target to be rescued and a candidate rescue team in the earthquake rescue response circle;

[0007] Determining a rescue team from the candidate rescue teams to participate in the earthquake rescue mission based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued;

[0008] A rescue cost index is constructed based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued. A clustering method is used to obtain an initial target allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued;

[0009] A rescue team scheduling model is constructed based on the rescue cost index, and the initial target allocation plan for rescue is optimized according to the rescue team scheduling model to obtain an optimal rescue team scheduling plan.

[0010] In one embodiment, the method further includes: obtaining the location of the target to be rescued and the location of the rescue team, planning a rescue path for each rescue team based on the actual road network after the earthquake, and obtaining the distance between the target to be rescued and the rescue team on the rescue path based on the rescue path of each rescue team.

[0011] In one embodiment, the method further includes: calculating the rescue team's capability satisfaction relative to the rescue target based on the rescue capability required by the target to be rescued and the capability possessed by the rescue team:

[0012]

[0013] Among them, s ij represents the ability satisfaction of rescue team i relative to rescue target j, c represents the total number of capabilities required by the rescue target, w jk N represents the importance of capability k to rescue target j, jk The index value of the capability k required by the rescue target j, n ik The index value representing the capability k possessed by rescue team i.

[0014] In one of the embodiments, it further includes: determining the urgency of rescuing the target to be rescued based on the post-earthquake scenario of the target to be rescued; the post-earthquake scenario of the target to be rescued includes the degree of damage to the target to be rescued after the earthquake, the degree of threat to the target to be rescued from secondary disasters and secondary collapse of buildings, and the importance factor of the target to be rescued.

[0015] In one embodiment, the method further includes: constructing a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued:

[0016] I ij =w1×d′ ij +w2×s′ ij +w3×e′ j

[0017] Among them, I ij represents the rescue cost index of rescue team i relative to rescue target j, d′ ij represents the normalized distance, s′ ij represents the normalized ability satisfaction, e′ j represents the normalized urgency of rescue, w1 represents the influence weight of distance on the rescue cost index, w2 represents the influence weight of capability satisfaction on the rescue cost index, and w3 represents the influence weight of the urgency of rescue of the target to be rescued on the rescue cost index.

[0018] In one embodiment, it also includes: using a clustering method to classify the targets to be rescued according to the distance between the rescue team and the targets to be rescued, and the number of classification categories is the number of rescue teams; traversing each category of targets to be rescued in turn, and calculating the average cost of the rescue team rescuing each category of targets to be rescued according to the rescue cost index to obtain an average cost matrix; according to the average cost of the same target to be rescued category and different rescue teams in the average cost matrix, obtaining the average cost range of each target to be rescued category, and finding the target to be rescued category corresponding to the maximum average cost range; according to the minimum average cost of each rescue team rescuing the target to be rescued category corresponding to the maximum average cost range in the average cost matrix, assigning the rescue team corresponding to the minimum average cost to the target to be rescued category corresponding to the minimum average cost, and deleting the element corresponding to the minimum average cost in the average cost matrix and the maximum average cost range, repeating the above steps, and obtaining the initial target to be rescued allocation plan after the allocation is completed.

[0019] In one embodiment, the method further includes: traversing each rescue team in turn according to the initial allocation plan of the target to be rescued, traversing each rescue team in turn using the nearest neighbor method to obtain the rescue route of each rescue team, and calculating the average cost spent by each rescue team on the rescue route; obtaining a rescue efficiency index according to the maximum average cost of each rescue team, and caching the allocation plan of the target to be rescued and the rescue route of each rescue team; sorting the rescue teams according to the average cost of each rescue team, traversing the sorted rescue teams, assigning the target to be rescued that was last rescued in the rescue route of the rescue team corresponding to the rescue efficiency index to the currently traversed rescue team, and updating the average cost of the currently traversed rescue team after assigning the target to be rescued to obtain a new average cost; when the new average cost is greater than or equal to the rescue efficiency index, continuing to iteratively traverse the next rescue team, and when the new average cost is less than the rescue efficiency index, returning to the step after calculating the average cost spent by each rescue team on the rescue route, until a preset iteration termination condition is met, outputting the cached allocation plan of the target to be rescued and the rescue route of each rescue team as the optimal rescue team scheduling plan.

[0020] In one of the embodiments, it also includes: obtaining a preliminary screening result based on a pre-set distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued, and the earthquake rescue expert group determines the rescue team participating in the earthquake rescue mission from the candidate rescue teams based on the preliminary screening result.

[0021] A rescue team dispatching device based on an earthquake rescue response circle, the device comprising:

[0022] A task parsing module is used to parse a preset earthquake rescue task, obtain an earthquake rescue response circle for the earthquake rescue task, and targets to be rescued and candidate rescue teams in the earthquake rescue response circle;

[0023] A rescue team screening module is used to determine a rescue team that can participate in the earthquake rescue mission from among the candidate rescue teams based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued;

[0024] A preliminary allocation module is configured to construct a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued, and to obtain an initial target allocation plan using a clustering method based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued;

[0025] The rescue team scheduling module is used to construct a rescue team scheduling model based on the rescue cost index, optimize the initial rescue target allocation plan according to the rescue team scheduling model, and obtain the optimal rescue team scheduling plan.

[0026] A computer device includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0027] Parsing a preset earthquake rescue mission to obtain an earthquake rescue response circle for the earthquake rescue mission and a target to be rescued and a candidate rescue team in the earthquake rescue response circle;

[0028] Determining a rescue team from the candidate rescue teams to participate in the earthquake rescue mission based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued;

[0029] A rescue cost index is constructed based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued. A clustering method is used to obtain an initial target allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued;

[0030] A rescue team scheduling model is constructed based on the rescue cost index, and the initial target allocation plan for rescue is optimized according to the rescue team scheduling model to obtain an optimal rescue team scheduling plan.

[0031] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the following steps:

[0032] Parsing a preset earthquake rescue mission to obtain an earthquake rescue response circle for the earthquake rescue mission and a target to be rescued and a candidate rescue team in the earthquake rescue response circle;

[0033] Determining a rescue team from the candidate rescue teams to participate in the earthquake rescue mission based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued;

[0034] A rescue cost index is constructed based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued. A clustering method is used to obtain an initial target allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued;

[0035] A rescue team scheduling model is constructed based on the rescue cost index, and the initial target allocation plan for rescue is optimized according to the rescue team scheduling model to obtain an optimal rescue team scheduling plan.

[0036] The above-mentioned rescue team scheduling method, device, computer equipment, and storage medium based on the earthquake rescue response circle ensure the timeliness of rescue by demarcating the earthquake rescue response circle, and determine the rescue teams participating in the rescue based on the earthquake rescue response circle and the capabilities of the rescue teams, so as to match the rescue forces in the earthquake rescue with the capabilities required by the targets to be rescued, thereby achieving accurate and efficient rescue. By constructing a rescue cost index, the rescue forces are ensured to achieve the maximum rescue effect. The clustering method and the constructed rescue cost index are used to form an initial allocation plan for the targets to be rescued. Finally, the initial allocation plan for the targets to be rescued is input into the rescue team scheduling model constructed based on the rescue cost index, and the rescue team scheduling model is optimized and solved to obtain a rescue team scheduling plan. The embodiments of the present invention can realize the accurate selection of rescue teams and the reasonable planning of rescue team scheduling routes based on the real-time earthquake rescue response circle at the time of the earthquake, so as to efficiently perform earthquake rescue tasks. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 1 is a flow chart of a method for dispatching a rescue team based on an earthquake rescue response circle in one embodiment;

[0038] Figure 2 A schematic diagram of an initial rescue team dispatching scheme in a specific embodiment;

[0039] Figure 3 A schematic diagram of an optimal rescue team dispatching solution in a specific embodiment;

[0040] Figure 4 is a structural block diagram of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0041] Figure 5 is a structural block diagram of a rescue team dispatching device based on an earthquake rescue response circle in a specific embodiment;

[0042] Figure 6 A schematic flow chart of a basic data entry submodule and a post-earthquake scene editing submodule of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0043] Figure 7 A schematic flow chart of a path planning submodule of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0044] Figure 8 1. A schematic diagram of a flow chart of a target-to-be-rescued assessment submodule of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0045] Figure 9 A schematic diagram of a rescue team recommendation submodule flow chart of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0046] Figure 10 A schematic flow chart of a capability assessment submodule of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0047] Figure 11 A schematic diagram of a target allocation submodule flow chart of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0048] Figure 12 1. A schematic diagram of a flow chart of a rescue team dispatching module of a rescue team dispatching device based on an earthquake rescue response circle in one embodiment;

[0049] Figure 13 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0050] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0051] In one embodiment, Figure 1 As shown, a rescue team dispatching method based on an earthquake rescue response circle is provided, comprising the following steps:

[0052] Step 102 , parsing the preset earthquake rescue mission, obtaining the earthquake rescue response circle in which the earthquake rescue mission is carried out, and the targets to be rescued and candidate rescue teams in the earthquake rescue response circle.

[0053] After an earthquake occurs, the earthquake disaster is uncontrollable. By demarcating the earthquake rescue response circle in real time, the scope of the earthquake disaster and the trend of earthquake occurrence can be grasped in real time. The earthquake rescue response circle refers to the real-time response to earthquake rescue tasks by multiple rescue centers within the earthquake disaster area. For example, after the disaster target is clearly defined, the rescue team is required to reach the disaster target within a specified time. By demarcating the earthquake rescue response circle, it can be guaranteed that the rescue team can reach the disaster target within the specified time, ensuring the timeliness of the rescue. The rescue team refers to a rescue team with certain mechanical equipment and building rubble processing capabilities. The target to be rescued refers to the buried people trapped in the building rubble. In the embodiment of the present invention, the location of the target to be rescued is the location of the building rubble.

[0054] Step 104 , determining a rescue team that participates in the earthquake rescue mission from among the candidate rescue teams based on the preset distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued.

[0055] The distance constraint refers to the distance between the last two points of interest along the route from the rescue team to the target. The distance constraint is set based on the golden 72 hours of earthquake rescue. If the distance between the two points of interest does not meet the distance constraint, effective rescue cannot be achieved. The capability constraint refers to the matching of the capabilities required by the target with the capabilities possessed by the rescue team. For example, if the target is trapped in a reinforced concrete building, the rescue team needs to have drilling equipment to facilitate the effective rescue mission.

[0056] Step 106, constructing a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued, and using a clustering method to obtain an initial target allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued.

[0057] The rescue cost index is used to evaluate the cost required for the rescue team to carry out rescue operations on the rescue target. The larger the rescue cost index, the more difficult it is for the rescue team to carry out the rescue operation, the longer the rescue time, and the lower the rescue effectiveness. The clustering method can quickly and efficiently allocate the targets to be rescued. The initial allocation plan for the targets to be rescued refers to the plan formed by initially allocating each target to be rescued to the rescue team.

[0058] Step 108: construct a rescue team scheduling model based on the rescue cost index, optimize the initial rescue target allocation plan according to the rescue team scheduling model, and obtain the optimal rescue team scheduling plan.

[0059] The rescue team scheduling plan includes the allocation plan of the targets to be rescued and the rescue route of the rescue team. The rescue route of the rescue team uses the corresponding allocated targets to be rescued as nodes. When optimizing the rescue team scheduling model, the rescue route is planned according to the planned rescue order.

[0060] In the above-mentioned rescue team scheduling method based on the earthquake rescue response circle, the timeliness of the rescue is ensured by using a pre-defined earthquake rescue response circle. The rescue teams participating in the rescue are determined based on the earthquake rescue response circle and the capabilities of the rescue teams, so as to match the capabilities required by the rescue targets during the earthquake rescue with those required by the rescue targets, thereby achieving accurate and efficient rescue. The rescue cost index is constructed to ensure that the rescue forces can achieve the maximum rescue effect. The clustering method and the constructed rescue cost index are used to form an initial allocation plan for the rescue targets. Finally, the initial allocation plan for the rescue targets is input into the rescue team scheduling model constructed based on the rescue cost index, and the rescue team scheduling model is optimized and solved to obtain the rescue team scheduling plan. This embodiment of the present invention can accurately select rescue teams and rationally plan rescue team scheduling routes based on the real-time earthquake rescue response circle at the time of the earthquake, so as to efficiently execute earthquake rescue tasks.

[0061] In one embodiment, the step of obtaining the distance between the rescue team and the target to be rescued includes: obtaining the position of the target to be rescued and the position of the rescue team, planning the rescue path of each rescue team according to the actual road network after the earthquake, and obtaining the distance between the target to be rescued and the rescue team on the rescue path according to the rescue path of each rescue team.

[0062] Specifically, the statistical distance is normalized to obtain the normalized distance:

[0063]

[0064] Among them, d max Indicates the maximum distance calculated, d min Indicates the minimum distance calculated, d ij Represents the distance from interest point i to interest point j, d′ ij Represents the normalized distance from point of interest i to point of interest j. Based on the imported basic road network data and the post-earthquake road network damage data superimposed on the basic road network data to obtain the post-earthquake road network data, the paths between the points of interest are planned based on the post-earthquake road network data, and the path planning results are output.

[0065] In this implementation, point of interest i represents the rescue team, point of interest j represents the target to be rescued, and based on the planned rescue route of the rescue team, when the rescue team heads to the next target to be rescued, the position of the rescue team is the position of the currently rescued target.

[0066] In one embodiment, the step of obtaining the capability constraint required by the target to be rescued includes: calculating the capability satisfaction of the rescue team relative to the target to be rescued based on the rescue capability required by the target to be rescued and the capability possessed by the rescue team:

[0067]

[0068] Among them, s ij represents the ability satisfaction of rescue team i relative to rescue target j, c represents the total ability required by the rescue target, w jk N represents the importance of capability k to rescue target j, jk The index value of the capability k required by the rescue target j, n ik The index value represents the capability k possessed by rescue team i. Assessing the required capability k of the target to be rescued refers to assessing the required capability of the target to be rescued based on the target's damage and the threat of secondary disasters.

[0069] In one embodiment, the step of obtaining the degree of urgency of the rescue of the target to be rescued includes: determining the degree of urgency of the rescue of the target to be rescued based on the post-earthquake scene of the target to be rescued. In this embodiment, the post-earthquake scene of the target to be rescued includes the degree of damage to the target to be rescued after the earthquake, the degree of threat to the target to be rescued from secondary disasters and secondary building collapse, and the importance factor of the target to be rescued. After determining the degree of urgency of the rescue of the target to be rescued, it is normalized, specifically as follows:

[0070]

[0071] Among them, e max Indicates the maximum rescue urgency of the target to be rescued, e min Indicates the minimum urgency of the rescue target. j Indicates the urgency of rescue of target j, e′ j represents the normalized urgency of rescue for target j. The more important the target, the more severely affected it is, and the greater the threat posed by secondary disasters, the greater the urgency of the target's rescue. Assessing the extent of post-earthquake damage refers to evaluating the target's damage based on the post-earthquake scene at the affected site. It should be noted that the target's damage includes information such as the time and difficulty for the rescue team to rescue the affected target. Assessing the importance of the target refers to determining its importance based on its attributes. For example, if the target is a public service provider such as a hospital, school, large supermarket, gas station, power station, water station, airport, train station, or bus station, the target's importance is relatively high. Assessing the threat posed by secondary disasters refers to determining the target's threat posed by secondary disasters based on the post-earthquake scene at the affected site.

[0072] In one embodiment, constructing a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the rescue target, and the urgency of the target to be rescued includes: constructing the rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the rescue target, and the urgency of the target to be rescued is:

[0073] I ij =w1×d′ ij +w2×s′ ij +w3×e′ j

[0074] Among them, I ij represents the rescue cost index of rescue team i relative to rescue target j, d′ ij represents the normalized distance, s′ ij represents the normalized ability satisfaction, e′ j represents the normalized urgency of rescue, w1 represents the influence weight of distance on the rescue cost index, w2 represents the influence weight of capability satisfaction on the rescue cost index, and w3 represents the influence weight of the urgency of rescue of the target to be rescued on the rescue cost index.

[0075] In one embodiment, a clustering method is used to obtain an initial target allocation plan based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued, including: using a clustering method to classify the target to be rescued according to the distance between the rescue team and the target to be rescued, and the number of classification categories is the number of rescue teams; traversing each category of targets to be rescued in turn, and calculating the average cost of the rescue team rescuing each category of targets to be rescued according to the rescue cost index to obtain an average cost matrix; according to the average cost of the same target category to be rescued and different rescue teams in the average cost matrix, obtaining the average cost range of each target category to be rescued, and finding the target category to be rescued corresponding to the maximum average cost range; according to the minimum average cost of each rescue team rescuing the target category corresponding to the maximum average cost range in the average cost matrix, assigning the rescue team corresponding to the minimum average cost to the target category to be rescued corresponding to the minimum average cost, and deleting the element corresponding to the minimum average cost in the average cost matrix and the maximum average cost range, repeating the above steps, and obtaining the initial target allocation plan after the allocation is completed.

[0076] In this embodiment, the rescue targets are classified based on the determined rescue targets, and the classified targets are sequentially assigned to rescue teams, with each rescue team assigned to one type of rescue target, and an initial rescue target allocation plan is output. The steps for obtaining the initial rescue target allocation plan specifically include:

[0077] S10: Use the KMeans method to divide the rescue targets into L categories, where L represents the number of rescue teams.

[0078] S11: Traverse each category of rescue targets in turn and calculate the average cost of the rescue team rescuing the category of rescue targets, specifically:

[0079]

[0080] in, represents the average cost of the target to be rescued in rescue category l by rescue team i, L k represents the set of targets to be rescued of category l, m l Represents the number of targets to be rescued in category l. Average cost matrix Composed of average cost.

[0081] S12: Yes The maximum and minimum values are counted by column, and the average cost range is obtained based on the difference between the maximum and minimum values, which is recorded as in, It represents the average cost of the rescue team to rescue the target of category l.

[0082] S13: Find out The maximum value in (assuming ),go Find the minimum value in the lth column (assuming that ), initially assign the rescue targets of category l to rescue team i. Delete The i-th row and l-th column and

[0083] S14: Repeat step S13 for the remaining unassigned rescue teams and categories of targets to be rescued until all rescue teams and targets to be rescued are assigned, and an initial allocation plan for targets to be rescued is obtained.

[0084] In one embodiment, the steps of optimizing the allocation of rescue targets according to the rescue team scheduling model to obtain the optimal rescue team scheduling plan include: traversing each rescue team in sequence according to the initial allocation of rescue targets, traversing each rescue team in sequence using the nearest neighbor method to obtain a rescue route for each rescue team, and calculating the average cost incurred by each rescue team on the rescue route; obtaining a rescue efficiency index based on the maximum average cost among the average costs of each rescue team, and caching the allocation of rescue targets and the rescue route for each rescue team; sorting the rescue teams according to the average cost of each rescue team, traversing the sorted rescue teams, assigning the last rescue target in the rescue route of the rescue team corresponding to the rescue efficiency index to the currently traversed rescue team, and updating the average cost of the currently traversed rescue team after the allocation of the target to be rescued to obtain a new average cost; when the new average cost is greater than or equal to the rescue efficiency index, iterating to traverse the next rescue team; and when the new average cost is less than the rescue efficiency index, returning to the step after calculating the average cost incurred by each rescue team on the rescue route, until a preset iteration termination condition is satisfied, outputting the cached allocation of rescue targets and the rescue route of each rescue team as the optimal rescue team scheduling plan.

[0085] In this embodiment, based on the initial target allocation plan, path planning, capability matching calculation, and rescue urgency calculation are performed. The cost of the rescue team's target is calculated based on the path planning results, capability matching results, and rescue urgency results. A rescue team scheduling model is constructed based on the initial target allocation plan, and the optimal rescue team scheduling plan is derived based on the output of the rescue team scheduling model. The specific steps for obtaining the optimal rescue team scheduling plan include:

[0086] S20: After obtaining the initial allocation plan for the target to be rescued, traverse each rescue team in turn, take the rescue team as the starting point, and use the neighbor point method in the process construction method based on the rescue cost index to plan the rescue route of the rescue team and the average cost of the rescue.

[0087] S21: Count the maximum cost among the average costs of all rescue teams and get the rescue efficiency index, which is recorded as And cache the current rescue target allocation plan and rescue route.

[0088] S22: Sort the rescue teams according to the average cost incurred by the rescue teams.

[0089] S23: traverse the sorted rescue teams, take out the last target to be rescued in the rescue route of the rescue team corresponding to the rescue efficiency index and assign it to the rescue team currently traversed, and use the neighbor point method in the process construction method to calculate the rescue route of the rescue team, and obtain the new average cost of the rescue team, which is recorded as

[0090] S24: If Greater than or equal to Then continue the iterative procedure of S23. Less than , then enter S21. If all rescue teams in S23 are iterated, Are greater than or equal to The algorithm ends and the target allocation plan and rescue route cached in S21 are taken out as the scheduling plan.

[0091] Furthermore, a rescue team dispatch plan is generated based on the calculation results of the rescue team dispatch model.

[0092] In one embodiment, based on a preset distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued, determining the rescue team that will participate in the earthquake rescue mission from among the candidate rescue teams includes: obtaining a preliminary screening result based on the preset distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued, and an earthquake rescue expert group determining the rescue team that will participate in the earthquake rescue mission from among the candidate rescue teams based on the preliminary screening result. In this embodiment, preliminary screening results for rescue team recommendations are obtained based on the path planning results and the capability required by the target to be rescued. Specifically, an earthquake rescue response circle is determined, and a composite screening is performed on the above two conditions. Alternatively, the rescue team that meets the requirements can be screened out based on the path planning results, or based on the capability data required by the target to be rescued.

[0093] In a specific embodiment, Figure 2 As shown in the figure, a schematic diagram of the initial rescue team dispatch scheme is provided. Figure 3 As shown, a schematic diagram of an optimal rescue team scheduling scheme is provided. According to the earthquake rescue mission, 28 targets to be rescued are obtained through analysis, and 3 rescue teams are obtained through screening. At the same time, based on the location information of the targets to be rescued and the rescue teams, the method of the present invention is used to generate an initial rescue team scheduling scheme. Rescue team 1 rescues 13 targets at a cost of 6.694; rescue team 2 rescues 5 targets at a cost of 2.133; rescue team 3 rescues 10 targets at a cost of 5.543. In order to maximize the utilization of the rescue teams and carry out rescue operations, it is necessary to further optimize the initial rescue team scheduling scheme. The optimal rescue team scheduling scheme obtained by optimization is as follows: rescue team 1 rescues 9 targets at a cost of 4.344; rescue team 2 rescues 11 targets at a cost of 4.579; rescue team 3 rescues 8 targets at a cost of 4.333, as shown in the following table:

[0094] Rescue team dispatch plan

[0095]

[0096] It should be understood that although Figure 1 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. In addition, Figure 1 At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least part of the sub-steps or stages of other steps.

[0097] In one embodiment, Figure 4 As shown, a rescue team dispatching device based on an earthquake rescue response circle is provided, comprising: a task parsing module 402, a rescue team screening module 404, a preliminary allocation module 406 and a rescue team dispatching module 408, wherein:

[0098] The task parsing module 402 is used to parse the preset earthquake rescue task, obtain the earthquake rescue response circle carried out by the earthquake rescue task, and the target to be rescued and the candidate rescue team in the earthquake rescue response circle;

[0099] The rescue team screening module 404 is used to determine the rescue team that can participate in the earthquake rescue mission from the candidate rescue teams according to the preset distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued;

[0100] The initial allocation module 406 is configured to construct a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued. The initial allocation plan for the target to be rescued is obtained by using a clustering method based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued.

[0101] The rescue team scheduling module 408 is used to build a rescue team scheduling model based on the rescue cost index, optimize the initial rescue target allocation plan according to the rescue team scheduling model, and obtain the optimal rescue team scheduling plan.

[0102] In one embodiment, the rescue team screening module 404 is further used to obtain the location of the target to be rescued and the location of the rescue team, plan the rescue path of each rescue team according to the actual road network after the earthquake, and obtain the distance between the target to be rescued and the rescue team on the rescue path according to the rescue path of each rescue team.

[0103] In one embodiment, the rescue team screening module 404 is further configured to calculate the rescue team's capability satisfaction relative to the rescue target based on the rescue capability required by the target to be rescued and the capability possessed by the rescue team:

[0104]

[0105] Among them, s ij represents the ability satisfaction of rescue team i relative to rescue target j, c represents the total number of capabilities required by the rescue target, w jk N represents the importance of capability k to rescue target j, jk The index value of the capability k required by the rescue target j, n ik The index value representing the capability k possessed by rescue team i.

[0106] In one embodiment, the preliminary allocation module 406 is further used to determine the urgency of the rescue of the target to be rescued based on the post-earthquake scenario of the target to be rescued; the post-earthquake scenario of the target to be rescued includes the degree of damage to the target to be rescued after the earthquake, the degree of threat to the target to be rescued from secondary disasters and secondary collapse of buildings, and the importance factor of the target to be rescued.

[0107] In one embodiment, the preliminary allocation module 406 is further configured to construct a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued:

[0108] I ij =w1×d′ ij +w2×s′ ij +w3×e′ j

[0109] Among them, I ij represents the rescue cost index of rescue team i relative to rescue target j, d′ ij represents the normalized distance, s′ ij represents the normalized ability satisfaction, e′ j represents the normalized urgency of rescue, w1 represents the influence weight of distance on the rescue cost index, w2 represents the influence weight of capability satisfaction on the rescue cost index, and w3 represents the influence weight of the urgency of rescue of the target to be rescued on the rescue cost index.

[0110] In one embodiment, the preliminary allocation module 406 is also used to adopt a clustering method to classify the targets to be rescued according to the distance between the rescue team and the target to be rescued, and the number of classification categories is the number of rescue teams; traverse each category of targets to be rescued in turn, and calculate the average cost of the rescue team rescuing each category of targets to be rescued according to the rescue cost index to obtain an average cost matrix; according to the average cost of the same target to be rescued category and different rescue teams in the average cost matrix, obtain the average cost range of each target to be rescued category, and find the target to be rescued category corresponding to the maximum average cost range; according to the minimum average cost of each rescue team rescuing the target to be rescued category corresponding to the maximum average cost range in the average cost matrix, assign the rescue team corresponding to the minimum average cost to the target to be rescued category corresponding to the minimum average cost, and delete the element corresponding to the minimum average cost in the average cost matrix and the maximum average cost range, repeat the above steps, and obtain the initial target to be rescued allocation plan after the allocation is completed.

[0111] In one embodiment, the rescue team scheduling module 408 is further used to traverse each rescue team in turn according to the initial allocation plan of the target to be rescued, traverse each rescue team in turn using the nearest neighbor method, obtain the rescue route of each rescue team, and calculate the average cost spent by each rescue team on the rescue route; obtain the rescue efficiency index according to the maximum average cost of each rescue team, cache the allocation plan of the target to be rescued and the rescue route of each rescue team; sort the rescue teams according to the average cost of each rescue team, traverse the sorted rescue teams, assign the target to be rescued last rescued in the rescue route of the rescue team corresponding to the rescue efficiency index to the currently traversed rescue team, and update the average cost of the currently traversed rescue team after the allocation of the target to be rescued to obtain a new average price; when the new average price is greater than or equal to the rescue efficiency index, continue to iterate the next rescue team, and when the new average price is less than the rescue efficiency index, return to the step after calculating the average cost spent by each rescue team on the rescue route, until a preset iteration termination condition is met, and output the cached allocation plan of the target to be rescued and the rescue route of each rescue team as the optimal rescue team scheduling plan.

[0112] In one embodiment, the rescue team screening module 404 is also used to obtain preliminary screening results based on the pre-set distance constraints between the rescue target and the rescue team and the capability constraints required by the target to be rescued. The earthquake rescue expert team determines the rescue team participating in the earthquake rescue mission from the candidate rescue teams based on the preliminary screening results.

[0113] In one specific embodiment, Figure 5As shown, a structural block diagram of a rescue team dispatching device based on an earthquake rescue response circle is provided, which includes a basic data entry submodule, a post-earthquake scene editing submodule, a path planning submodule, a target assessment submodule, a rescue team recommendation submodule, a capability assessment submodule, a target allocation submodule, and a rescue team dispatching module;

[0114] The basic data entry submodule is used to enter rescue team information, capability standard data, and road network data; rescue team information includes the name, location, and capability of the rescue team; the data entered in the basic data entry submodule can be stored in a relational database;

[0115] The post-earthquake scene editing submodule is used to input post-earthquake scene information. Post-earthquake scene information includes road network damage information and disaster information of rescue targets. The information source can come from local government or public reports, detection data or remote sensing data. The data input by the post-earthquake scene editing submodule can be stored in a relational database.

[0116] The path planning submodule is used to plan the rescue path for each rescue team based on the actual road network after the earthquake;

[0117] The rescue target assessment submodule is used by the earthquake rescue expert team to determine the rescue targets based on the post-earthquake scene, importance, threat level of secondary disasters and secondary building collapse of the disaster site, and to assess the urgency of the rescue and the required rescue capabilities of the targets;

[0118] The rescue team recommendation submodule is used to determine the rescue team that meets the requirements based on the earthquake rescue response circle and the rescue capabilities required by the rescue target;

[0119] The capability assessment submodule is used to calculate the capability satisfaction of each rescue team relative to each target to be rescued based on the rescue capability required by the target to be rescued and the capability of the rescue team;

[0120] The target allocation submodule is used to preliminarily allocate all the targets to be rescued to the rescue teams based on the post-earthquake road network and the distance between the rescue teams and the targets to be rescued, thus forming an initial target allocation plan;

[0121] The rescue team scheduling module is used to construct a rescue team scheduling model based on the initial rescue target allocation plan taking into account the rescue cost index, and solve the rescue team scheduling model to generate a rescue team scheduling plan.

[0122] Among them, the task analysis module 402 includes a basic data entry submodule and a post-earthquake scene editing submodule, the rescue team screening module 404 includes a path planning submodule, a rescue target assessment submodule and a rescue team recommendation submodule, and the preliminary allocation module 406 includes a path planning submodule, a capability assessment submodule and a target allocation submodule.

[0123] In one embodiment, Figure 6 As shown, a flowchart of the basic data entry submodule and post-earthquake scene editing submodule of a rescue team dispatching device based on an earthquake rescue response circle is provided. The basic data entry submodule includes a basic data entry stage, a basic data editing stage and a basic data storage stage. The basic data entry stage: inputs rescue team information, capability standard data, and road network data. The data can be read from other databases, files or services, or manually entered. The data source can come from the local statistics bureau or intelligence collection; the basic data editing stage: edits the rescue team information, capability standard data, and road network data that have been imported or manually entered, including modification and deletion operations; the basic data storage stage: stores the entered and edited rescue team information, capability standard data, and road network data in a relational database. The post-earthquake scene editing submodule includes the disaster data entry stage, the disaster data editing stage and the disaster data storage stage. The disaster data entry stage: import or enter the post-earthquake scene and road network damage information of the disaster-stricken point. The data can be read from other databases, files or services, or entered manually. The data source can come from local government or public reporting data, detection data and remote sensing data to enter road network damage information and disaster information of rescue targets; Disaster data editing stage: edit the post-earthquake scene and road network damage information of the disaster-stricken point that has been imported or entered, including modification and deletion operations; Disaster data storage stage: store the entered and edited post-earthquake scene and road network damage information of the disaster-stricken point into a relational database.

[0124] In one embodiment, Figure 7 The figure shows a flow chart of the path planning submodule of a rescue team dispatching device based on an earthquake rescue response circle. The path planning submodule includes a post-earthquake road network data import phase, a path planning phase, and a path planning result output phase. The post-earthquake road network data import phase imports basic road network data and overlays post-earthquake road network damage data on top of the basic road network data; the path planning phase plans paths between points of interest (rescue teams and targets to be rescued) and calculates distances; the path planning result output phase outputs the planned path planning results.

[0125] In one embodiment, Figure 8As shown, a flowchart of the target assessment submodule of a rescue team dispatch device based on an earthquake rescue response circle is provided. The target assessment module includes a target importance assessment stage, a target damage assessment stage, a secondary disaster threat assessment stage, a target rescue urgency assessment stage, and a target required capability assessment stage. The target importance assessment stage determines the target importance based on the target's own attributes. For example, if the target is a hospital, school, large supermarket, gas station, power station, water station, airport, railway station, bus station, or other place providing public services, the target importance is relatively high. The target damage assessment stage assesses the target damage based on the post-earthquake scene of the disaster site. It should be noted that the target damage includes information such as the time and difficulty of the rescue team rescuing the disaster site. The secondary disaster threat assessment stage determines the target's secondary disaster threat based on the post-earthquake scene of the disaster site. The target rescue urgency assessment stage assesses the target's rescue urgency based on the target's importance, damage, and secondary disaster threat. The more important the target, the more serious the disaster, and the greater the threat of secondary disasters, the more urgent the rescue of the target; Assessment stage of capabilities required for the target to be rescued: Based on the disaster situation of the target and the threat of secondary disasters, the capabilities required for the target to be rescued are assessed.

[0126] In one embodiment, Figure 9 The figure shows a flowchart of the rescue team recommendation submodule of a rescue team dispatching device based on an earthquake rescue response circle. The rescue team recommendation submodule includes a path planning result importing stage, a target capability data importing stage, and a rescue team screening stage. The path planning result importing stage imports the output of the path planning submodule; the target capability data importing stage imports the output of the target assessment submodule; the rescue team screening stage determines the earthquake rescue response circle and selects rescue teams that meet the requirements based on the path planning results. Alternatively, the rescue teams can be selected based on the target capability data. Furthermore, a combined screening process based on these two criteria can be performed.

[0127] In one embodiment, Figure 10 The figure shows a flow chart of the capability assessment submodule of a rescue team dispatching device based on an earthquake rescue response circle. The capability assessment submodule includes the target import phase, the selected rescue team import phase, and the capability satisfaction calculation phase. The target import phase imports the identified target; the selected rescue team import phase imports the output of the rescue team recommendation submodule; and the capability satisfaction calculation phase calculates the capability satisfaction of the rescue team relative to the target based on the target's required capabilities and the rescue team's existing capabilities.

[0128] In one embodiment, Figure 11The figure shows a flow chart of the target allocation submodule of a rescue team dispatching device based on an earthquake rescue response circle. The target allocation submodule includes: a target importing stage, a target classification stage, a target allocation stage, and an initial target allocation plan output stage. The target importing stage imports the identified targets. The target classification stage uses the KMeans method to classify the targets into L categories based on path planning results, where L is the number of rescue teams. The target allocation stage sequentially assigns the classified targets to the rescue teams, with each rescue team assigned one target category. The initial target allocation plan output stage outputs the initial target allocation plan.

[0129] In one embodiment, Figure 12 As shown, a flowchart of the rescue team scheduling module of a rescue team scheduling device based on an earthquake rescue response circle is provided. The rescue team scheduling module includes the initial target allocation plan importing stage, the path planning result importing stage, the capability matching importing stage, the target urgency importing stage, the rescue team scheduling model construction stage, and the optimal rescue team scheduling plan outputting stage. The initial target allocation plan importing stage imports the initial target allocation plan output by the target allocation submodule; the path planning result importing stage imports the path planning result output by the path planning submodule; the capability matching importing stage imports the capability assessment result output by the capability assessment submodule; the target urgency importing stage imports the target urgency data output by the target assessment submodule; the rescue team scheduling model construction stage calculates the cost of the rescue team's target based on the path planning results, capability matching results, and target urgency results, and constructs a rescue team scheduling model based on the initial target allocation plan; and the optimal rescue team scheduling plan outputting stage derives the optimal rescue team scheduling plan based on the output of the rescue team scheduling model.

[0130] The specific limitations of the rescue team dispatching device based on an earthquake rescue response circle can be found in the limitations of the rescue team dispatching method based on an earthquake rescue response circle described above and will not be repeated here. Each module in the aforementioned rescue team dispatching device based on an earthquake rescue response circle can be implemented in whole or in part through software, hardware, or a combination thereof. Each of the aforementioned modules can be embedded in or independent of a processor in a computer device in hardware form, or can be stored in a memory in a computer device in software form, so that the processor can call and execute the corresponding operations of each of the aforementioned modules.

[0131] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 13As shown. The computer device includes a processor, a memory, a network interface and a relational database connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store rescue team dispatch data based on the earthquake rescue response circle. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a rescue team dispatch method based on the earthquake rescue response circle is implemented.

[0132] Those skilled in the art will understand that Figure 13 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0133] In one embodiment, a computer device is provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps of the method in the above embodiment when executing the computer program.

[0134] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the method in the above embodiment are implemented.

[0135] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0136] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0137] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art could make various modifications and improvements without departing from the spirit of the present application, all of which fall within the scope of protection of the present application. Therefore, the scope of protection of the present patent application shall be determined by the appended claims.

Claims

1. A rescue team dispatching method based on earthquake rescue response circle, characterized in that: The method comprises: Parsing a preset earthquake rescue mission to obtain an earthquake rescue response circle for the earthquake rescue mission and a target to be rescued and a candidate rescue team in the earthquake rescue response circle; Determining a rescue team from the candidate rescue teams to participate in the earthquake rescue mission based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued; According to the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the rescue target, and the urgency of the rescue of the target to be rescued, a rescue cost index is constructed, and a clustering method is used to obtain an initial target to be rescued allocation scheme based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued, including: using a clustering method to classify the targets to be rescued according to the distance between the rescue team and the target to be rescued, the number of classification categories is the number of rescue teams, traversing each category of targets to be rescued in turn, and calculating the average cost of the rescue team rescuing each category of targets to be rescued according to the rescue cost index, and obtaining To the average cost matrix, according to the average cost of the same target category to be rescued and different rescue teams in the average cost matrix, the average cost range of each target category to be rescued is obtained, and the target category to be rescued corresponding to the maximum average cost range is found; according to the minimum average cost of each rescue team in the average cost matrix to rescue the target category to be rescued corresponding to the maximum average cost range, the rescue team corresponding to the minimum average cost is assigned to the target category to be rescued corresponding to the minimum average cost, and the element corresponding to the minimum average cost in the average cost matrix and the maximum average cost range are deleted, and the above steps are repeated. After the allocation is completed, the initial target allocation plan is obtained; Constructing a rescue team scheduling model based on the rescue cost index, optimizing the initial target allocation plan according to the rescue team scheduling model, and obtaining an optimal rescue team scheduling plan; According to the distance between the rescue team and the target to be rescued, the rescue team's ability to meet the target's needs, and the urgency of the target to be rescued, a rescue cost index is constructed as follows: ； in, Rescue Team Relative rescue target The rescue cost indicator, represents the normalized distance, represents the normalized ability satisfaction, Indicates the normalized urgency of rescue, represents the influence weight of distance on the rescue cost index, represents the influence weight of capability satisfaction on rescue cost index, It represents the weight of the impact of the rescue urgency of the target to be rescued on the rescue cost index.

2. The method according to claim 1, characterized in that The step of obtaining the distance between the rescue team and the target to be rescued comprises: The location of the target to be rescued and the location of the rescue team are obtained, and the rescue path of each rescue team is planned according to the actual road network after the earthquake. The distance between the target to be rescued and the rescue team on the rescue path is obtained according to the rescue path of each rescue team.

3. The method according to claim 1, characterized in that The step of obtaining the capability constraints required by the target to be rescued includes: According to the rescue capability required by the target to be rescued and the capability of the rescue team, the rescue team's capability satisfaction relative to the target to be rescued is calculated as follows: ； in, Rescue Team Relative rescue target Ability satisfaction, Indicates the total number of capabilities required for the target to be rescued, Expressive ability Treating rescue targets the importance of Indicates the target to be rescued Required skills The indicator value of Rescue Team Possessing abilities The indicator value of .

4. The method according to claim 1, wherein The steps for obtaining the rescue urgency of the target to be rescued include: The urgency of the rescue of the target to be rescued is determined based on the post-earthquake scenario of the target to be rescued; the post-earthquake scenario of the target to be rescued includes the degree of damage to the target to be rescued after the earthquake, the degree of threat to the target to be rescued from secondary disasters and secondary collapse of buildings, and the importance factor of the target to be rescued.

5. The method according to claim 1, wherein The step of optimizing the allocation plan of the rescue targets according to the rescue team scheduling model to obtain the optimal rescue team scheduling plan includes: According to the initial allocation plan for the target to be rescued, each rescue team is traversed in turn, and each rescue team is traversed in turn using the nearest neighbor method to obtain the rescue route of each rescue team, and the average cost consumed by each rescue team on the rescue route is calculated; According to the maximum average cost of each rescue team, the rescue efficiency index is obtained, and the current rescue target allocation plan and rescue route of each rescue team are cached; Sort the rescue teams according to their average cost, traverse the sorted rescue teams, assign the last target to be rescued in the rescue route of the rescue team corresponding to the rescue efficiency index to the currently traversed rescue team, and update the average cost of the currently traversed rescue team after assigning the target to be rescued to obtain a new average cost; When the new average cost is greater than or equal to the rescue efficiency index, continue to iterate the next rescue team. When the new average cost is less than the rescue efficiency index, return to the step after calculating the average cost spent by each rescue team on the rescue route. Until the pre-set iteration termination condition is met, the cached allocation plan for the target to be rescued and the rescue route of each rescue team are output as the optimal rescue team scheduling plan.

6. The method according to claim 1, characterized in that The step of determining the rescue team that participates in the earthquake rescue mission from among the candidate rescue teams based on the preset distance constraint between the rescue target and the rescue team and the capability constraint required by the target to be rescued comprises: Based on the pre-set distance constraints between the rescue target and the rescue team and the capability constraints required by the target to be rescued, a preliminary screening result is obtained, and the earthquake rescue expert group determines the rescue team participating in the earthquake rescue mission from the candidate rescue teams based on the preliminary screening result.

7. A rescue team dispatching device based on an earthquake rescue response circle applied to the method according to any one of claims 1 to 6, characterized in that: The device comprises: A task parsing module is used to parse a preset earthquake rescue task, obtain an earthquake rescue response circle for the earthquake rescue task, and targets to be rescued and candidate rescue teams in the earthquake rescue response circle; A rescue team screening module is used to determine a rescue team that can participate in the earthquake rescue mission from among the candidate rescue teams based on a preset distance constraint between the rescue target and the rescue team and a capability constraint required by the target to be rescued; A preliminary allocation module is configured to construct a rescue cost index based on the distance between the rescue team and the target to be rescued, the rescue team's ability satisfaction with the target to be rescued, and the urgency of the target to be rescued, and to obtain an initial target allocation plan using a clustering method based on the distance between the rescue team and the target to be rescued and the rescue cost index of each target to be rescued; The rescue team scheduling module is used to construct a rescue team scheduling model based on the rescue cost index, optimize the initial rescue target allocation plan according to the rescue team scheduling model, and obtain the optimal rescue team scheduling plan.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

Images