Emergency scheduling scheme generation method and device, equipment and medium

Abstract

The invention relates to the technical field of personnel management, and provides an emergency scheduling scheme generation method and device, equipment and a medium. The method comprises the following steps: constructing a social network graph based on all dispatchers and all information flow relationships; calculating an initial manpower scheduling cost value and an initial time cost value in the scheduling task execution process of each commander based on the social network graph; constructing a scheduling cost optimization model according to the maximum number of the scheduling personnel, the initial manpower scheduling cost values and the initial time cost values of all the commanders, the social network graph and all the information transmission time, and performing minimization solution on the scheduling cost optimization model to obtain a first emergency scheduling scheme; and constructing a response time optimization model according to the maximum scheduling personnel number, the social network graph and all information transmission time, and carrying out minimization solution on the response time optimization model to obtain a second emergency scheduling scheme. According to the method, the reasonability of the emergency scheduling scheme can be improved.

Description

Technical Field

[0001] The present application relates to the technical field of personnel management, and in particular to a method, device, equipment and medium for generating an emergency dispatch plan. Background Art

[0002] The social network emergency dispatch problem usually refers to the use of social network relationships and information dissemination advantages to quickly organize resources and coordinate actions in the face of emergencies or emergencies to improve rescue efficiency and reduce losses. At present, in the process of emergency command, the inefficiency of dangerous rescue and command transmission frequently occurs, mainly affected by factors such as on-site dangers and complex situations. This phenomenon has seriously affected the efficiency of rescue and made it difficult to carry out emergency response in a timely and effective manner. It is urgent to establish a more efficient command system and emergency dispatch optimization, and improve the response capabilities and teamwork level of rescue personnel through actual combat exercises, personnel training and technical support, so as to cope with the challenges brought by emergencies, minimize losses and improve the efficiency of emergency command.

[0003] The existing emergency dispatch method is based on the geographic information system (GIS) to monitor and analyze the disaster site in real time through geographic information technology, centrally manage resources and personnel, and command decision-making and resource dispatch, or solve the resource dispatch problem with the best objective function. However, this emergency dispatch method does not explore the social network relationship of personnel, and often considers a single factor, which is difficult to meet the multi-faceted needs in emergency situations. In addition, the multi-objective optimization model can consider multiple objective functions at the same time for optimization and solution, and achieve the best emergency dispatch plan under limited resources. However, this type of model has high complexity, difficult decision-making trade-offs, high computational costs, difficult results interpretation, and sensitivity to parameters, making it difficult to be effectively used and implemented. Modeling. It can be seen that the existing emergency dispatch plan still has problems such as imperfect and unreasonable dispatch methods, and it is difficult to meet the rescue needs of major public emergency events. Summary of the invention

[0004] The present application provides a method, device, equipment and medium for generating an emergency dispatch plan, which can solve the problems of insufficient rationality and low perfection of the emergency dispatch plan.

[0005] In a first aspect, an embodiment of the present application provides a method for generating an emergency dispatch plan, the method comprising: Obtain the maximum number of dispatchers for emergency events, and obtain the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers; the types of multiple dispatchers include emergency duty personnel and command personnel who dispatch emergency duty personnel; A social network graph is constructed based on all dispatchers and all information flow relationships; multiple nodes of the social network graph correspond to multiple dispatchers one by one, and the edge between each two nodes represents the information flow relationship between the corresponding two dispatchers; Based on the social network graph, the initial manpower scheduling cost value and initial time cost value of each commander in the process of performing the scheduling task are calculated; A scheduling cost optimization model is constructed based on the maximum number of dispatchers, the initial manpower scheduling cost value and the initial time cost value of all commanders, the social network graph, and all information transmission time, and the scheduling cost optimization model is minimized to obtain the first emergency scheduling plan; the first emergency scheduling plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the scheduling cost value is minimized, and the emergency handling instructions are used to instruct the handling of emergency events; A response time optimization model is constructed according to the maximum number of affected personnel and the social network graph, and the response time optimization model is minimized to obtain the second emergency dispatch plan; the second emergency dispatch plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the purpose is to minimize the response time.

[0006] Optionally, the initial manpower scheduling cost value and initial time cost value of each commander are calculated based on the social network graph, including: For each commander, follow these steps: Get the number of edges starting from the node corresponding to the commander in the social network graph; The number of edges is used as the initial manpower scheduling cost value of the commander; The information path that transmits information from the node corresponding to the commander as the starting point until it can no longer be transmitted and the total information transmission time corresponding to the information path are obtained, and the total information transmission time is used as the initial time cost value corresponding to the commander.

[0007] Optionally, the emergency cost optimization model is: in, represents the total scheduling cost value, Indicates The total manpower dispatch cost value of each commander is Indicates the number of command personnel, Represents the total number of command personnel and emergency duty personnel. Indicates the scheduling The initial manpower scheduling cost value of a commander, Indicates the number of information transmission layers, Indicates The node corresponding to the commander transmits the information to the When the node of the layer The manpower dispatch cost value of a commander, Indicates The nodes corresponding to the commanders, Indicates The information transmission time required for each commander to complete the information transmission, Indicates The node corresponding to the emergency duty personnel, Indicates The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency duty personnel The dispatch path for emergency duty personnel to dispatch, Indicates The time scheduling cost of a commander, Indicates the maximum time it takes for information to pass through the entire network. Indicates the node in the social network graph starting from the node corresponding to the commander or emergency duty personnel. The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates the A commander or The set of edges starting from the node corresponding to the emergency duty personnel, Representing a collection The last edge in Indicates the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in .

[0008] Optionally, the response time optimization model is: in, Indicates the response time, Indicates the number of command personnel, Represents the total number of command personnel and emergency duty personnel, Indicates The nodes corresponding to the commanders, Indicates The information transmission time required for each commander to complete the information transmission, Indicates The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency duty personnel The dispatch path for emergency duty personnel to dispatch, Indicates The time scheduling cost of a commander, Indicates The node corresponding to the emergency duty personnel, Indicates the node in the social network graph starting from the node corresponding to the commander or emergency duty personnel. The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates the A commander or The set of edges starting from the node corresponding to the emergency duty personnel, Representing a collection The last edge in Indicates the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in .

[0009] Optionally, the dispatch cost optimization model is minimized to obtain a first emergency dispatch plan, including: A plurality of target commanders are randomly selected from all commanders, and each target commander is taken as an initial commander. The dispatch cost optimization model is minimized according to the initial commander to obtain the first emergency dispatch plan.

[0010] In a second aspect, an embodiment of the present application provides an emergency dispatch plan generating device, including: An acquisition module is used to acquire the maximum number of dispatchers for emergency events, and to acquire the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers; the types of multiple dispatchers include emergency duty personnel and command personnel who dispatch emergency duty personnel; A social network graph construction module constructs a social network graph based on all dispatchers and all information flow relationships; multiple nodes in the social network graph correspond to multiple dispatchers one by one, and the edge between each two nodes represents the information flow relationship between the corresponding two dispatchers; A calculation module calculates the initial manpower scheduling cost value and the initial time cost value of each commander in the process of performing the scheduling task based on the social network graph; The first construction module constructs a scheduling cost optimization model based on the maximum number of dispatchers, the initial manpower scheduling cost value and the initial time cost value of all commanders, the social network graph, and all information transmission time, and minimizes the scheduling cost optimization model to obtain the first emergency scheduling plan; the first emergency scheduling plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the scheduling cost value is minimized, and the emergency handling instructions are used to instruct the handling of emergency events; The second construction module constructs a response time optimization model according to the maximum number of affected personnel and the social network graph, and minimizes the response time optimization model to obtain a second emergency dispatch plan; the second emergency dispatch plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the purpose is to minimize the response time.

[0011] In a third aspect, an embodiment of the present application provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned emergency dispatch plan generation method when executing the above-mentioned computer program.

[0012] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the above-mentioned emergency dispatch plan generation method is implemented.

[0013] The above solution of the present application has the following beneficial effects: In an embodiment of the present application, the maximum number of dispatchers for the target emergency event is obtained, and the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers are obtained, and then a social network graph is constructed based on all dispatchers and all information flow relationships, and then the initial manpower scheduling cost value and initial time cost value of each commander in the process of performing the scheduling task are calculated based on the social network graph, and then a scheduling cost optimization model is constructed according to the maximum number of dispatchers, the initial manpower scheduling cost value and initial time cost value of all commanders, the social network graph, and all information transmission times, and the scheduling cost optimization model is minimized to obtain a first emergency dispatch plan, and then a response time optimization model is constructed according to the maximum number of dispatchers and the social network graph, and the response time optimization model is minimized to obtain a second emergency dispatch plan. Among them, the cost optimization model and the response time optimization model are constructed respectively according to the social network graph, and the information flow information between the dispatchers is taken into account, so that the cost optimization model and the response time optimization model are practical. At the same time, the emergency dispatch plan can be obtained by minimizing the practical cost optimization model and the response time optimization model, which improves the accuracy of the emergency dispatch plan while reducing the complexity of the calculation. At the same time, emergency dispatch plans under both cost optimization and response time optimization are provided. Different emergency dispatch plans can be adopted according to the actual needs and urgency of the emergency event, thereby improving the rationality and perfection of the emergency dispatch plan.

[0014] Other beneficial effects of the present application will be described in detail in the subsequent specific implementation section. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0016] Figure 1 A flowchart of a method for generating an emergency dispatch plan provided in an embodiment of the present application; Figure 2 A schematic diagram of the structure of a social network graph provided in one embodiment of the present application; Figure 3 A schematic diagram of the structure of an emergency dispatch plan generating device provided in an embodiment of the present application; Figure 4 A schematic diagram of the structure of a terminal device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0017] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0018] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0019] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0020] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.

[0021] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.

[0022] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.

[0023] In response to the problem of low rationality of existing emergency dispatch plans, an embodiment of the present application provides an emergency dispatch plan generation method, which obtains the maximum number of dispatchers for the target emergency event, and obtains the information flow relationship and information transmission time between every two dispatchers, and then constructs a social network graph based on all dispatchers and all information flow relationships, and then calculates the initial manpower dispatching cost value and initial time cost value of each commander in the process of performing the dispatching task based on the social network graph, and then constructs a dispatching cost optimization model based on the maximum number of dispatchers, the initial manpower dispatching cost value and initial time cost value of all commanders, the social network graph, and all information transmission times, and minimizes the dispatching cost optimization model to obtain a first emergency dispatch plan, and then constructs a response time optimization model based on the maximum number of dispatchers and the social network graph, and minimizes the response time optimization model to obtain a second emergency dispatch plan. Among them, the cost optimization model and the response time optimization model are constructed respectively according to the social network graph, and the information flow information between the dispatchers is taken into account, so that the cost optimization model and the response time optimization model are practical. At the same time, the emergency dispatch plan can be obtained by minimizing the practical cost optimization model and the response time optimization model, which improves the accuracy of the emergency dispatch plan while reducing the complexity of the calculation. At the same time, emergency dispatch plans under both cost optimization and response time optimization are provided. Different emergency dispatch plans can be adopted according to the actual needs and urgency of the emergency event, thereby improving the rationality and perfection of the emergency dispatch plan.

[0024] Next, an exemplary description is given of the method for generating an emergency dispatch plan provided in this application.

[0025] like Figure 1 As shown, the emergency dispatch plan generation method provided by this application includes the following steps: Step 11, obtaining the maximum number of dispatchers for emergency events, and obtaining the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers.

[0026] The types of the above-mentioned multiple dispatchers include emergency duty personnel and command personnel who dispatch emergency duty personnel. The above-mentioned emergency events are emergency events that require personnel dispatch, such as traffic accidents, fires, etc.

[0027] In some embodiments of the present application, the information flow relationship and information transfer time can be obtained by accessing the communication device of the dispatcher. The above-mentioned maximum number of dispatchers is preset according to the scale of the emergency event. The above-mentioned information flow relationship is used to describe the information transfer status between dispatchers. For example, the first dispatcher can transfer information to the fifth dispatcher through the communication device. The above-mentioned information transfer time is the time for information transfer between two dispatchers. For example, it takes 5 seconds for the first dispatcher to transfer information to the fifth dispatcher, and the information transfer time is 5 seconds.

[0028] Step 12, construct a social network graph based on all dispatchers and all information flow relationships.

[0029] The multiple nodes of the above social network graph correspond one-to-one to the multiple dispatchers, and the edge between each two nodes represents the information flow relationship between the corresponding two dispatchers.

[0030] It should be noted that in the social network graph, if there is an information flow relationship between two dispatchers, there is an edge connecting the two corresponding nodes. If there is no information flow relationship between the two dispatchers, there is no edge connecting the two corresponding nodes. And the edge has directionality, that is, it points from the starting dispatcher in the information flow relationship to the end dispatcher. For example, if the information flow relationship is that the first dispatcher transmits information to the second dispatcher, the node corresponding to the first dispatcher is the starting point of the edge, and the node corresponding to the second dispatcher is the end point of the edge.

[0031] For example, a social network graph can be constructed using computer software such as Matlab.

[0032] It is worth mentioning that by constructing a social network graph, the information flow relationship between dispatchers can be reflected and the social status of all dispatchers can be intuitively described.

[0033] Step 13, based on the social network graph, calculate the initial manpower scheduling cost value and the initial time cost value of each commander in the process of performing the scheduling task.

[0034] In some embodiments of the present application, the above step of calculating the initial manpower scheduling cost value and the initial time cost value of each commander based on the social network graph is specifically as follows: Specifically, for each commander, perform the following steps: First, obtain the number of edges starting from the node corresponding to the commander in the social network graph; Secondly, the number of edges is used as the initial manpower scheduling cost value of the commander.

[0035] Then, the information path that transmits information from the node corresponding to the commander as the starting point until it can no longer be transmitted and the total information transmission time corresponding to the information path are obtained, and the total information transmission time is used as the initial time cost value corresponding to the commander.

[0036] Specifically, it can be expressed by the formula: Calculate the Information transmission time for each commander , Indicates the number of information transmission layers (i.e. The number of floors that a commander finally reaches after transmitting information).

[0037] For example, the number of edges starting from the node corresponding to the first commander is 3, so the manpower scheduling cost of scheduling the first commander is 3, and the number of information paths that can be transmitted is 3. The first commander can transmit information 5 times in the network, so the cost of scheduling emergency duty personnel is 5, and the total manpower scheduling cost is 8. Accordingly, the time scheduling cost of the first commander is Therefore, the dispatch cost of the first commander is 8.97.

[0038] It is worth mentioning that by obtaining the dispatching cost value of the commander, the complexity of the information interaction of the dispatching personnel can be taken into account, providing dispatching cost information for subsequent calculations.

[0039] Step 14, construct a scheduling cost optimization model based on the maximum number of scheduling personnel, the initial manpower scheduling cost value and initial time cost value of all command personnel, the social network graph, and all information transmission time, and minimize the scheduling cost optimization model to obtain the first emergency scheduling plan.

[0040] The first emergency dispatch scheme is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the dispatch cost value is minimized. The emergency handling instructions are used to instruct the handling of emergency events. The dispatch cost optimization model is based on general emergency event design, does not impose strict requirements on time and cost, and is applicable to a variety of emergency events.

[0041] Specifically, the above emergency cost optimization model is: in, represents the total scheduling cost value, Indicates The total manpower dispatch cost value of each commander is Indicates the number of command personnel, Represents the total number of command personnel and emergency duty personnel. Indicates the scheduling The initial manpower scheduling cost value of a commander, Indicates the number of information transmission layers, Indicates The node corresponding to the commander transmits the information to the When the node of the layer The manpower dispatch cost value of a commander, Indicates The nodes corresponding to the commanders, Indicates The initial time cost value of a commander, Indicates The node corresponding to the emergency duty personnel, Indicates The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency duty personnel The dispatch path for emergency duty personnel to dispatch, Indicates The time scheduling cost of a commander, It represents the maximum time taken for information to pass through the entire network (obtained by accumulating the information transmission time), Indicates the node in the social network graph starting from the node corresponding to the commander or emergency duty personnel. The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates the A commander or The set of edges starting from the node corresponding to the emergency duty personnel, Representing a collection The last edge in Indicates the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in express In the optimization model, if If an emergency duty officer is selected, , If an emergency duty officer is not selected, .

[0042] It should be noted that the above The node corresponding to the commander transmits the information to the When the node of the layer The manpower dispatch cost of a commander Specifically, the initial manpower scheduling cost value of the commander is related to the information transmitted by the commander to the The sum of the out-degree values ​​of each node in the path of the nodes of the layer. For example, the node corresponding to the commander with an initial manpower scheduling cost value of 2 transmits information to the third layer. When it is transmitted to the second layer, it transmits information to the first node of the second layer, whose out-degree value is 3. When the first node of the second layer transmits information to the third layer, it selects the second node of the third layer, whose out-degree value is 4. When the node corresponding to the commander transmits information to the node of the third layer, the manpower scheduling cost value of the commander is 2+3+4=9.

[0043] Exemplarily, the self-trust values ​​of the above nodes can be set to the same value, such as 0.2. The above set of edges starting from the commander, such as the set of edges starting from the node corresponding to the first commander, is ,when , the next level node (i.e., the end node of the edge) corresponding to the third edge starting from the first commander is the node corresponding to the third emergency duty officer; then the set of edges with the node corresponding to the third emergency duty officer as the end point is ,when , find the previous node (i.e. the starting node of the edge) corresponding to the first edge with the third emergency duty officer as the end point. After finding the corresponding previous and next node sets corresponding to the in-and-out degrees of the commanding officer and emergency duty officer nodes, use the viewpoint value formula Calculate the viewpoint values ​​of the relevant nodes of the command personnel and the relevant nodes of the emergency duty personnel respectively.

[0044] In some embodiments of the present application, the above-mentioned step of minimizing the scheduling cost optimization model to obtain the first emergency scheduling plan is specifically: randomly selecting multiple target commanders from all commanders, and taking each target commander as an initial person, minimizing the scheduling cost optimization model according to the initial person to obtain the first emergency scheduling plan. The scheduling cost optimization model can be minimized using a greedy algorithm to obtain the first emergency scheduling plan.

[0045] It should be noted that the above moment, Each moment is the time step when solving the model. Every time a node is obtained, the moment increases by 1 until the solution is completed. When the solution starts, that is, when only the initial personnel are determined, it is the first moment.

[0046] Exemplarily, the multiple target commanders are the first commander and the second commander, and the dispatch cost optimization model is solved using a greedy algorithm, and it is obtained that the multiple target emergency duty personnel among all emergency duty personnel are the fourth target emergency duty personnel and the sixth target emergency duty personnel, and the first commander transmits instructions to the sixth target emergency duty personnel, and the second commander transmits instructions to the fourth target emergency duty personnel, and the instruction transmission path for transmitting instructions from the first commander and the second commander is determined, then the information contained in the first emergency dispatch plan is: the instruction transmission path for the first commander to transmit emergency handling instructions to the sixth target emergency duty personnel, and the instruction transmission path for the second commander to transmit emergency handling instructions to the fourth target emergency duty personnel.

[0047] It is worth mentioning that by constructing a scheduling cost optimization model and minimizing the scheduling cost optimization model, a scheduling plan that takes the scheduling cost value into consideration can be provided. At the same time, it is only necessary to minimize the scheduling cost optimization model, which simplifies the calculation process and improves the efficiency of obtaining emergency scheduling plans.

[0048] Step 15, constructing a response time optimization model according to the maximum number of dispatchers and the social network graph, and performing minimization on the response time optimization model to obtain a second emergency dispatch plan.

[0049] The second emergency dispatch scheme is used to describe the instruction delivery path for multiple commanders to deliver emergency handling instructions to multiple emergency duty personnel when the response time is minimized. The response time optimization model is designed according to the urgency and importance of the event, aiming to shorten the emergency rescue response time as much as possible, regardless of cost.

[0050] Specifically, the above response time optimization model is: in, Indicates the response time, Indicates the number of command personnel, Represents the total number of command personnel and emergency duty personnel, Indicates The node corresponding to the commander, Indicates The initial time cost value of a commander, Indicates The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency duty personnel The dispatch path for emergency duty personnel to dispatch, Indicates The time scheduling cost of a commander, Indicates The node corresponding to the emergency duty personnel, Indicates the maximum time it takes for information to pass through the entire network. Indicates the node in the social network graph starting from the node corresponding to the commander or emergency duty personnel. The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates The next level node corresponding to the end point of the edge is The view value at a moment, Indicates The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates the A commander or The set of edges starting from the node corresponding to the emergency duty personnel, Representing a collection The last edge in Indicates the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in .

[0051] In some embodiments of the present application, the above-mentioned step of minimizing the response time optimization model to obtain the second emergency dispatch plan is specifically: randomly selecting multiple target commanders from all commanders, and taking each target commander as an initial person, minimizing the response time optimization model according to the initial person to obtain the second emergency dispatch plan. The response time optimization model can be minimized using a depth first search algorithm (DFS, Depth First Search) to obtain the second emergency dispatch plan.

[0052] Exemplarily, the multiple target commanders are the first commander and the second commander, and the response time optimization model is solved using the DFS algorithm, and it is obtained that the multiple target emergency duty personnel among all emergency duty personnel are the first target emergency duty personnel and the fourth target emergency duty personnel, and the first commander transmits instructions to the first target emergency duty personnel, and the second commander transmits instructions to the fourth target emergency duty personnel, and the instruction transmission path for transmitting instructions from the first commander and the second commander is determined, then the information contained in the second emergency dispatch plan is: the instruction transmission path for the first commander to transmit emergency handling instructions to the first target emergency duty personnel, and the instruction transmission path for the second commander to transmit emergency handling instructions to the fourth target emergency duty personnel.

[0053] It should be noted that, based on the actual cost requirements and urgency of the emergency event, the first emergency dispatch plan or the second emergency dispatch plan can be selected for implementation to handle the emergency event in an efficient, rational and low-cost manner.

[0054] It is worth mentioning that the cost optimization model and the response time optimization model are constructed respectively according to the social network graph, and the information flow information between the dispatchers is taken into account, so that the cost optimization model and the response time optimization model are practical. At the same time, the emergency dispatch plan can be obtained by minimizing the practical cost optimization model and the response time optimization model, which improves the accuracy of the emergency dispatch plan while reducing the complexity of the calculation. At the same time, emergency dispatch plans under both cost optimization and response time optimization are provided. Different emergency dispatch plans can be adopted according to the actual needs and urgency of the emergency event, thereby improving the rationality of the emergency dispatch plan.

[0055] The emergency dispatch plan generation method of the present application is exemplarily described below with reference to a specific example.

[0056] Social network diagram Figure 2 As shown in the figure, the circle represents the node corresponding to the dispatcher, where the number is and The nodes are all nodes corresponding to the command personnel, and the nodes with other numbers are all nodes corresponding to the emergency duty personnel. The letters represent the node numbers. According to the social network graph, the cost optimization model and the response time optimization model are constructed and minimized. The first emergency dispatch plan is , the corresponding response time is [3,3,4,3,2], and the scheduling cost value is [6.875,6.875,7.438,6.875,5.75]. , indicating a node The scheduling message is sent to node c, and node c sends the scheduling message to node j; the second emergency scheduling solution is , the corresponding response time is [2,3,4,3,].

[0057] The emergency dispatch plan generation device provided in this application is exemplarily described below.

[0058] like Figure 3 As shown, the embodiment of the present application provides an emergency dispatch plan generation device, and the emergency dispatch plan generation device 300 includes: The acquisition module 301 acquires the maximum number of dispatchers for the emergency event, and acquires the information flow relationship and information transmission time between every two dispatchers among the multiple dispatchers; the types of the multiple dispatchers include emergency duty personnel and command personnel who dispatch emergency duty personnel; A social network graph construction module 302 constructs a social network graph based on all dispatchers and all information flow relationships; multiple nodes of the social network graph correspond to multiple dispatchers one by one, and an edge between each two nodes represents an information flow relationship between the corresponding two dispatchers; The calculation module 303 calculates the initial manpower scheduling cost value and the initial time cost value of each commander in the process of performing the scheduling task based on the social network graph; The first construction module 304 constructs a scheduling cost optimization model according to the maximum number of dispatchers, the initial manpower scheduling cost values ​​and initial time cost values ​​of all commanding personnel, the social network graph, and all information transmission times, and performs minimization on the scheduling cost optimization model to obtain a first emergency scheduling plan; the first emergency scheduling plan is used to describe the instruction transmission path for multiple commanding personnel to transmit emergency processing instructions to multiple emergency duty personnel when the scheduling cost value is minimized, and the emergency processing instructions are used to instruct the processing of emergency events; The second construction module 305 constructs a response time optimization model according to the maximum number of dispatching personnel and the social network graph, and minimizes the response time optimization model to obtain a second emergency dispatch plan; the second emergency dispatch plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the purpose is to minimize the response time.

[0059] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0060] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0061] like Figure 4 As shown, an embodiment of the present application provides a terminal device. The terminal device D10 of this embodiment includes: at least one processor D100 ( Figure 4 Only one processor is shown in the figure), a memory D101, and a computer program D102 stored in the memory D101 and executable on the at least one processor D100, wherein the processor D100 implements the steps of any of the above-mentioned method embodiments when executing the computer program D102.

[0062] Specifically, when the processor D100 executes the computer program D102, it obtains the maximum number of dispatchers for the target emergency event, and obtains the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers, and then constructs a social network graph based on all dispatchers and all information flow relationships, and then calculates the initial manpower scheduling cost value and initial time cost value of each commander in the process of performing the scheduling task based on the social network graph, and then constructs a scheduling cost optimization model based on the maximum number of dispatchers, the initial manpower scheduling cost value and initial time cost value of all commanders, the social network graph, and all information transmission times, and minimizes the scheduling cost optimization model to obtain a first emergency scheduling plan, and then constructs a response time optimization model based on the maximum number of dispatchers and the social network graph, and minimizes the response time optimization model to obtain a second emergency scheduling plan. Among them, the cost optimization model and the response time optimization model are constructed respectively according to the social network graph, and the information flow information between the dispatchers is taken into account, so that the cost optimization model and the response time optimization model are practical. At the same time, the emergency dispatch plan can be obtained by minimizing the practical cost optimization model and the response time optimization model, which improves the accuracy of the emergency dispatch plan while reducing the complexity of the calculation. At the same time, emergency dispatch plans under both cost optimization and response time optimization are provided. Different emergency dispatch plans can be adopted according to the actual needs and urgency of the emergency event, thereby improving the rationality and perfection of the emergency dispatch plan.

[0063] The processor D100 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0064] In some embodiments, the memory D101 may be an internal storage unit of the terminal device D10, such as a hard disk or memory of the terminal device D10. In other embodiments, the memory D101 may also be an external storage device of the terminal device D10, such as a plug-in hard disk, a smart memory card (SMC, SmartMedia Card), a secure digital (SD, Secure Digital) card, a flash card (Flash Card), etc. equipped on the terminal device D10. Further, the memory D101 may also include both an internal storage unit of the terminal device D10 and an external storage device. The memory D101 is used to store an operating system, an application program, a boot loader (BootLoader), data, and other programs, such as the program code of the computer program, etc. The memory D101 may also be used to temporarily store data that has been output or is to be output.

[0065] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.

[0066] An embodiment of the present application provides a computer program product. When the computer program product runs on a terminal device, the terminal device can implement the steps in the above-mentioned method embodiments when executing the computer program product.

[0067] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of the above-mentioned various method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may at least include: any entity or device that can carry the computer program code to the personnel dispatch method device / terminal device for emergency events, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium. For example, a USB flash drive, a mobile hard disk, a disk or an optical disk. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electric carrier signals and telecommunication signals.

[0068] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0069] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0070] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles described in the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for generating an emergency dispatch plan, characterized in that: include: Obtaining the maximum number of dispatchers for emergency events, and obtaining the information flow relationship and information transmission time between every two dispatchers among multiple dispatchers; the types of the multiple dispatchers include emergency duty personnel and command personnel who dispatch the emergency duty personnel; A social network graph is constructed based on all dispatchers and all information flow relationships; multiple nodes of the social network graph correspond to multiple dispatchers one by one, and an edge between each two nodes represents an information flow relationship between the corresponding two dispatchers; Calculate the initial manpower scheduling cost value and initial time cost value of each commander in the process of performing the scheduling task based on the social network graph; A scheduling cost optimization model is constructed according to the maximum number of dispatching personnel, the initial manpower scheduling cost value and the initial time cost value of all commanding personnel, the social network graph, and all information transmission time, and the scheduling cost optimization model is minimized to obtain a first emergency scheduling plan; the first emergency scheduling plan is used to describe the instruction transmission path for multiple commanding personnel to transmit emergency processing instructions to multiple emergency duty personnel when the scheduling cost value is minimized, and the emergency processing instructions are used to instruct the processing of the emergency event; A response time optimization model is constructed according to the maximum number of dispatching personnel and the social network graph, and the response time optimization model is minimized to obtain a second emergency dispatch plan; the second emergency dispatch plan is used to describe the instruction transmission path for multiple command personnel to transmit emergency handling instructions to multiple emergency duty personnel when the purpose is to minimize the response time.

2. The method for generating an emergency dispatch plan according to claim 1, characterized in that: The calculating, based on the social network graph, an initial manpower scheduling cost value and an initial time cost value of each commander in the process of performing a scheduling task includes: For each of the commanders, perform the following steps: Obtain the number of edges starting from the node corresponding to the commander in the social network graph; Using the number of edges as the initial manpower scheduling cost value of the commander; The information path that transmits information from the node corresponding to the commander as the starting point until the information can no longer be transmitted and the total information transmission time corresponding to the information path are obtained, and the total information transmission time is used as the initial time cost value corresponding to the commander.

3. The method for generating an emergency dispatch plan according to claim 1, characterized in that: The scheduling cost optimization model is: in, represents the total scheduling cost value, Indicates The total manpower dispatch cost value of each commander is Indicates the number of command personnel, Indicates the total number of command personnel and emergency duty personnel; Indicates the scheduling The initial manpower scheduling cost value of a commander, Indicates the number of information transmission layers, Indicates The node corresponding to the commander transmits the information to the When the node of the layer The manpower dispatch cost value of a commander, Indicates the The nodes corresponding to the commanders, Indicates the The initial time cost value of a commander, Indicates The node corresponding to the emergency duty personnel, Indicates the The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates the The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates the The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency personnel on duty The dispatch path for emergency duty personnel to dispatch, Indicates the The time scheduling cost of a commander, Indicates the maximum time it takes for information to pass through the entire network. Indicates the node in the social network graph starting from the node corresponding to the commander or the emergency duty personnel The next level node corresponding to the end point of the edge is The view value at a moment, Indicates the The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates the The next level node corresponding to the end point of the edge is The view value at a moment, Indicates the The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates the The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates the The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates that the the commander or the The set of edges starting from the node corresponding to the emergency duty personnel, Represents the set The last edge in Indicates that the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in .

4. The method for generating an emergency dispatch plan according to claim 1, characterized in that: The response time optimization model is: in, Indicates the response time, Indicates the number of command personnel, Represents the total number of command personnel and emergency duty personnel, Indicates the The nodes corresponding to the commanders, Indicates the The initial time cost value of a commander, Indicates the The number of personnel dispatched by a commander, Indicates the number of members scheduled, Indicates the maximum number of dispatchers. Indicates a moment, Indicates the The commander of the The dispatch path for emergency duty personnel to dispatch, Indicates the The commander of the The length of the dispatch path for each emergency duty officer to dispatch, Indicates The emergency personnel on duty The dispatch path for emergency duty personnel to dispatch, Indicates the The time scheduling cost of a commander, Indicates The node corresponding to the emergency duty personnel, Indicates the node in the social network graph starting from the node corresponding to the commander or the emergency duty personnel The next level node corresponding to the end point of the edge is The view value at a moment, Indicates the The next level node corresponding to the end point of the edge is The self-confidence value at a moment, Indicates the The next level node corresponding to the end point of the edge is The view value at a moment, Indicates the The node corresponding to the end point of the edge is the first The previous node corresponding to the starting point of the edge is The trust weight at a moment, Indicates that the node is the end point The previous node corresponding to the starting point of the edge is The view value at a moment, Indicates the The node corresponding to the emergency duty personnel is The node corresponding to the commander is in The trust weight at a moment, Indicates the The node corresponding to the emergency duty personnel is in The self-confidence value at a moment, Indicates that the the commander or the The set of edges starting from the node corresponding to the emergency duty personnel, Represents the set The last edge in Indicates that the The set of edges with the node corresponding to the emergency duty personnel as the end point, Representing a collection The last edge in .

5. The method for generating an emergency dispatch plan according to claim 1, characterized in that: The minimization of the dispatch cost optimization model to obtain a first emergency dispatch plan includes: A plurality of target command personnel are randomly selected from all command personnel, and each of the target command personnel is used as an initial personnel. The dispatch cost optimization model is minimized according to the initial personnel to obtain a first emergency dispatch plan.

6. A device for generating an emergency dispatch plan for an emergency event, comprising: An acquisition module is used to acquire the maximum number of dispatchers for emergency events, and to acquire the information flow relationship and information transmission time between every two dispatchers among a plurality of dispatchers; the types of the plurality of dispatchers include emergency duty personnel and command personnel who dispatch the emergency duty personnel; A social network graph construction module is used to construct a social network graph based on all dispatchers and all information flow relationships; multiple nodes of the social network graph correspond to multiple dispatchers one by one, and the edge between each two nodes represents the information flow relationship between the corresponding two dispatchers; A calculation module, which calculates an initial manpower scheduling cost value and an initial time cost value of each commander in the process of performing a scheduling task based on the social network graph; The first construction module constructs a scheduling cost optimization model according to the maximum number of dispatching personnel, the initial manpower scheduling cost value and the initial time cost value of all commanding personnel, the social network graph, and all information transmission time, and minimizes the scheduling cost optimization model to obtain a first emergency scheduling plan; the first emergency scheduling plan is used to describe the instruction transmission path for multiple commanding personnel to transmit emergency processing instructions to multiple emergency duty personnel when the scheduling cost value is minimized, and the emergency processing instructions are used to instruct the processing of the emergency event; The second construction module constructs a response time optimization model according to the maximum number of dispatching personnel and the social network graph, and minimizes the response time optimization model to obtain a second emergency dispatch plan; the second emergency dispatch plan is used to describe the instruction transmission path for multiple commanders to transmit emergency handling instructions to multiple emergency duty personnel when the purpose is to minimize the response time.

7. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the emergency dispatch plan generating method according to any one of claims 1 to 5 is implemented.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the emergency dispatch plan generating method according to any one of claims 1 to 5 is implemented.

Images