A two-layer optimization-based method for emergency valve-closing personnel assignment in complex gas pipeline networks

Abstract

The application relates to a complex gas pipe network emergency valve closing personnel assignment method based on two-layer optimization in the technical field of gas emergency rescue. Information of valves to be closed, personnel resource information, traffic time information and response level information are collected, and personnel are divided into professional personnel with qualification and carrying valve closing tools, temporarily authorized personnel with qualification but without tools, and auxiliary personnel without qualification and participating in tool distribution; an operation mode is selected according to the comparison result of the total number of professional personnel and the total number of personnel required by the task; a cost optimization model is established to solve the minimum number of dispatched personnel; an efficiency optimization model is established under the constraint of the minimum number of dispatched personnel to solve a basic assignment scheme; if the basic scheme does not meet the maximum allowed response time, a temporary authorization mechanism is started, and a tool self-collection scheme and a tool collaborative distribution scheme are calculated in parallel; and a globally optimal scheme is selected according to a priority order. The method can save human resources to the maximum extent under the premise of meeting the safety time requirement, and meanwhile, the rescue efficiency is considered.

Description

Technical Field

[0001] This application relates to the field of gas emergency rescue technology, and in particular to a method for assigning personnel to shut off emergency valves in complex gas pipeline networks based on two-layer optimization. Background Technology

[0002] With the accelerated pace of urbanization, the coverage of urban gas pipeline networks continues to expand. While natural gas, as a clean and efficient energy source, improves residents' quality of life and promotes industrial development, gas leaks are also showing a year-on-year upward trend. Gas leaks are characterized by rapid diffusion, low explosive limits, and high toxicity. If relevant valves are not closed within the prescribed time to effectively control the leak, it can easily lead to secondary disasters such as explosions, fires, and poisoning, causing significant casualties and property damage. Accident investigations show that untimely valve closure is one of the main reasons for the escalation of the disaster. Due to the suddenness, wide impact, and high time requirements of gas leak accidents, a large number of qualified personnel and tools need to be dispatched within a very short time. Traditional manual experience-based dispatching methods are inefficient and cannot meet the timeliness requirements of emergency rescue.

[0003] Current research on gas emergency repair technology by scholars both domestically and internationally mainly focuses on three aspects: pipeline leak location, valve shut-off scheme optimization, and personnel dispatch. Regarding pipeline leak location, some scholars have proposed various rapid leak point location methods based on pressure monitoring data and hydraulic models, such as transient analysis-based and machine learning-based methods, significantly improving the accuracy and speed of leak point location. In terms of valve shut-off scheme optimization, scholars have constructed pipeline topology models, aiming to minimize the number of valves to be shut and the impact range, and studied optimal valve shut-off sequence generation algorithms, providing a scientific basis for valve shut-off task formulation. However, the above research mainly focuses on determining which valves need to be closed, with relatively little research on personnel assignment for valve shut-off tasks, and it does not fully consider the multiple constraints in actual emergency repair processes, such as personnel qualifications, tool carrying status, and traffic conditions.

[0004] In the field of emergency personnel dispatch, existing research is mainly applied to scenarios such as fire rescue, medical emergency, and earthquake relief. Some scholars have addressed the problem of fire force deployment in concurrent fires, aiming to optimize the overall fire-fighting and rescue effect, and have established an optimal deployment model using linear programming theory when the supply and demand of fire forces are unbalanced. Other scholars have proposed firefighter rescue dispatch methods that adapt to the dynamic changes of fires, establishing an optimization model that balances transportation time and fair allocation of disaster-stricken areas, and using genetic algorithms to solve for the optimal dispatch scheme. However, all of the above methods use known static disaster data and do not consider the tool-dependent characteristics unique to gas emergency valve shut-off tasks, nor do they consider the special operation modes of parallel operations.

[0005] Regarding tool scheduling and temporary authorization mechanisms, most existing studies assume that all personnel involved in the operation carry the necessary tools, or only consider a single mode where personnel go to the emergency duty point to collect tools themselves. Some scholars have studied the centralized scheduling problem of emergency supplies and proposed various multi-objective material distribution optimization algorithms. However, these algorithms are mainly aimed at the long-distance transportation of large quantities of materials and are not applicable to the immediate delivery scenario of individual tools in gas emergency valve shut-off. In actual gas emergency rescue, a large number of standby personnel and other team members with valve shut-off qualifications do not carry valve shut-off tools with them. How to efficiently provide tool support to these temporarily authorized personnel is a key issue in shortening the total valve shut-off time, and existing technologies have not yet conducted in-depth research on this.

[0006] In summary, the current gas emergency valve shut-off dispatching mainly relies on the manual experience of the command personnel, which has the following drawbacks: (1) The scheduling decision is highly subjective and lacks scientific quantitative evaluation. The scheduling plans of different commanders vary greatly, making it difficult to ensure the consistency of scheduling efficiency. (2) The bottleneck of tools was not fully considered. The tools available to temporarily authorized personnel were limited, and they were often required to go to the emergency duty point to collect them, which led to a longer valve closing time. (3) Low resource utilization rate, and the scheduling strategy is not dynamically adjusted according to the response level. High response level events may cause timeouts due to insufficient personnel, while low response level events may cause waste of personnel resources.

[0007] Therefore, there is an urgent need for a scientific, efficient, and compliant method for assigning personnel to gas emergency valve shut-off systems, which can automatically generate the optimal personnel dispatch plan based on different response levels and resource conditions. Summary of the Invention

[0008] Therefore, it is necessary to provide a two-layer optimization-based method for assigning personnel to emergency valve shut-off in complex gas pipeline networks, which can solve the technical problems mentioned above, such as reliance on manual experience in gas emergency valve shut-off scheduling, insufficient consideration of tool bottleneck constraints, low resource utilization, and subjective weight settings in multi-objective optimization.

[0009] Firstly, this application provides a method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on a two-layer optimization approach. The method includes: Collect information on valves to be closed, personnel resources, travel time, and response level. Classify personnel into qualified professionals with valve-closing tools, qualified temporary authorized personnel without personal tools, and unqualified auxiliary personnel involved in tool delivery. Pre-calculate various travel time parameters and valve operation time. Based on the comparison between the total number of professional personnel and the total number of personnel required for the valve shut-off task, select either the simultaneous operation mode or the sequential operation mode. Establish a cost-optimal model, with the goal of minimizing the total number of dispatchers and the constraint of the maximum allowable response time, to solve for the minimum number of dispatchers; An optimal efficiency model is established under the minimum number of dispatchers constraint, and the basic assignment scheme is solved with the goal of minimizing the global completion time. If the basic assignment scheme does not meet the maximum allowable response time, a temporary authorization mechanism is activated to assign tasks to the qualified professionals who are carrying valve-closing tools and to determine the remaining valves. Parallel computing involves a self-service tool retrieval scheme where qualified but unequipped temporary authorized personnel acquire tools to perform the remaining tasks, and a collaborative tool delivery scheme where unqualified but involved tool delivery personnel deliver tools to the temporary authorized personnel. The optimal global solution is selected based on the priority order of having the fewest total number of dispatchers, the shortest completion time, and the largest safety margin.

[0010] Optionally, in one embodiment of this application, the collection of information on valves to be closed, personnel resources, travel time, and response level information, categorizing personnel into qualified professionals carrying valve-closing tools, qualified temporary authorized personnel without their own tools, and unqualified auxiliary personnel involved in tool delivery, and pre-calculating various travel time parameters and valve operation time, includes: Establish a set of emergency response teams, a set of valves to be closed, and an emergency duty station. Each emergency response team contains a fixed number of personnel, all of whom are qualified and carry valve-closing tools. Each valve has a minimum number of operators and a fixed operating time. The pre-calculated travel time parameters include the time for the emergency response team to reach the valve directly, the time for transferring between valves, the time for temporarily authorized personnel to reach the valve, the time for temporarily authorized personnel to reach the emergency duty point, the time for auxiliary personnel to reach the emergency duty point, and the time for the emergency duty point to reach the valve.

[0011] Optionally, in one embodiment of this application, the simultaneous operation mode is that each valve operates in parallel when the total number of professional personnel is not less than the total number of personnel required for the task; The sequential operation mode is that when the total number of professional personnel is less than the total number of personnel required for the task, the same emergency response team will perform multiple valve tasks in sequence.

[0012] Optionally, in one embodiment of this application, the time calculation for parallel operations by personnel within the rescue team includes: The time it takes for the emergency response team to complete the operation of a single valve is the sum of the travel time to reach the valve and the valve operation time. The time taken by the emergency response team to complete multiple valves is the maximum time taken to complete each valve. The completion time of subsequent valves needs to be accumulated by adding the completion time of the previous valve, the transfer time, and the current valve's operation time.

[0013] Optionally, in one embodiment of this application, the cost-optimal model includes a cost objective function and cost constraints: The cost objective function is to minimize the total number of people to be scheduled, expressed as:

[0014] in, To indicate the first A 0-1 variable indicating whether a rescue team has been dispatched. The number of personnel in each emergency response team; The cost constraints include: Variable range constraints are expressed as:

[0015]

[0016] in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as:

[0017] in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the transfer time between valves, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as:

[0018] in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: .

[0019] Optionally, in one embodiment of this application, the efficiency-optimal model includes an efficiency objective function and efficiency constraints: The efficiency objective function is to minimize the total global completion time, expressed as:

[0020]

[0021] Where T is the set of completion times for all assignment schemes. ; The efficiency constraints include: The total number of dispatchers equals the minimum number of dispatchers, expressed as:

[0022] in, The minimum number of dispatchers obtained by solving the cost-optimal model; Variable range constraints are expressed as:

[0023]

[0024] in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as:

[0025] in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the transfer time between valves, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as:

[0026] in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: .

[0027] Optionally, in one embodiment of this application, the basic assignment scheme is obtained by solving an integer linear programming model; When solving the integer linear programming model, if the problem size is less than a set threshold, the branch and bound method is used to obtain the global optimal solution. If the problem size is not less than a set threshold, a genetic algorithm is used to obtain an approximate optimal solution. The fitness function of the genetic algorithm is constructed based on the total number of people scheduled and the completion time.

[0028] Optionally, in one embodiment of this application, in the self-service tool retrieval scheme, temporarily authorized personnel first go to the emergency duty point to retrieve the tools and then proceed to work on the remaining valves. The completion time of the self-service tool retrieval scheme is expressed as follows:

[0029] The formula for calculating the total number of dispatchers for the tool self-collection plan is as follows:

[0030] in, The travel time for personnel i to travel directly from their current location to the emergency duty station w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0. In the tool collaborative delivery scheme, temporarily authorized personnel go directly to the remaining valves to stand by, while auxiliary personnel retrieve the tools from the emergency duty point and deliver them. The completion time of the tool collaborative delivery scheme is expressed as follows:

[0031] The formula for calculating the total number of dispatchers in a collaborative delivery solution for tools is as follows:

[0032] in, The travel time for temporarily authorized personnel q to travel directly from their current location to valve shut-off point j; The travel time for assistant L to travel directly from the current location to the emergency duty point w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0. The variable is 0-1. If the auxiliary personnel L is assigned to collect tools from the emergency duty point w and deliver them to the valve closing point j to perform valve closing operations, the value is 1; otherwise, the value is 0.

[0033] Optionally, in one embodiment of this application, the selection of the globally optimal solution includes: First, compare the total number of dispatchers and select the option with the fewest total dispatchers; When the total number of dispatchers is the same, compare the total global completion time and select the solution with the shortest total global completion time; When the total number of dispatchers and the total global completion time are the same, the safety margin is compared. The safety margin is the difference between the maximum allowable response time and the actual completion time, and the scheme with the larger difference is selected.

[0034] Optionally, in one embodiment of this application, in the temporary authorization mechanism, when assigning tasks to the qualified professional who carries valve-closing tools, all feasible task combinations are enumerated, the combination that minimizes the completion time for the professional and allows the remaining tasks to be covered by the temporary authorized personnel is selected, and the remaining valve set is determined based on this combination.

[0035] The above-mentioned method for assigning emergency valve shut-off personnel in complex gas pipeline networks based on two-layer optimization has the following advantages compared with existing technologies: First, a two-tiered optimization scheduling strategy is adopted, prioritizing the scheduling of professionals with their own tools, and automatically triggering a temporary authorization mechanism after the basic plan times out, making full use of various human resources and improving the flexibility and efficiency of scheduling.

[0036] Second, it innovatively proposes a collaborative tool delivery model, which, compared with the traditional self-collection model, enables the parallelization of personnel arrival and tool delivery, significantly shortening the total time for temporary authorized personnel to close the valve, and is especially suitable for high-response emergency situations.

[0037] Third, the model of vehicle-mounted and personnel-assigned operation mode fully leverages the operational efficiency of multi-person emergency response teams, effectively shortening the total valve closure time when personnel are insufficient.

[0038] Fourth, introduce a safety margin assessment, comprehensively consider the total number of dispatchers, completion time, and safety margin when selecting a scheme, to ensure that the dispatch scheme is not only optimal, but also has sufficient fault tolerance.

[0039] Fifth, the entire scheduling process is automated and standardized, avoiding the subjectivity and arbitrariness of human experience and ensuring the scientific and compliant nature of the scheduling plan. Attached Figure Description

[0040] Figure 1 This is a flowchart illustrating a method for assigning personnel to emergency valve shut-off in a complex gas pipeline network based on two-layer optimization, as shown in one embodiment. Figure 2 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0041] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0042] In one embodiment, such as Figure 1 As shown, a method for assigning emergency valve shut-off personnel in complex gas pipeline networks based on two-layer optimization is provided, including the following steps: S101: Collect information on valves to be closed, personnel resources, travel time, and response level. Classify personnel into qualified professionals with valve-closing tools, qualified temporary authorized personnel without their own tools, and unqualified auxiliary personnel involved in tool delivery. Pre-calculate various travel time parameters and valve operation time.

[0043] In this embodiment, information on valves to be closed, personnel resources, travel time between nodes, event response levels, and corresponding maximum allowable response times are collected. Personnel are categorized into three types: qualified professionals (I) carrying valve-closing tools, qualified temporary authorized personnel (Q) without their own tools, and unqualified auxiliary personnel (L) who can participate in tool delivery; the total number of personnel required for the valve-closing task is calculated. and the number of Category I personnel that can be dispatched The system pre-calculates and stores various travel time parameters and the fixed operation time for each valve. In this embodiment, the number of personnel (a=2) within a single emergency response team; the valve set contains 4 valves, none of which have valve wells; the minimum number of personnel required for each valve is 1, and the standard operation time is 10 minutes. Response levels are divided into 1 to 5, with a maximum allowable response time of 60 minutes for levels 1-2 and a maximum allowable response time of 30 minutes for levels 3-5, including a 10-minute slack time. The personnel resource pool includes 4 professional emergency response teams, 3 temporarily authorized personnel, and 3 support personnel. The system pre-calculates and stores the traffic time parameters between all nodes.

[0044] Specifically, establish a unified emergency response team for all on-duty personnel:

[0045] Each group has a fixed number of members, a=2, all of whom are qualified to shut off valves and carry their own tools.

[0046] Establish a set of valves to be closed:

[0047] Where m is the total number of valve closing points, and each valve closing point corresponds to the minimum number of workers required. and fixed work time .

[0048] Establish a set of emergency duty points:

[0049] Where k represents the number of emergency duty points.

[0050] The pre-calculated travel time parameters include the time it takes for the emergency response team to reach the valve directly, the time for transferring between valves, the time for temporarily authorized personnel to reach the valve, the time for temporarily authorized personnel to reach the emergency duty point, the time for auxiliary personnel to reach the emergency duty point, and the time for the emergency duty point to reach the valve. Among these, the transfer time between valves refers to the transfer time between two different valves, and its value varies depending on the distance between the valves.

[0051] Calculate the total number of personnel required for the valve shut-off task:

[0052] in, The minimum number of workers required to close valve point j.

[0053] S102: Based on the comparison between the total number of professional personnel and the total number of personnel required for the valve shut-off task, select either the simultaneous operation mode or the sequential operation mode.

[0054] In this embodiment of the application, based on the number of schedulable professionals Total number of personnel required for valve shut-off task The comparison results determine the appropriate job mode. When When this is triggered, a simultaneous operation mode is established, allowing emergency personnel to be assigned to each valve closure point to perform valve closure operations simultaneously. When the continuous operation mode is triggered, a valve shut-off task must be completed before proceeding to the next task point.

[0055] In this embodiment, if the total number of personnel required for the valve shut-off task is 3, then the number of available professional personnel... When ≥3, the simultaneous operation mode is triggered, supporting parallel operation by personnel on-board; when When the time is less than 3, the continuous operation mode is triggered, and personnel need to move between multiple valve closing points.

[0056] In one embodiment of this application, the time calculation for parallel operations by personnel within the rescue team includes: The time it takes for the emergency response team to complete the operation of a single valve is the sum of the travel time to reach the valve and the valve operation time. The time taken by the emergency response team to complete multiple valves is the maximum time taken to complete each valve. The completion time of subsequent valves needs to be accumulated by adding the completion time of the previous valve, the transfer time, and the current valve's operation time.

[0057] In one embodiment of this application, if the team is only responsible for one valve j1, the team's completion time is... ; If a team is responsible for multiple valves, and each team of 'a' members can work independently and simultaneously (for example, a rescue team has two members), then when team i is responsible for two valves j1 and j2 and performs tasks in the order j1 to j2, its completion time is: The completion time for valve j1 is:

[0058] Valve j2 completion time is

[0059] Since the two people work in parallel, the group's completion time is the maximum of the two:

[0060] in, This is the standard operating time required to close the valve.

[0061] S103: Establish a cost-optimal model, with the goal of minimizing the total number of people to be scheduled and the maximum allowable response time as a constraint, to solve for the minimum number of people to be scheduled.

[0062] In this embodiment, the model of the present invention belongs to the constrained integer linear programming problem, and its standard form conforms to the general form of optimization theory.

[0063] Establish a cost-optimal model with the objective function of minimizing the total number of dispatched personnel and the core constraint that the total valve closing time does not exceed the maximum allowable response time. Solve for the minimum manpower cost that satisfies the time constraint.

[0064] The cost objective function is to minimize the total number of people to be dispatched, expressed as:

[0065] in, To indicate the first A 0-1 variable indicating whether a rescue team has been dispatched. The number of personnel in each emergency response team; Cost constraints include: Variable range constraints are expressed as:

[0066]

[0067] in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as:

[0068] in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the transfer time between valves, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as:

[0069] in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: .

[0070] S104: Under the minimum number of dispatchers constraint, establish an efficiency-optimal model and solve the basic assignment scheme with the goal of minimizing the global completion time.

[0071] In this embodiment of the application, under the constraint of the minimum number of dispatched personnel Z1* obtained by solving the cost-optimal model, an efficiency-optimal model is established, with the minimum global completion time as the objective function, to solve the shortest time basic personnel assignment scheme with the minimum number of personnel.

[0072] The efficiency objective function is to minimize the total global completion time, expressed as:

[0073]

[0074] Where T is the set of completion times for all assignment schemes. ; The efficiency constraints include: The total number of dispatchers equals the minimum number of dispatchers, expressed as:

[0075] in, The minimum number of dispatchers obtained by solving the cost-optimal model; Variable range constraints are expressed as:

[0076]

[0077] in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as:

[0078] in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the transfer time between valves, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as:

[0079] in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: .

[0080] In one embodiment of this application, the basic assignment scheme is obtained by solving an integer linear programming model; When solving the integer linear programming model, if the problem size is less than a set threshold, the branch and bound method is used to obtain the global optimal solution. If the problem size is not less than a set threshold, a genetic algorithm is used to obtain an approximate optimal solution. The fitness function of the genetic algorithm is constructed based on the total number of people scheduled and the completion time.

[0081] In one embodiment of this application, the basic assignment scheme is obtained by solving an integer linear programming model. An initial feasible solution is generated using a greedy algorithm, prioritizing the allocation of the nearest valve to an idle rescue team. If the problem size is less than a set threshold, the branch and bound method is used to solve the integer linear programming model to obtain the globally optimal solution. If the problem size is not less than the set threshold, a genetic algorithm is used, with the total number of dispatched personnel and the total completion time as fitness functions, iterating through selection, crossover, and mutation operations to obtain an approximate optimal solution.

[0082] S105: If the basic assignment scheme does not meet the maximum allowable response time, a temporary authorization mechanism is activated to assign tasks to the qualified professionals who are carrying valve-closing tools and to determine the remaining valves.

[0083] In this embodiment of the application, it is determined whether the basic personnel assignment scheme meets the maximum allowable response time constraint specified by the corresponding response level: if it meets the constraint, the scheme is output; if it does not meet the constraint, a temporary authorization mechanism is initiated.

[0084] After initiating temporary authorization, enumerate all possible task combinations for qualified professionals carrying valve-closing tools, calculate the completion time for each combination, select the combination with the shortest completion time as the professional's final task, and determine the remaining unassigned valve-closing task set.

[0085] S106: Parallel computing is a tool self-collection scheme in which the qualified but unequipped temporary authorized personnel obtain the tools themselves and then perform the remaining tasks, and a tool collaborative delivery scheme in which the unqualified but participating auxiliary personnel deliver the tools to the temporary authorized personnel.

[0086] In this embodiment of the application, the maximum valve closing time and total number of dispatched personnel are specified for the parallel computing tool self-collection scheme and the tool collaborative delivery scheme.

[0087] Self-collection of tools: Temporarily authorized personnel will first go to the nearest emergency duty point to collect the valve-closing tools, and then proceed to the remaining valve-closing points to perform the operations. The formula for calculating the maximum valve-closing completion time under this plan is as follows:

[0088] The formula for calculating the total number of personnel to be dispatched under this plan is as follows:

[0089] in, The travel time for emergency response team i to travel directly from its current location to valve shut-off point j; The travel time for temporarily authorized personnel q to travel directly from their current location to the emergency duty station w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If personnel i is assigned to valve closing point j to perform valve closing operation, it is 1; otherwise, it is 0. It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0.

[0090] Tool Collaborative Delivery Solution: Temporarily authorized personnel are dispatched directly to the remaining valve-closing points to stand by. Simultaneously, auxiliary personnel closest to the corresponding emergency duty point are dispatched to collect the valve-closing tools and deliver them to that point. The formula for calculating the maximum valve-closing completion time under this solution is as follows:

[0091] The formula for calculating the total number of personnel to be dispatched under this plan is as follows:

[0092] in, The travel time for temporarily authorized personnel q to travel directly from their current location to valve shut-off point j; The travel time for assistant L to travel directly from the current location to the emergency duty point w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If personnel i is assigned to valve closing point j to perform valve closing operation, it is 1; otherwise, it is 0. It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0. The variable is 0-1. If the auxiliary personnel L is assigned to collect tools from the emergency duty point w and deliver them to the valve closing point j to perform valve closing operations, the value is 1; otherwise, the value is 0.

[0093] S107: Select the globally optimal solution based on the priority order of the fewest total number of dispatchers, the shortest completion time, and the largest safety margin.

[0094] In this embodiment of the application, a globally unified priority decision rule is used to select the optimal solution: First priority: Compare the total number of people to be scheduled for all feasible solutions and select the solution with the fewest total number of people to be scheduled; Second priority: If multiple schemes have the same total number of people to be scheduled, then the scheme with the shortest total completion time will be selected. Third priority: If multiple schemes have the same total number of dispatchers and total global completion time, the scheme with the larger safety margin is selected. The safety margin is the difference between the maximum allowed response time and the actual completion time. The scheme with the larger difference is selected.

[0095] The method described in this invention first scientifically classifies personnel and pre-calculates all travel time parameters, enabling rapid response to emergency dispatch needs and avoiding delays caused by real-time calculations. It also clearly defines the responsibilities of different personnel types, ensuring the dispatch process complies with safety and compliance requirements. This invention automatically switches operating modes based on the matching relationship between the total number of personnel in the professional emergency response team and the task requirements, fully leveraging the operational efficiency of multi-person emergency response teams. Simultaneously, the operating modes support parallel operations with personnel accompanying the vehicle, maximizing parallelism when personnel are sufficient to significantly shorten the total valve shut-off time; the sequential operation mode maximizes the utilization of limited professional personnel resources by rationally arranging the transfer sequence when personnel are insufficient. This invention creatively proposes a two-layer optimization architecture, strictly adhering to a globally unified priority order of safety first, cost second, and efficiency third: first, the total valve shut-off time is treated as an insurmountable hard constraint to ensure all solutions meet safety requirements; then, the solution with the lowest labor cost among all safe solutions is selected to maximize human resource conservation; finally, among solutions with the same cost, the most efficient solution is selected to further shorten the valve shut-off time. This architecture completely solves the subjective problem of weight setting in traditional weighted multi-objective methods, making dispatch decisions more objective, scientific, and in line with the actual operational needs of gas companies. This invention automatically triggers a temporary authorization mechanism when the basic solution is unsolvable, enabling timely expansion of the dispatching personnel and fully utilizing all qualified human resources within the enterprise to avoid valve closure timeouts due to insufficient personnel. It prioritizes assigning optimal task combinations to specialized emergency response teams with their own tools, leveraging their advantage of not requiring additional tool preparation and minimizing the completion time of basic tasks, thus freeing up more time for handling remaining tasks. This invention creatively proposes a collaborative tool delivery mode, which, compared to the traditional self-collection mode, enables parallelization of personnel arrival and tool delivery, significantly reducing the total valve closure time for temporarily authorized personnel. By parallel computing various indicators of the two solutions, the advantages and disadvantages of different solutions can be comprehensively evaluated, providing a basis for global optimal decision-making. The entire dispatching process is automated and standardized, avoiding the subjectivity and arbitrariness of human experience and ensuring the scientific and compliant nature of the dispatching plan.

[0096] The following specific embodiment illustrates the detailed implementation steps of the emergency valve shut-off personnel assignment method for complex gas pipeline networks based on two-layer optimization. This example includes two scenarios with different response levels, verifying that the principle of "minimum personnel priority" is always followed regardless of the response level.

[0097] (1) Scene parameter settings 1) Valve Closure Task: The number of personnel in a single emergency response team is a=2; the valve set includes 4 valves, none of which have valve wells. The minimum number of personnel required for each valve is 1, and the standard operation time is 10 minutes; the set of valves to be closed depends on the valve closure plan.

[0098] 2) Response time requirements: Level 1-2 responses must be completed within 60 minutes, Level 3-5 responses must be completed within 30 minutes, and the relaxation time is 10 minutes.

[0099] 3) Travel time parameters are shown in Table 1: Table 1 Traffic Time Parameters

[0100] 4) Personnel resource parameters include: optional emergency response team resource pool, temporary authorized resource pool (with emergency response qualifications but without tools), and dispatchable auxiliary personnel (without emergency response qualifications), as shown in Tables 2-4 respectively: Table 2 Optional Emergency Response Team Resource Pool

[0101] Table 3 Temporary Authorized Resource Pool

[0102] Table 4. Available Support Personnel

[0103] Scenario 1: The emergency response team is in an idle state, with a response level of 2. The task of shutting down valves is to shut down valves J1, J2, and J3.

[0104] In this scenario, there are 8 available professional personnel. The on-duty emergency response personnel meet the minimum total number required for the valve shut-off task. Therefore, emergency response personnel can be assigned to each valve shut-off point to perform valve shut-off operations simultaneously. The response level is level 2, the maximum allowable time is one hour, and the cost is minimal. Therefore, it is recommended to complete the operation of the three valves in one group. All feasible solutions are listed in Tables 5-8. Table 5 Feasible Solutions for I1

[0105] Table 6 Feasible Solutions for I2

[0106] Table 7 Feasible Solutions for I3

[0107] Table 8 Feasible Solutions for I4

[0108] The first level: the lowest cost, which means dispatching a rescue team within the maximum allowable time.

[0109] Second layer: Efficiency optimization: Select the scheme with the shortest total time from a set of scheduling schemes.

[0110] The I3 team is scheduled to complete the task in 35 minutes. The optimal work sequence is J1→J2→J3. When the team arrives at the valve closing point J1, the first emergency worker is dropped off. The second emergency worker then goes to J2 to complete the valve closing task. After completing the task at J2, the team goes to J3 to complete the valve closing task.

[0111] Scenario 2: Only Group A is schedulable, response level 4, valve shut-off tasks are shutting off valves J1, J2, J3, and J4. In this scenario, the number of dispatchable professionals is 2 < 4, triggering a continuous operation mode. Group I1 adopts a vehicle-based, personnel-assigned operation method. Feasible solutions for I1 include each person responsible for 2 valves; one person responsible for 1 valve; and one person responsible for 3 valves. Feasible solutions are shown in Tables 9 and 10. Table 9. Feasible plans for each person to be responsible for 2 valves.

[0112] Table 10: Feasible solutions with 1 person in charge of 1 solution and 1 person in charge of 3 solutions.

[0113] Since the response level is 4, the maximum allowed time range is 30 minutes, the relaxation time is 10 minutes, but the fastest assignment time is 49 minutes, a temporary authorization scheme is activated.

[0114] (1) Optimal task breakdown for basic personnel Enumerate all possible feasible task combinations for group I1, and select the combination that minimizes its own completion time and allows the remaining tasks to be covered by temporarily authorized personnel. The optimal task splitting combination is shown in Table 11: Table 11 Optimal Allocation Scheme for Group I1

[0115] (2) Comparison of temporary authorization schemes 1) Option 1: Personnel Q collects the tools themselves. Group I1 is responsible for valves J1 and J2 (to be completed in 22 minutes). Two people from q1 / q2 / q3 will first go to the emergency duty point to collect tools, and then go to valves J3 and J4 respectively to work. The specific assignment plan is shown in Table 12: Table 12 Tool Self-Assignment Scheme

[0116] Result of Option 1: Total completion time T = min(22, 26, 28) = 28 minutes; Total number of people to be scheduled is N = 2 + 2 = 4.

[0117] 2) Option 2: Tool Collaborative Delivery Assignment Solution Group I1 is responsible for valves J1 and J2 (to be completed in 22 minutes). Two people from q1 / q2 / q3 will be selected to go directly to valves J3 and J4 to stand by. At the same time, the auxiliary personnel closest to the emergency duty point will be dispatched to collect tools and deliver them to the site. The specific assignment plan is shown in Table 13. Table 13 Tool Collaborative Delivery Assignment Scheme

[0118] Result of Option 2: Total completion time T = min(22, 25, 26) = 26 minutes; Total number of people to be scheduled is N = 2 + 2 + 2 = 6 people.

[0119] 3) Final optimal temporary authorization scheme Both options meet the Level 4 response requirements. Based on the principle of cost priority, the temporary authorization option one is selected.

[0120] The optimal solution at this point is: Group I1 is responsible for J1 and J2, working simultaneously. Dispatchers q2 and q1 go to the emergency duty point to collect their tools and then proceed to J3 and J4 respectively. The total completion time is 28 minutes, and the total number of dispatchers is 4.

[0121] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0122] In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 2As shown, the computer device includes a processor, memory, communication interface, display screen, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, mobile cellular networks, NFC (Near Field Communication), or other technologies. When executed by the processor, the computer program implements a two-layer optimized method for personnel assignment of emergency valve shut-off in complex gas pipeline networks. The display screen can be an LCD screen or an e-ink screen. The input devices can be a touch layer covering the display screen, buttons, a trackball, or a touchpad on the computer device's casing, or an external keyboard, touchpad, or mouse.

[0123] Those skilled in the art will understand that Figure 2 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0124] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0125] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps in the above method embodiments.

[0126] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0127] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0128] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments described above. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0129] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0130] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A method for assigning personnel to handle emergency valve shut-off in complex gas pipeline networks based on two-layer optimization, characterized in that, The method includes: Collect information on valves to be closed, personnel resources, travel time, and response level. Classify personnel into qualified professionals with valve-closing tools, qualified temporary authorized personnel without personal tools, and unqualified auxiliary personnel involved in tool delivery. Pre-calculate various travel time parameters and valve operation time. Based on the comparison between the total number of professional personnel and the total number of personnel required for the valve shut-off task, select either the simultaneous operation mode or the sequential operation mode. Establish a cost-optimal model, with the goal of minimizing the total number of dispatchers and the constraint of the maximum allowable response time, to solve for the minimum number of dispatchers; An optimal efficiency model is established under the minimum number of dispatchers constraint, and the basic assignment scheme is solved with the goal of minimizing the global completion time. If a basic assignment scheme that meets the maximum allowable response time cannot be obtained under the minimum number of dispatchers, a temporary authorization mechanism is activated. When assigning tasks to the qualified professionals who are carrying valve-closing tools, all feasible task combinations are enumerated, and the combination that minimizes the completion time of the professional and allows the remaining tasks to be covered by the temporarily authorized personnel is selected. The remaining valve set is then determined based on this combination. Parallel computing involves a self-service tool retrieval scheme where qualified but unequipped temporary authorized personnel acquire tools to perform the remaining tasks, and a collaborative tool delivery scheme where unqualified but involved tool delivery personnel deliver tools to the temporary authorized personnel. In the self-service tool retrieval plan, temporarily authorized personnel first go to the emergency duty point to retrieve the tools before proceeding to work on the remaining valves. The completion time for the self-service tool retrieval plan is expressed as follows: The formula for calculating the total number of dispatchers for the tool self-collection plan is as follows: in, This is a 0-1 variable, representing whether group i is responsible for valve j; if so, it is 1, otherwise it is 0. For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the valve transfer time, The travel time for personnel i to travel directly from their current location to the emergency duty station w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0. In the tool collaborative delivery scheme, temporarily authorized personnel go directly to the remaining valves to stand by, while auxiliary personnel retrieve the tools from the emergency duty point and deliver them. The completion time of the tool collaborative delivery scheme is expressed as follows: The formula for calculating the total number of dispatchers in a collaborative delivery solution for tools is as follows: in, The travel time for temporarily authorized personnel q to travel directly from their current location to valve shut-off point j; The travel time for assistant L to travel directly from the current location to the emergency duty point w; The travel time from emergency duty point w to valve shut-off point j; It is a 0-1 variable. If the temporarily authorized personnel q is assigned to the valve closing point j to perform the valve closing operation, it is 1; otherwise, it is 0. The variable is 0-1. If the auxiliary personnel L is assigned to collect tools from the emergency duty point w and deliver them to the valve closing point j to perform valve closing operations, the value is 1; otherwise, the value is 0. The optimal global solution is selected based on the priority order of having the fewest total number of dispatchers, the shortest completion time, and the largest safety margin.

2. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization as described in claim 1, characterized in that, The collection of information on valves to be closed, personnel resources, travel time, and response level categorizes personnel into qualified professionals carrying valve-closing tools, qualified temporary authorized personnel without their own tools, and unqualified auxiliary personnel involved in tool delivery. Pre-calculation of various travel time parameters and valve operation time includes: Establish a set of emergency response teams, a set of valves to be closed, and an emergency duty station. Each emergency response team contains a fixed number of personnel, all of whom are qualified and carry valve-closing tools. Each valve has a minimum number of operators and a fixed operating time. The pre-calculated travel time parameters include the time for the emergency response team to reach the valve directly, the time for transferring between valves, the time for temporarily authorized personnel to reach the valve, the time for temporarily authorized personnel to reach the emergency duty point, the time for auxiliary personnel to reach the emergency duty point, and the time for the emergency duty point to reach the valve.

3. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization as described in claim 1, characterized in that, The simultaneous operation mode refers to the operation of each valve in parallel when the total number of professional personnel is not less than the total number of personnel required for the task. The sequential operation mode is that when the total number of professional personnel is less than the total number of personnel required for the task, the same emergency response team will perform multiple valve tasks in sequence.

4. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization as described in claim 2, characterized in that, The calculation of time for parallel operations by personnel within the emergency response team includes: The time it takes for the emergency response team to complete the operation of a single valve is the sum of the travel time to reach the valve and the valve operation time. The time taken by the emergency response team to complete multiple valves is the maximum time taken to complete each valve. The completion time of subsequent valves needs to be accumulated by adding the completion time of the previous valve, the transfer time, and the current valve's operation time.

5. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization, as described in claim 2, is characterized in that... The cost-optimal model includes a cost objective function and cost constraints: The cost objective function is to minimize the total number of people to be scheduled, expressed as: in, To indicate the first A 0-1 variable indicating whether a rescue team has been dispatched. The number of personnel in each emergency response team; The cost constraints include: Variable range constraints are expressed as follows: in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as: in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the valve transfer time, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as: in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: 。 6. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization, as described in claim 5, is characterized in that... The optimal efficiency model includes an efficiency objective function and efficiency constraints: The efficiency objective function is to minimize the total global completion time, expressed as: Where T is the set of completion times for all assignment schemes. ; The efficiency constraints include: The total number of dispatchers equals the minimum number of dispatchers, expressed as: in, The minimum number of dispatchers obtained by solving the cost-optimal model; Variable range constraints are expressed as follows: in, It is a 0-1 variable, indicating whether group i is responsible for valve j; if it is, it is 1, otherwise it is 0. It is a 0-1 variable, indicating whether group i is scheduled; if it is scheduled, it is 1, otherwise it is 0. Time constraints: The maximum completion time of all relevant valve points shall not exceed the maximum allowable response time for the corresponding response level, expressed as: in, For the time it takes for the emergency response team to reach the valve, The standard operating time required to close the valve. For the valve transfer time, This is the maximum allowable response time. Personnel constraints: The number of operators assigned to each valve closing point must not be less than the minimum number of personnel required for that valve, expressed as: in, For the first A rescue team was dispatched to the first Number of operators per valve For the first Minimum number of operators required for each valve; Group splitting constraints: Each emergency response team can serve a maximum of no more than [number missing] people simultaneously performing valve shut-off tasks. One valve, represented as: 。 7. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization as described in claim 1, characterized in that, The basic assignment scheme is obtained by solving an integer linear programming model. When solving the integer linear programming model, if the problem size is less than a set threshold, the branch and bound method is used to obtain the global optimal solution. If the problem size is not less than a set threshold, a genetic algorithm is used to obtain an approximate optimal solution. The fitness function of the genetic algorithm is constructed based on the total number of people scheduled and the completion time.

8. The method for assigning personnel to emergency valve shut-off in complex gas pipeline networks based on two-layer optimization as described in claim 1, characterized in that, The selection of the globally optimal solution includes: First, compare the total number of dispatchers and select the option with the fewest total dispatchers; When the total number of dispatchers is the same, compare the total global completion time and select the solution with the shortest total global completion time; When the total number of dispatchers and the total global completion time are the same, the safety margin is compared. The safety margin is the difference between the maximum allowable response time and the actual completion time, and the scheme with the larger difference is selected.

Images