Personnel scheduling method, device, equipment and medium based on interpersonal relationship

Abstract

The present application relates to the technical field of personnel dispatch management, and provides a personnel dispatch method, device, equipment and medium based on interpersonal relationships. The method includes: constructing a formal network based on the superior-subordinate relationship, constructing an informal network based on the informal relationship, and merging the formal network and the informal network to obtain a composite network; obtaining the main dispatchers and the number of dispatchers of each emergency team of the emergency event; calculating the distance between the node directly or indirectly connected to the node corresponding to the main dispatcher in the composite network and the node corresponding to the main dispatcher, and constructing constraints based on the composite network and all distances; under the constraints of the constraints, solving according to all the main dispatchers, the number of all dispatchers, and the composite network, to obtain the target dispatcher of the emergency team; integrating all the target dispatchers and the main dispatchers to obtain the target emergency team and perform personnel dispatch. This method can improve the rationality of personnel dispatch.

Description

Technical Field

[0001] The present application relates to the technical field of personnel scheduling management, and in particular to a personnel scheduling method, device, equipment and medium based on interpersonal relationships. Background Art

[0002] The existing emergency rescue personnel scheduling problem can be divided into multiple types, namely, considering skill requirements, time costs, competence and time satisfaction. The network relationship between people can be considered to be a fusion of formal network relationships and informal network relationships. The organizational structure of enterprises and institutions is a formal organization with distinct hierarchies. The superior-subordinate relationship between people can be considered as a formal network relationship in the interpersonal network; social networks such as WeChat and Weibo are mainly based on acquaintances such as classmates, relatives and friends. Their structure is a flat organizational structure without obvious superior-subordinate relationships. They can be considered as informal network relationships in the interpersonal network. At present, there is a lack of scheduling methods that consider the network relationships of emergency personnel. How to schedule emergency personnel based on network personnel relationships and quickly respond to different emergency needs has always been a difficult problem. It can be seen that the existing personnel scheduling methods have the problem of low rationality of personnel scheduling. Summary of the invention

[0003] The present application provides a personnel scheduling method, device, equipment and medium based on interpersonal relationships, which can solve the problem of low rationality of personnel scheduling.

[0004] In a first aspect, an embodiment of the present application provides a personnel scheduling method based on interpersonal relationships, the personnel scheduling method comprising:

[0005] Get the hierarchical relationship between multiple dispatchers;

[0006] Generate a random number between every two dispatchers, and obtain multiple informal relationships based on all the random numbers; the random number is used to describe the probability that there is an informal relationship between the corresponding two dispatchers, the informal relationship is used to simulate the social connection between the corresponding two dispatchers, and the random number corresponding to the informal relationship is greater than the random number threshold;

[0007] A formal network is constructed based on all superior-subordinate relationships, an informal network is constructed based on all informal relationships, and the formal network and the informal network are merged to obtain a composite network; multiple nodes of the composite network correspond to multiple dispatchers one by one, and the edge between each two nodes represents the superior-subordinate relationship or informal relationship between the corresponding two dispatchers;

[0008] Acquire multiple emergency response teams of the emergency event and the main dispatcher corresponding to each emergency response team, and acquire the number of dispatchers of each emergency response team; the multiple emergency response teams correspond one-to-one to the multiple emergency tasks in the emergency event, and the main dispatcher is one of all the dispatchers;

[0009] The multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher are all taken as target nodes, the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node is calculated, and constraint conditions are constructed based on the composite network and all distances;

[0010] Under the constraints, the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network are solved to obtain multiple target dispatchers corresponding to each emergency team;

[0011] For each emergency response team, all target dispatchers and main dispatchers corresponding to the emergency response team are integrated to obtain the target emergency response team, and personnel dispatch for emergency events is performed according to the target emergency response team.

[0012] Optionally, calculating the distance between each target node in the composite network and a node corresponding to a primary dispatcher corresponding to the target node includes:

[0013] For each node corresponding to each main dispatcher, traverse each target node corresponding to the node and perform the following steps:

[0014] Get multiple paths between a node and a target node;

[0015] Count the number of edges contained in each path, and take the number of edges with the smallest value as the distance between the node and the target node.

[0016] Optional constraints:

[0017]

[0018] in, represents the constraints, Indicates The node corresponding to the main dispatcher of the emergency team, Indicates The first emergency team The node corresponding to the dispatcher, express and The distance between Indicates the composite network Tier The distribution status of nodes in the composite network Tier The nodes are assigned to An emergency team ,otherwise, , express and If the connection relationship between and If there is an edge between ,otherwise, , Indicates the composite network Tier The number of nodes directly connected to a node, Indicates The first emergency team The response status of the dispatcher. The first emergency team The dispatcher responded to the An emergency team ,otherwise, , Indicates The number of dispatchers for each emergency team, represents the number of emergency response teams, Indicates The number of dispatchers for each emergency team, represents the number of layers of the composite network, Indicates the number of nodes corresponding to each layer in the composite network.

[0019] Optionally, under the constraints of the constraints, the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network are solved to obtain multiple target dispatchers corresponding to each emergency team, including:

[0020] For each emergency response team, follow these steps:

[0021] Take the node corresponding to the main dispatcher of the emergency team as the central node and obtain all the adjacent nodes of the central node;

[0022] Under the constraints, obtain multiple first nodes from all adjacent nodes;

[0023] If the number of the first node is equal to , then all dispatchers corresponding to the first nodes are assigned to the emergency team; Indicates the number of dispatchers of the emergency team;

[0024] If the number of the first node is less than , then continue to obtain all first adjacent nodes of each first node, and obtain multiple second nodes from all first adjacent nodes under the constraints of the constraints, until the number of nodes obtained under the constraints of the constraints is equal to .

[0025] Optionally, under the constraints, multiple first nodes are obtained from all adjacent nodes, including:

[0026] Determine multiple candidate nodes that meet the constraint conditions from all adjacent nodes;

[0027] Determine whether the number of candidate nodes is greater than ;

[0028] If so, select from all candidate nodes The first node;

[0029] Otherwise, each candidate node is taken as the first node.

[0030] Optionally, under the constraint condition, multiple second nodes are obtained from all first adjacent nodes, including:

[0031] Determine a plurality of first candidate nodes satisfying the constraint conditions from all first adjacent nodes;

[0032] Determine whether the number of first candidate nodes is greater than the number of first nodes and The difference between

[0033] If so, calculate the degree of each first candidate node, sort all degrees from large to small, and use the first several degrees as target degrees. The first candidate node corresponding to each target degree is used as a second node. The number of target degrees is equal to the number of first nodes and The difference between

[0034] Otherwise, all first candidate nodes are used as second nodes.

[0035] In a second aspect, an embodiment of the present application provides a personnel scheduling device based on personnel relationships, including:

[0036] A first acquisition module acquires the superior-subordinate relationship between multiple dispatchers;

[0037] A generation module generates random numbers between every two dispatchers, and obtains multiple informal relationships based on all random numbers; the random numbers are used to describe the probability that an informal relationship exists between the corresponding two dispatchers, the informal relationship is used to simulate the social connection between the corresponding two dispatchers, and the random number corresponding to the informal relationship is greater than the random number threshold;

[0038] The merging module builds a formal network based on all superior-subordinate relationships, builds an informal network based on all informal relationships, and merges the formal network and the informal network to obtain a composite network; multiple nodes of the composite network correspond to multiple dispatchers one by one, and the edge between each two nodes represents the superior-subordinate relationship or informal relationship between the corresponding two dispatchers;

[0039] The second acquisition module acquires multiple emergency response teams of the emergency event and the main dispatcher corresponding to each emergency response team, and acquires the number of dispatchers of each emergency response team; the multiple emergency response teams correspond one-to-one to the multiple emergency tasks in the emergency event, and the main dispatcher is one of all the dispatchers;

[0040] The calculation module takes multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher as target nodes, calculates the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructs constraint conditions based on the composite network and all distances;

[0041] The solving module, under the constraints, solves the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain multiple target dispatchers corresponding to each emergency team;

[0042] The integration module integrates all target dispatchers and main dispatchers corresponding to each emergency team respectively, obtains the target emergency team, and dispatches personnel for emergency events according to the target emergency team.

[0043] 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 personnel scheduling method based on interpersonal relationships when executing the above-mentioned computer program.

[0044] 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, it implements the above-mentioned personnel scheduling method based on interpersonal relationships.

[0045] The above solution of the present application has the following beneficial effects:

[0046] In some embodiments of the present application, by obtaining the superior-subordinate relationship between dispatchers among multiple dispatchers, then generating random numbers between every two dispatchers, and obtaining multiple informal relationships based on all random numbers, then constructing a formal network based on all superior-subordinate relationships, constructing an informal network based on all informal relationships, and merging the formal network and the informal network to obtain a composite network, then obtaining multiple emergency teams for emergency events and the main dispatchers corresponding to each emergency team, and obtaining the number of dispatchers, and then taking multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher as target nodes, calculating the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructing constraints based on the composite network and all distances, and then under the constraints of the constraints, solving according to the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain multiple target dispatchers corresponding to each emergency team, and then integrating all target dispatchers and main dispatchers corresponding to the emergency team for each emergency team to obtain the target emergency team, and dispatching personnel for the emergency event according to the target emergency team. Among them, generating random numbers between dispatchers can simulate the informal relationship between dispatchers, so that the composite network includes the superior-subordinate relationship and informal relationship between dispatchers, improves the authenticity and information richness of the composite network, and improves the accuracy of the constraints constructed based on the real composite network, which can accurately reflect the actual situation of personnel dispatching. At the same time, using the constraints to solve the dispatchers of each emergency team can improve the rationality of the dispatcher allocation while reducing the distance between personnel, thereby improving the rationality of personnel dispatching.

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

[0048] 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.

[0049] Figure 1 A flowchart of a personnel scheduling method based on interpersonal relationships provided in an embodiment of the present application;

[0050] Figure 2 A schematic diagram of the structure of a formal network and an informal network provided in an embodiment of the present application;

[0051] Figure 3A schematic diagram of the structure of a composite network provided in one embodiment of the present application;

[0052] Figure 4 A schematic diagram of the influence of a node provided in an embodiment of the present application;

[0053] Figure 5 A schematic diagram of the structure of a personnel scheduling device based on interpersonal relationships provided in one embodiment of the present application;

[0054] Figure 6 A schematic diagram of the structure of a terminal device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0055] 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.

[0056] 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.

[0057] 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.

[0058] 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.

[0059] 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.

[0060] 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.

[0061] In view of the problem of low rationality of existing personnel scheduling, an embodiment of the present application provides a personnel scheduling method based on interpersonal relationships. The personnel scheduling method obtains the superior-subordinate relationship between scheduling personnel among multiple scheduling personnel, then generates random numbers between every two scheduling personnel, and obtains multiple informal relationships based on all random numbers, then constructs a formal network based on all superior-subordinate relationships, constructs an informal network based on all informal relationships, and merges the formal network and the informal network to obtain a composite network, then obtains multiple emergency teams of emergency events and the main scheduling personnel corresponding to each emergency team, and obtains the number of scheduling personnel, and then takes multiple nodes directly or indirectly connected to the node corresponding to each main scheduling personnel as target nodes, calculates the distance between each target node in the composite network and the node corresponding to the main scheduling personnel corresponding to the target node, and constructs constraint conditions based on the composite network and all distances, and then under the constraints of the constraint conditions, solves according to the main scheduling personnel of all emergency teams, the number of all scheduling personnel, and the composite network to obtain multiple target scheduling personnel corresponding to each emergency team, and then integrates all target scheduling personnel and the main scheduling personnel corresponding to the emergency team for each emergency team to obtain the target emergency team, and performs personnel scheduling for the emergency event according to the target emergency team. Among them, generating random numbers between dispatchers can simulate the informal relationship between dispatchers, so that the composite network includes the superior-subordinate relationship and informal relationship between dispatchers, improves the authenticity and information richness of the composite network, and improves the accuracy of the constraints constructed based on the real composite network, which can accurately reflect the actual situation of personnel dispatching. At the same time, using the constraints to solve the dispatchers of each emergency team can improve the rationality of the dispatcher allocation while reducing the distance between personnel, thereby improving the rationality of personnel dispatching.

[0062] Next, an exemplary description is given of the personnel scheduling method based on interpersonal relationships provided in this application.

[0063] like Figure 1As shown, the personnel scheduling method based on interpersonal relationships provided by the present application includes the following steps:

[0064] Step 11, obtaining the superior-subordinate relationship between multiple dispatchers.

[0065] In some embodiments of the present application, the superior-subordinate relationship between dispatchers can be obtained by accessing documents such as the dispatchers' professional information.

[0066] For example, if the first dispatcher is the direct superior of the second dispatcher, then there is a superior-subordinate relationship between the first dispatcher and the second dispatcher.

[0067] Step 12, generating random numbers between every two dispatchers, and obtaining multiple informal relationships based on all the random numbers.

[0068] The above random numbers are used to describe the probability that there is an informal relationship between the corresponding two dispatchers. The informal relationship is used to simulate the social connection between the corresponding two dispatchers (such as communication contact, contact between relatives and classmates, etc.). The random number corresponding to the informal relationship is greater than the random number threshold.

[0069] Specifically, if the random number between two dispatchers is greater than the random number threshold, it is considered that there is an informal relationship between the two dispatchers.

[0070] Exemplarily, a random number is randomly generated between every two dispatchers, and the setting of the random number threshold is related to the range of the random number. For example, if the range of the random number is 0 to 100, it can be concluded through actual investigation that in a group with multiple dispatchers, there is a 10% probability that there are informal relationships such as social and kinship relationships between every two dispatchers. In this case, the random number threshold can be set to 90. If the random number between the first dispatcher and the second dispatcher is 92, which is greater than 90, then there is an informal relationship between the first dispatcher and the second dispatcher.

[0071] It is worth mentioning that in reality, there are often informal relationships between people that affect the flow of information such as communication. Using random numbers to obtain the informal relationships of dispatchers can improve the rationality of the relationships between people.

[0072] Step 13: construct a formal network based on all superior-subordinate relationships, construct an informal network based on all informal relationships, and merge the formal network and the informal network to obtain a composite network.

[0073] The multiple nodes of the formal network correspond to the multiple dispatchers one-to-one, and the edge between each two nodes represents the superior-subordinate relationship between the corresponding two dispatchers. The multiple nodes of the informal network correspond to the multiple dispatchers one-to-one, and the edge between each two nodes represents the informal relationship between the corresponding two dispatchers. Therefore, the multiple nodes of the composite network obtained by merging correspond to the multiple dispatchers one-to-one, and the edge between each two nodes represents the superior-subordinate relationship or informal relationship between the corresponding two dispatchers.

[0074] For example, the composite network can construct a node hierarchy based on the superior-subordinate relationship. For example, if the first dispatcher is the direct superior or indirect superior of all other dispatchers, the node corresponding to the first dispatcher can be used as the node of the first layer, and the nodes corresponding to the multiple dispatchers directly managed by the dispatcher can be used as the nodes of the second layer, and so on, to obtain a composite network with hierarchical division. At the same time, the informal relationship between every two dispatchers is added to the composite network.

[0075] It is worth mentioning that the composite network is constructed based on the superior-subordinate relationship and informal relationship, so that the composite network includes the superior-subordinate relationship and informal relationship between dispatchers, which improves the authenticity and information richness of the composite network.

[0076] Step 14, obtaining multiple emergency response teams for the emergency event and the main dispatchers corresponding to each emergency response team, and obtaining the number of dispatchers for each emergency response team.

[0077] The above-mentioned multiple emergency teams correspond to the multiple emergency tasks in the emergency events one by one. The multiple emergency tasks are obtained by analyzing the scale of the emergency tasks, emergency conditions and other factors. The above-mentioned main dispatcher is one of all dispatchers. The number of dispatchers is the number of people required by the emergency team including the main dispatcher. The emergency event can be an event that requires dispatchers to handle, such as a car accident, fire, etc.

[0078] It should be noted that the number of main dispatchers and the number of dispatchers in the emergency team can be set according to factors such as the scale of the emergency event and actual requirements, and the main dispatchers can be determined from all dispatchers.

[0079] For example, if a fire event covers a wide range and requires at least 4 groups of personnel to handle it simultaneously, then the fire event has 4 emergency tasks, and the number of personnel in each group is 5. The main dispatcher is usually a dispatcher with a higher level, which is reflected in the high level of the corresponding node in the composite network. According to the urgency and importance of the fire event, 4 nodes can be selected as the main dispatchers in the first layer of the composite network.

[0080] It is worth mentioning that by generating emergency teams based on the actual situation of emergency events, the number of emergency teams and the main dispatching personnel meet the needs of emergency events, thereby improving the rationality of personnel dispatch.

[0081] The above composite network is exemplarily described below with reference to a specific example.

[0082] Formal and informal networks Figure 2 As shown in the figure, the points in the figure represent the nodes corresponding to the dispatchers. Figure 2 (a) is the formal network, where the solid lines represent the formal relationships between dispatchers (i.e. the superior-subordinate relationships mentioned above). Figure 2 (b) is the informal network, and the dotted lines represent the informal relationships between dispatchers.

[0083] according to Figure 2 The composite network obtained by combining the formal network and the informal network shown is as follows Figure 3 As shown in the figure, the points represent the nodes corresponding to the dispatchers, the solid lines represent formal relationships, and the dotted lines represent informal relationships.

[0084] Step 15, taking multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher as target nodes, calculating the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructing constraint conditions based on the composite network and all distances.

[0085] In some embodiments of the present application, the above-mentioned step of calculating the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructing the constraint condition based on the composite network and all distances is specifically as follows:

[0086] In the first step, the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node is calculated.

[0087] For each node corresponding to each main dispatcher, traverse each target node corresponding to the node and perform the following steps:

[0088] Get multiple paths between a node and a target node.

[0089] Count the number of edges contained in each path, and take the number of edges with the smallest value as the distance between the node and the target node.

[0090] Exemplarily, the paths between the node and the first target node are 1-3-2 and 1-2, respectively, and the included edges are 2 and 1, respectively, then the distance between the node and the first target node is 1.

[0091] In the second step, constraints are constructed based on the composite network and all distances.

[0092] Specifically, the constraints are:

[0093]

[0094] in, represents the constraints, Indicates The node corresponding to the main dispatcher of the emergency team, Indicates The first emergency team The node corresponding to the dispatcher, express and The distance between Indicates the composite network Tier The distribution status of nodes in the composite network Tier The nodes are assigned to An emergency team ,otherwise, , express and If the connection relationship between and If there is an edge between ,otherwise, , Indicates the composite network Tier The number of nodes directly connected to a node, Indicates The first emergency team The response status of the dispatcher. The first emergency team The dispatcher responded to the An emergency team ,otherwise, , Indicates The number of dispatchers for each emergency team, represents the number of emergency response teams, Indicates The number of dispatchers for each emergency team, represents the number of layers of the composite network, Indicates the number of nodes corresponding to each layer in the composite network.

[0095] It should be noted that among the above constraints, The meaning is that each node can be divided into at most one group. The meaning is to give priority to nodes with direct associations. The meaning of is that there is a connection path between every two nodes in the emergency team. This means that the number of personnel in the emergency team must reach the number of dispatched personnel.

[0096] Exemplarily, the above steps can be run using computer software such as matlab, python, etc. to obtain the constraint conditions.

[0097] It is worth mentioning that the distance constraints constructed based on the real composite network have improved accuracy and can accurately reflect the actual situation of personnel scheduling.

[0098] Step 16, under the constraints of the constraints, solve according to the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain multiple target dispatchers corresponding to each emergency team.

[0099] In some embodiments of the present application, under the constraints of the above constraints, the steps of solving the composite network according to the main dispatchers of all emergency teams, the number of all dispatchers, and obtaining multiple target dispatchers corresponding to each emergency team are specifically as follows:

[0100] For each emergency response team, follow these steps:

[0101] In the first step, the node corresponding to the main dispatcher of the emergency team is taken as the central node, and all adjacent nodes of the central node are obtained.

[0102] In the second step, multiple first nodes are obtained from all adjacent nodes under the constraints.

[0103] Specifically, multiple candidate nodes that meet the constraint conditions are determined from all adjacent nodes, and then it is determined whether the number of candidate nodes is greater than , if so, select from all candidate nodes first node, otherwise, each candidate node is taken as the first node. Indicates the number of dispatch personnel of the emergency team.

[0104] For example, when the number of candidate nodes is greater than In the case of , we can calculate the degree of each candidate node, sort all the degrees from large to small, and get the top The candidate node corresponding to the degree is taken as the first node.

[0105] Step 3: If the number of the first node is equal to , then all dispatchers corresponding to the first nodes will be assigned to the emergency team.

[0106] If the number of the first node is less than , then continue to obtain all first adjacent nodes of each first node, and obtain multiple second nodes from all first adjacent nodes under the constraints of the constraints, until the number of nodes obtained under the constraints is equal to .

[0107] Specifically, under the constraint of the constraint condition, obtaining multiple second nodes from all first adjacent nodes is: determining multiple first candidate nodes that meet the constraint condition from all first adjacent nodes, and then determining whether the number of the first candidate nodes is greater than the number of the first nodes and If the difference is, then calculate the degree of each first candidate node, sort all the degrees from large to small, and take the first several degrees as the target degrees. The first candidate node corresponding to each target degree is taken as a second node. The number of target degrees is equal to the number of first nodes and Otherwise, all first candidate nodes are taken as second nodes.

[0108] It should be noted that the degree of a node is the number of edges directly connected to the node.

[0109] Exemplarily, for the first emergency team, the number of dispatchers is 6. In addition to the main dispatcher, 5 dispatchers need to be obtained. Under the constraints of the constraints, the node of the main dispatcher is taken as the central node. The node has 6 adjacent nodes, and 4 of them are candidate nodes that meet the constraints. These 4 candidate nodes are all used as first nodes. At this time, it is necessary to obtain 1 more node, and continue to obtain the adjacent nodes of each first node. The 4 first nodes have a total of 13 adjacent nodes, and all meet the constraints. The degree of these 13 adjacent nodes is calculated, and the adjacent node with the largest degree is used as the second node. At this time, the number of nodes obtained is 4 first nodes and 1 second node, reaching 5. Then the main dispatcher, the dispatchers corresponding to the 4 first nodes, and the dispatcher corresponding to the 1 second node are all assigned to the first emergency team.

[0110] In some embodiments of the present application, in order to reduce the calculation of degree when acquiring nodes, the influence of each node in the composite network can be obtained first. Specifically, the nodes connected to only one edge in the composite network are removed, and the influence of each removed node is set to a first-layer influence. Then, the nodes connected to two edges in the composite network after removal are removed, and the influence of each node removed at this time is set to a second-layer influence, and so on, until there are no nodes left in the composite network. When calculating the degree, only the degrees of multiple nodes with the largest number of influence layers can be calculated for comparison. For example, among 13 adjacent nodes, 4 nodes have a first-layer influence, 4 nodes have a second-layer influence, and 5 nodes have a third-layer influence. Then, only the degrees of 5 nodes with a third-layer influence need to be calculated. In this process, if the number of nodes with the largest number of influence layers is less than the number of nodes that need to be acquired, the degrees of multiple nodes with the second largest number of influence layers are calculated at the same time.

[0111] It is worth mentioning that by using the constraints to solve the dispatchers of each emergency team, the distance between personnel can be reduced while improving the rationality of the dispatcher allocation. And the total distance between the dispatching main node and the target dispatching node can be minimized, that is:

[0112]

[0113] in, Indicates the total dispatch distance.

[0114] The influence of the above nodes is illustrated below with reference to a specific example.

[0115] like Figure 4 As shown in the figure, the circles represent the first-level influence nodes, the triangles represent the second-level influence nodes, and the squares represent the third-level influence nodes.

[0116] Step 17, for each emergency response team, all target dispatchers and main dispatchers corresponding to the emergency response team are integrated to obtain a target emergency response team, and personnel are dispatched for emergency events according to the target emergency response team.

[0117] Specifically, all target dispatchers and main dispatchers corresponding to the emergency team are integrated into the same team to obtain a target emergency team, and all dispatchers in the target emergency team are simultaneously dispatched to corresponding emergency tasks to handle emergency events.

[0118] It should be noted that, through the above steps, all target dispatchers and main dispatchers corresponding to the emergency team are obtained to obtain the target emergency team, and then personnel are dispatched to the corresponding emergency tasks according to the target emergency team.

[0119] It is worth mentioning that generating random numbers between dispatchers can simulate the informal relationship between dispatchers, so that the composite network includes the superior-subordinate relationship and informal relationship between dispatchers, improves the authenticity and information richness of the composite network, and improves the accuracy of the constraints constructed based on the real composite network, which can accurately reflect the actual situation of personnel dispatch. At the same time, using the constraints to solve the dispatchers of each emergency team can improve the rationality of the dispatcher allocation while reducing the distance between personnel, thereby improving the rationality of personnel dispatch.

[0120] The following is an exemplary description of the personnel scheduling device based on interpersonal relationships provided by the present application.

[0121] like Figure 5 As shown, the embodiment of the present application provides a personnel scheduling device based on interpersonal relationships, and the personnel scheduling device based on interpersonal relationships 500 includes:

[0122] The first acquisition module 501 acquires the superior-subordinate relationship between the multiple dispatchers;

[0123] A generating module 502 generates random numbers between every two dispatchers, and obtains a plurality of informal relationships according to all the random numbers; the random numbers are used to describe the probability that an informal relationship exists between the corresponding two dispatchers, the informal relationship is used to simulate the social connection between the corresponding two dispatchers, and the random number corresponding to the informal relationship is greater than a random number threshold;

[0124] A merging module 503 constructs a formal network based on all superior-subordinate relationships, constructs an informal network based on all informal relationships, and merges the formal network and the informal network to obtain a composite network; multiple nodes of the composite network correspond to multiple dispatchers one by one, and the edge between each two nodes represents the superior-subordinate relationship or informal relationship between the corresponding two dispatchers;

[0125] The second acquisition module 504 acquires multiple emergency response teams of the emergency event and the main dispatcher corresponding to each emergency response team, and acquires the number of dispatchers of each emergency response team; the multiple emergency response teams correspond to the multiple emergency tasks in the emergency event one by one, and the main dispatcher is one of all the dispatchers;

[0126] The calculation module 505 takes multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher as target nodes, calculates the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructs constraint conditions based on the composite network and all distances;

[0127] The solving module 506 solves the problem based on the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network under the constraint conditions to obtain multiple target dispatchers corresponding to each emergency team;

[0128] The integration module 507 integrates all target dispatching personnel and main dispatching personnel corresponding to each emergency group to obtain a target emergency group, and dispatches personnel for emergency events according to the target emergency group.

[0129] 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.

[0130] 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.

[0131] like Figure 6 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 6 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.

[0132] Specifically, when the processor D100 executes the computer program D102, it obtains the superior-subordinate relationship between the dispatchers among the multiple dispatchers, then generates a random number between every two dispatchers, and obtains multiple informal relationships based on all the random numbers, then constructs a formal network based on all the superior-subordinate relationships, constructs an informal network based on all the informal relationships, and merges the formal network and the informal network to obtain a composite network, then obtains multiple emergency teams for the emergency event and the main dispatchers corresponding to each emergency team, and obtains the number of dispatchers, and then takes the multiple nodes directly or indirectly connected to the node corresponding to each main dispatcher as the target node, calculates the distance between each target node in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructs constraints based on the composite network and all distances, and then under the constraints of the constraints, solves according to the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain multiple target dispatchers corresponding to each emergency team, and then integrates all target dispatchers and main dispatchers corresponding to the emergency team for each emergency team to obtain the target emergency team, and dispatches personnel for the emergency event according to the target emergency team. Among them, generating random numbers between dispatchers can simulate the informal relationship between dispatchers, so that the composite network includes the superior-subordinate relationship and informal relationship between dispatchers, improves the authenticity and information richness of the composite network, and improves the accuracy of the constraints constructed based on the real composite network, which can accurately reflect the actual situation of personnel dispatching. At the same time, using the constraints to solve the dispatchers of each emergency team can improve the rationality of the dispatcher allocation while reducing the distance between personnel, thereby improving the rationality of personnel dispatching.

[0133] 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.

[0134] 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.

[0135] 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.

[0136] 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.

[0137] 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, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. 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 scheduling method device / terminal device based on interpersonal relationships, a recording medium, a computer memory, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), an electric carrier signal, a telecommunication signal, and a software distribution medium. For example, a USB flash drive, a mobile hard disk, a disk or an optical disk.

[0138] 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.

[0139] 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.

[0140] 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 personnel scheduling method based on interpersonal relationships, characterized in that: include: Get the hierarchical relationship between multiple dispatchers; Generate random numbers between every two dispatchers, and obtain multiple informal relationships based on all the random numbers; The random number is used to describe the probability that an informal relationship exists between the corresponding two dispatchers, the informal relationship is used to simulate the social connection between the corresponding two dispatchers, and the random number corresponding to the informal relationship is greater than the random number threshold; A formal network is constructed based on all superior-subordinate relationships, an informal network is constructed based on all informal relationships, and the formal network and the informal network are merged to obtain a composite network; multiple nodes of the composite network correspond to multiple dispatchers one by one, and an edge between each two nodes represents a superior-subordinate relationship or an informal relationship between the corresponding two dispatchers; Acquire multiple emergency response teams of the emergency event and the main dispatcher corresponding to each of the emergency response teams, and acquire the number of dispatchers of each of the emergency response teams; the multiple emergency response teams correspond one-to-one to the multiple emergency tasks in the emergency event, and the main dispatcher is one of all the dispatchers; Taking multiple nodes directly or indirectly connected to the node corresponding to each of the main dispatchers as target nodes, calculating the distance between each of the target nodes in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructing constraint conditions based on the composite network and all distances; Under the constraint of the constraint conditions, the composite network is solved according to the main dispatchers of all emergency teams, the number of all dispatchers, and a plurality of target dispatchers corresponding to each emergency team; For each emergency response team, all target dispatching personnel and main dispatching personnel corresponding to the emergency response team are integrated to obtain a target emergency response team, and personnel dispatch for the emergency event is performed according to the target emergency response team.

2. The personnel dispatching method according to claim 1, characterized in that: The calculating of the distance between each of the target nodes in the composite network and the node corresponding to the main dispatcher corresponding to the target node comprises: For each node corresponding to the main dispatcher, traverse each target node corresponding to the node and perform the following steps: Acquire multiple paths between the node and the target node; The number of edges included in each path is counted, and the number of edges with the smallest value is used as the distance between the node and the target node.

3. The personnel dispatching method according to claim 1, characterized in that: The constraints are: in, represents the constraints, Indicates the The node corresponding to the main dispatcher of the emergency team, Indicates the The first emergency team The node corresponding to the dispatcher, express and The distance between Indicates the composite network Tier The allocation status of nodes in the composite network Tier The nodes are assigned to the An emergency team ,otherwise, , express and If the connection relationship between and If there is an edge between ,otherwise, , Indicates the composite network Tier The number of nodes directly connected to a node, Indicates the The first emergency team The response status of the dispatcher, if the The first emergency team A dispatcher responded to the An emergency team ,otherwise, , Indicates the The number of dispatchers for each emergency team, represents the number of emergency response teams, Indicates the The number of dispatchers for each emergency team, represents the number of layers of the composite network, Indicates the number of nodes corresponding to each layer in the composite network.

4. The personnel dispatching method according to claim 3, characterized in that: Under the constraints of the constraints, the calculation is performed based on the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain multiple target dispatchers corresponding to each emergency team, including: For each of the emergency response teams, perform the following steps: Taking the node corresponding to the main dispatcher of the emergency team as the central node, obtaining all adjacent nodes of the central node; Under the constraint of the constraint condition, obtaining a plurality of first nodes from all adjacent nodes; If the number of the first node is equal to , all dispatchers corresponding to the first nodes are assigned to the emergency team; Indicates the number of dispatchers of the emergency team; If the number of the first node is less than , then continue to obtain all first adjacent nodes of each first node, and obtain multiple second nodes from all first adjacent nodes under the constraints of the constraints, until the number of nodes obtained under the constraints of the constraints is equal to .

5. The personnel dispatching method according to claim 4, characterized in that: The acquiring a plurality of first nodes from all adjacent nodes under the constraint of the constraint condition comprises: Determine a plurality of candidate nodes satisfying the constraint conditions from all adjacent nodes; Determine whether the number of candidate nodes is greater than ; If so, select from all candidate nodes The first node; Otherwise, each of the candidate nodes is taken as the first node.

6. The personnel dispatching method according to claim 4, characterized in that: The acquiring a plurality of second nodes from all first adjacent nodes under the constraint of the constraint condition comprises: Determine a plurality of first candidate nodes satisfying the constraint condition from all first adjacent nodes; Determine whether the number of first candidate nodes is greater than the number of first nodes and The difference between If so, calculate the degree of each of the first candidate nodes, sort all the degrees from large to small, and use the first multiple degrees as the target degrees, and use the first candidate node corresponding to each target degree as a second node; the number of target degrees is equal to the number of first nodes multiplied by The difference between Otherwise, all first candidate nodes are used as second nodes.

7. A personnel scheduling device based on interpersonal relationships, characterized in that: include: A first acquisition module acquires the superior-subordinate relationship between multiple dispatchers; A generation module generates a random number between every two dispatchers, and obtains a plurality of informal relationships according to all the random numbers; the random number is used to describe the probability that an informal relationship exists between the corresponding two dispatchers, the informal relationship is used to simulate the social connection between the corresponding two dispatchers, and the random number corresponding to the informal relationship is greater than a random number threshold; A merging module, constructing a formal network according to all superior-subordinate relationships, constructing an informal network according to all informal relationships, and merging the formal network and the informal network to obtain a composite network; multiple nodes of the composite network correspond to multiple dispatchers one by one, and the edge between each two nodes represents the superior-subordinate relationship or informal relationship between the corresponding two dispatchers; The second acquisition module acquires multiple emergency response teams of the emergency event and the main dispatcher corresponding to each of the emergency response teams, and acquires the number of dispatchers of each of the emergency response teams; the multiple emergency response teams correspond one-to-one to the multiple emergency tasks in the emergency event, and the main dispatcher is one of all the dispatchers; A calculation module, taking multiple nodes directly or indirectly connected to the node corresponding to each of the main dispatchers as target nodes, calculating the distance between each of the target nodes in the composite network and the node corresponding to the main dispatcher corresponding to the target node, and constructing constraint conditions based on the composite network and all the distances; A solution module, under the constraint of the constraint conditions, calculates according to the main dispatchers of all emergency teams, the number of all dispatchers, and the composite network to obtain a plurality of target dispatchers corresponding to each emergency team; The integration module integrates all target dispatching personnel and main dispatching personnel corresponding to each emergency group respectively to obtain a target emergency group, and dispatches personnel for the emergency event according to the target emergency group.

8. 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 personnel scheduling method based on interpersonal relationships as described in any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the personnel scheduling method based on interpersonal relationships as described in any one of claims 1 to 6 is implemented.

Images