Emergency Medical Rescue Command and Dispatch Methods and Systems

Abstract

This invention proposes an emergency medical rescue command and dispatch method and system for sudden events, relating to the field of medical emergency command and dispatch technology. It involves statistically analyzing the material demand at demand points and the material capacity of distribution centers, and calculating a timeout loss function. Based on the calculated timeout loss function value, the priority of each demand point is determined. According to the order of priority from high to low, an iterative algorithm is used to obtain the shortest delivery path to each demand point in sequence. Based on the shortest delivery path, the delivery time and cost corresponding to the shortest delivery path to the emergency resource distribution center are determined, and the path decision objective function is calculated.

Description

Technical Field

[0001] This invention relates to the field of medical emergency command and dispatch technology, specifically to emergency medical rescue command and dispatch methods and systems for sudden events. Background Technology

[0002] Emergency material dispatch is an important component of emergency logistics decision-making in the event of a sudden incident and a key link in emergency rescue work. Researching emergency material dispatch with the goal of minimizing time is of great practical significance for improving the rapid response capability to emergency material needs and enhancing the effectiveness of emergency rescue.

[0003] The most prominent feature of emergency resource dispatch is the urgency of time. Resource dispatchers and decision-makers need to complete the dispatch plan for the emergency resources required by the emergency points in the shortest possible time and promptly transfer the emergency resources to the disaster area.

[0004] Generally, emergency supplies are first collected from various levels of material reserves and then sent to distribution centers near the disaster site. The distribution centers then distribute the supplies and deliver them to the disaster area. Therefore, how to select the location of the distribution centers and how to scientifically plan the distribution routes of emergency supplies have become two very important research topics in emergency logistics systems. Summary of the Invention

[0005] To address the aforementioned technical problems, this invention proposes an emergency medical rescue command and dispatch method for sudden events, comprising the following steps:

[0006] S1. Calculate the material demand at the demand points and the material capacity of the distribution center, and calculate the timeout loss function.

[0007] S2. Determine the priority of each demand point based on the timeout loss function value calculated from the timeout loss function;

[0008] S3. Based on the priority of the demand points from high to low, use an iterative algorithm to obtain the shortest delivery path to each demand point in sequence.

[0009] S4. Based on the shortest delivery path, determine the delivery time and delivery cost corresponding to the shortest delivery path of the emergency resource distribution center, and calculate the path decision objective function.

[0010] Furthermore, the timeout loss function is d j (t):

[0011] .

[0012] Where, k j For demand point B j The weighting coefficient, where t is the time parameter, and demand point B. j The materials must be delivered by time ET.j Arrival within the area; supplies arrive at demand point B. j The actual time is T j j = 1, 2, ..., m, where m is the number of demand points.

[0013] Furthermore, the objective function minZ for the delivery route decision is:

[0014] ;

[0015] The objective function f1 for minimizing delivery time is:

[0016]

[0017] The objective function f2 for minimizing delivery costs is:

[0018]

[0019] Where n represents the number of distribution centers, h is the set of vehicles dispatched during the delivery process, h = (1, 2, ..., a), a is the total number of dispatched vehicles, and t hi This represents the time it takes for vehicle h to travel from distribution center i, traverse demand points, and return to the original distribution center. It is the time constraint factor, p j t represents the probability of timeout loss occurring at demand point j; j The time required for all dispatched vehicles to transport emergency supplies to the required point j; LT j Let c1 be the minimum waiting time for emergency supplies at demand point j; c2 is the fixed cost of starting a single vehicle; and c2 is the operating cost of the vehicle.

[0020] Furthermore, using d IJ Indicates the distribution center node v I To demand node v J The actual distance, r IJ Indicates the distribution center node v I With demand node v J The insertion points between them are I=1,2,…,n; J=1,2,…,m;

[0021] The iterative algorithm steps are as follows:

[0022] S31. Initialization: Let d IJ =w IJ , another r IJK The sequence number K=1;

[0023] S32, if d IK +d KJ <d IJ Let d IJ =dIK +d KJ Let K=2;

[0024] S33. If K=m, terminate the algorithm; otherwise, K=K+1, go to step S32.

[0025] Output d IJ This is the distribution center node v. I To demand node v J The shortest delivery path, and its shortest delivery path passes through multiple insertion demand points r. IJK .

[0026] This invention also proposes an emergency medical rescue command and dispatch system for sudden events, which is used to realize the emergency medical rescue command and dispatch method for sudden events, including: a statistical unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit, and a shortest path formation unit;

[0027] The statistical unit is used to calculate the material demand at the demand points and the material capacity of the distribution center.

[0028] The timeout calculation unit is used to calculate the timeout loss function based on the material demand at the statistical demand points and the material capacity of the distribution center.

[0029] The priority determination unit is used to determine the priority of each demand point based on the timeout loss function value calculated by the timeout loss function.

[0030] The shortest path forming unit is used to obtain the shortest delivery path to each demand point in sequence according to the priority of the demand points from high to low using an iterative algorithm.

[0031] The decision objective function calculation unit is used to determine the delivery time and delivery cost corresponding to the shortest delivery path of the emergency resource distribution center based on the shortest delivery path, and to calculate the decision objective function.

[0032] Furthermore, the decision objective function calculation unit includes a delivery time calculation module and a delivery cost calculation module;

[0033] The delivery time calculation module is used to calculate the objective function for minimizing delivery time, and the delivery cost calculation module is used to calculate the objective function for minimizing delivery cost.

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

[0035] The system statistically analyzes the material demand at various points and the material capacity of the distribution center, calculating a timeout loss function. Based on the calculated timeout loss function value, the priority of each demand point is determined. Following the order of priority from highest to lowest, an iterative algorithm is used to obtain the shortest delivery path to each demand point. Based on the shortest delivery path, the corresponding delivery time and cost for the shortest delivery path to the emergency resource distribution center are determined, and the path decision objective function is calculated. This system effectively facilitates the command and dispatch of emergency medical rescue efforts, planning the delivery sequence of the distribution center to ensure that materials are allocated as needed. Attached Figure Description

[0036] To more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0037] Figure 1 This is a flowchart of the emergency medical rescue command and dispatch method for sudden events according to the present invention;

[0038] Figure 2 This is a schematic diagram of the emergency medical rescue command and dispatch system for sudden events according to the present invention. Detailed Implementation

[0039] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0040] In the accompanying drawings of specific embodiments of the present invention, in order to better and more clearly describe the working principle of each component in the system and show the connection relationship of each part in the device, only the relative positional relationship between each component is clearly distinguished. It does not constitute a limitation on the signal transmission direction, connection sequence, or size, dimension, and shape of each part within the component or structure.

[0041] Figure 1 The flowchart of the emergency medical rescue command and dispatch method of the present invention is shown below. The dispatch method includes the following steps:

[0042] S1. Calculate the material demand at the demand points and the material capacity of the distribution center, and calculate the timeout loss function.

[0043] Let A1, A2, ..., Ai A n For n distribution centers, B1, B2, ..., B j B m There are m demand points; assume the vehicle departs from distribution center A. i To demand point B j The required time is t ij Each distribution center A i The material capacity is x i (i=1, 2, ..., n); each demand point B j The demand for supplies is y j (j = 1, 2, ..., m). Distribution Center A i To demand point B j The length of the journey is D ij .

[0044] Distribution Center A i Assigned to demand point B j The quantity of materials is x ij The transportation cost per unit length is c; demand point B. j The materials must be delivered by time ET. j If supplies arrive within the specified timeframe, a shortage will occur; otherwise, the timeout loss function for shortage assessment is d. j (t); Goods arrive at demand point B j The actual time is T j j = 1, 2, ..., m;

[0045] Timeout loss function d j (t) is:

[0046] .

[0047] Where, k j For demand point B j The weighting coefficients, where t is the time parameter.

[0048] S2, based on the timeout loss function d j (t) The timeout loss function value is calculated to determine the priority of each demand point.

[0049] The most significant characteristic of emergency resource dispatch is its time urgency. Resource dispatchers and decision-makers need to complete the dispatch plan for the emergency resources required by the demand points in the shortest possible time and promptly allocate the emergency resources to the demand points. This step is based on the timeout loss function d. j (t) Calculate the loss function value, determine the priority of each demand point, and schedule multiple distribution centers to multiple demand points.

[0050] Calculate the timeout loss function value for each demand point according to the timeout loss function in step S1. The demand point with the largest timeout loss function value is taken as the demand point with the highest priority, and the demand point with a loss function value of zero is taken as the demand point with the lowest priority.

[0051] S3. Based on the priority of the demand points from high to low, use an iterative algorithm to obtain the shortest delivery path to each demand point in sequence.

[0052] When an emergency occurs, the dispatcher quickly collects information, determines the location of the demand points and the demand for materials; and determines the locations of alternative distribution centers based on geographical location, material reserves, and other factors, and creates a topology map.

[0053] In the topology graph where demand points and distribution centers are identified as nodes: the path between two adjacent nodes is obtained by taking the quotient of the distance between adjacent nodes and the average speed of the current vehicle along that distance. The shortest delivery path to each node is then obtained using an iterative algorithm.

[0054] Iterative algorithms are an important method for calculating the shortest path between any two nodes. In the first iteration of the iterative algorithm, the shortest distance between any two nodes is allowed to pass through node v1, and the distance between any two nodes is updated. In the second iteration, the shortest distance between any two nodes is allowed to pass through node v2 (which already includes v1), and the distance between any two nodes is updated again. By repeating the above iterative process multiple times, the shortest delivery path reachable from each node can be obtained.

[0055] Use d IJ Indicates the distribution center node v I To demand node v J The actual distance, r IJ Indicates the distribution center node v I With demand node v J The insertion points between them, I=1,2,…,n; J=1,2,…,m, form a weighted adjacency matrix W=(w IJ ) nm .

[0056] The iterative algorithm steps are as follows:

[0057] (1) Initialization: Let d IJ =w IJ , another r IJK The sequence number K=1;

[0058] (2) If d IK +d KJ <d IJ Let d IJ =d IK +d KJLet K=2,

[0059] (3) If K=m, terminate the algorithm; otherwise, K=K+1, go to step (2).

[0060] The output d of the above algorithm IJ That is, the distribution center node v I To demand node v J The shortest delivery path, and its shortest delivery path passes through multiple insertion demand points r. IJK .

[0061] S4. Based on the shortest delivery path output in step S3, determine the delivery time and delivery cost corresponding to the shortest delivery path to the emergency resource distribution center, and calculate the path decision objective function.

[0062] The objective function for vehicle routing decisions considered in this embodiment involves two objectives: time and cost.

[0063] Let the objective function for minimizing delivery time represent the time objective. The objective function for minimizing delivery time, f1, is:

[0064]

[0065] In the above formula, n represents the number of distribution centers, h is the set of vehicles dispatched during the delivery process, h = (1, 2, ..., a), a is the total number of dispatched vehicles, and t hi This represents the time it takes for vehicle h to travel from distribution center i, traverse demand points, and return to the original distribution center. This is the time constraint factor, and its value is a given numerical value; p j t represents the probability of timeout loss occurring at demand point j; j The time required for all dispatched vehicles to transport emergency supplies to the required point j; LT j This represents the lower limit of the waiting time for emergency supplies at demand point j.

[0066] Let the cost objective be represented by the objective function that minimizes delivery costs. The objective function for minimizing delivery costs, f2, is:

[0067]

[0068] In the above formula, c1 represents the fixed cost of starting a single vehicle, a is the total number of vehicles deployed; c2 is the operating cost of the vehicles, which is related to fuel consumption, vehicle wear and tear, etc. hi This represents the time it takes for vehicle h to travel from distribution center i, traverse demand points, and return to the original distribution center.

[0069] Based on the shortest delivery path output in step S3, determine the objective function minZ for the delivery path decision of each emergency resource corresponding to the shortest delivery path output in step S3:

[0070] .

[0071] like Figure 2 The diagram shown is a schematic representation of the emergency medical rescue command and dispatch system of the present invention.

[0072] The system includes: a statistics unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit, and a shortest path formation unit.

[0073] The statistical unit is used to calculate the material demand at demand points and the material capacity of distribution centers.

[0074] The timeout calculation unit is used to calculate the timeout loss function based on the material demand at the statistical demand points and the material capacity of the distribution center.

[0075] The priority determination unit is used to determine the priority of each demand point based on the timeout loss function value calculated by the timeout loss function.

[0076] The shortest path forming unit is used to obtain the shortest delivery path to each demand point in descending order of priority using an iterative algorithm.

[0077] The decision objective function calculation unit is used to determine the delivery time and delivery cost corresponding to the shortest delivery path to the emergency resource distribution center based on the shortest delivery path, and to calculate the decision objective function.

[0078] The decision objective function calculation unit includes a delivery time calculation module and a delivery cost calculation module.

[0079] The delivery time calculation module is used to calculate the objective function that minimizes delivery time, and the delivery cost calculation module is used to calculate the objective function that minimizes delivery cost.

[0080] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted through the computer-readable storage medium. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk (SSD)).

[0081] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for commanding and dispatching emergency medical rescue in sudden incidents, characterized in that, Includes the following steps: S1. Calculate the material demand at the demand points and the material capacity of the distribution center, and then calculate the timeout loss function d. j (t): ； Where, k j For demand point B j The weighting coefficient, where t is the time parameter, and demand point B. j The materials must be delivered by time ET. j Arrival within the area; supplies arrive at demand point B. j The actual time is T j j = 1, 2, ..., m, where m is the number of demand points; S2. Determine the priority of each demand point based on the timeout loss function value calculated from the timeout loss function; S3. Based on the priority of the demand points from high to low, use an iterative algorithm to obtain the shortest delivery path to each demand point in sequence. Use d IJ Indicates the distribution center node v I To demand node v J The actual distance, r IJ Indicates the distribution center node v I With demand node v J The insertion points between them are I=1,2,…,n; J=1,2,…,m; The iterative algorithm steps are as follows: S31. Initialization: Let d IJ =w IJ , another r IJK The sequence number K=1; S32, if d IK +d KJ <d IJ Let d IJ =d IK +d KJ Let K=2; S33. If K=m, terminate the algorithm; otherwise, K=K+1, go to step S32. Output d IJ This is the distribution center node v. I To demand node v J The shortest delivery path, and its shortest delivery path passes through multiple insertion demand points r. IJK ; S4. Based on the shortest delivery path, determine the delivery time and delivery cost corresponding to the shortest delivery path of the emergency resource distribution center, and calculate the path decision objective function.

2. The emergency medical rescue command and dispatch method for sudden events according to claim 1, characterized in that, The objective function minZ for the delivery route decision is: ； The objective function f1 for minimizing delivery time is: The objective function f2 for minimizing delivery costs is: Where n represents the number of distribution centers, h is the set of vehicles dispatched during the delivery process, h = (1, 2, ..., a), a is the total number of dispatched vehicles, and t hi This represents the time it takes for vehicle h to travel from distribution center i, traverse demand points, and return to the original distribution center. It is the time constraint factor, p j t represents the probability of timeout loss occurring at demand point j; j The time required for all dispatched vehicles to transport emergency supplies to the required point j; LT j Let c1 be the minimum waiting time for emergency supplies at demand point j; c2 is the fixed cost of starting a single vehicle; and c2 is the operating cost of the vehicle.

3. An emergency medical rescue command and dispatch system for sudden incidents, characterized in that: The method for implementing the emergency medical rescue command and dispatch method for sudden events as described in any one of claims 1-2 includes: a statistics unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit, and a shortest path formation unit; The statistical unit is used to calculate the material demand at the demand points and the material capacity of the distribution center. The timeout calculation unit is used to calculate the timeout loss function based on the material demand at the statistical demand points and the material capacity of the distribution center. The priority determination unit is used to determine the priority of each demand point based on the timeout loss function value calculated by the timeout loss function. The shortest path forming unit is used to obtain the shortest delivery path to each demand point in sequence according to the priority of the demand points from high to low using an iterative algorithm. The decision objective function calculation unit is used to determine the delivery time and delivery cost corresponding to the shortest delivery path of the emergency resource distribution center based on the shortest delivery path, and to calculate the decision objective function.

4. The emergency medical rescue command and dispatch system for sudden events according to claim 3, characterized in that, The decision objective function calculation unit includes a delivery time calculation module and a delivery cost calculation module; The delivery time calculation module is used to calculate the objective function for minimizing delivery time, and the delivery cost calculation module is used to calculate the objective function for minimizing delivery cost.

Images