Hydroelectric power plant maintenance task allocation method considering time dynamic dependence
By constructing a maintenance task allocation model that takes into account time dynamic dependence, the problems of low resource utilization and time uncertainty in the scheduling of maintenance tasks in hydropower plants are solved, and the rapid and efficient allocation and timely completion of maintenance tasks are achieved, thereby improving work efficiency and income.
Patent Information
- Application Number
- CN202410894439.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-04
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-07-04
AI Technical Summary
Existing technologies suffer from low resource utilization, low personnel efficiency, high time costs, and uncertainty in maintenance schedules at hydropower plants, resulting in inefficiency in both the preparation and execution of maintenance tasks.
A maintenance task allocation model considering dynamic time dependencies is established. By constructing maintenance preparation time and process time models, the uncertainty of maintenance personnel movement and tool preparation time is taken into account. The shortest path is calculated by combining Dijkstra's algorithm, and K-means clustering method is used to handle the uncertainty of maintenance process time. An objective function is established to minimize the system's water wastage power and the latest completion time.
This enabled rapid and efficient allocation of maintenance tasks, improved work efficiency, reduced labor costs, ensured that maintenance tasks were completed on time and to a high standard, and enhanced the overall maintenance efficiency and revenue of the hydropower plant.
Smart Images

Figure CN119005558A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of maintenance dispatching of hydropower stations, and in particular to a method for allocating maintenance tasks of hydropower stations taking into account time dynamic dependency. Background Art
[0002] A hydroelectric power plant has multiple hydroelectric units. Every year, the operating personnel will arrange the A, B, C, and D maintenance of the units, the complete maintenance, partial maintenance, and annual maintenance of the transmission lines and circuit breakers, and the maintenance period of each equipment based on factors such as historical and real-time water inflow conditions, the maintenance history of the units in previous years, and the number of maintenance team members.
[0003] After the maintenance task is arranged, first, the operation department implements safety measures, and then the maintenance department issues invoices for the corresponding maintenance work. During this period, the production department faces difficulties such as a large number of equipment types, fast personnel turnover, and heavy transformation tasks, which inevitably lead to many overlapping work faces during the maintenance period. At this time, the director of the maintenance department generally conducts manual evaluation of the total amount of work tasks, the estimated completion time of a single work face, the arrival time of maintenance personnel, and the areas of expertise of each person based on the number of work faces on that day, the arrival of personnel, and past maintenance experience, and arranges everyone's work tasks and work order for the day based on experience.
[0004] However, arranging maintenance tasks based on experience will lead to negative effects such as low resource utilization, low staff efficiency, high time cost, some employees have to run back and forth on multiple work surfaces, and need to work overtime every day to complete the work on schedule; moreover, the maintenance task preparation time (including spare parts and tools preparation time, travel time from the office to the maintenance site) and the actual maintenance work time together lead to the maintenance time of a single work surface having time dynamic dependence, which is specifically reflected in: ① The travel time from the office to the maintenance site, the spare parts and tool replenishment time are all uncertain, which is recorded as the maintenance preparation time uncertainty; ② The maintenance time is uncertain due to the different majors of maintenance personnel, different work status on the day, and the time to return to the office or warehouse to get tools because they forgot to bring tools, which is recorded as the maintenance process time uncertainty. Summary of the invention
[0005] In response to the problems in the above background technology, the present invention provides a method for allocating maintenance tasks of a hydropower plant taking into account dynamic time dependence, which can quickly, efficiently and effectively allocate maintenance tasks of a hydropower plant, improve work efficiency, reduce labor costs, and complete maintenance tasks on time with guaranteed quality and quantity.
[0006] In order to realize the above-mentioned technical features, the purpose of the present invention is achieved as follows: a method for allocating maintenance tasks of a hydropower plant taking into account dynamic time dependency, firstly, a maintenance preparation time model taking into account the uncertainties of the movement time of maintenance personnel to reach the maintenance site and the tool preparation time is proposed; then, a maintenance process time model taking into account the uncertainty of the maintenance time of a single working face is proposed, and the maintenance preparation time model and the maintenance process time model are converted into maintenance constraints of a maintenance task allocation model; finally, under the constraint of the maximum power generation power allowed by the State Grid Dispatching Center, with minimizing the system's abandoned water power and minimizing the latest completion time of all maintenance tasks as the objective function, a maintenance task allocation model for a hydropower plant taking into account dynamic time dependency is established by considering maintenance constraints, hydraulic system operation constraints, and equipment post-maintenance commissioning constraints.
[0007] The specific modeling process of the maintenance preparation time model is as follows:
[0008] For hydropower plants, the maintenance department is divided into five departments: automatic, power generation, measurement and control, protection, and machinery. Each department is divided into more detailed equipment management groups. When the power plant issues a maintenance task r to the maintenance department g, each team will assign the task to the corresponding equipment management group s, where g = 1, 2, 3, 4, 5 represent the automatic, power generation, measurement and control, protection, and machinery departments respectively; s = 1, 2, 3, ... represent the sth equipment management group in a single department respectively;
[0009] Assumptions It represents the preparation time for the s team of the maintenance department g to complete the maintenance task r;
[0010] Adopt G g,s represents the g department s group, where G g,s When accepting r task, Need to consider before this G g,s Have you performed other tasks? Includes the following:
[0011]
[0012] In the formula, represents the maintenance preparation time of task r; It represents the number of spare parts remaining after team s of department g completes task r1; M represents the maximum number of spare parts that team s of department g can carry; g,s,r represents the number of spare parts required by team s in department g to perform task r; represents the Dirac function, that is, when hour, when hour, vg,s represents the average walking speed of team s in department g; Represents the time taken by maintenance personnel to prepare spare parts in the warehouse; p represents the warehouse location; Dis(r1,p,r) represents the shortest distance function between the location of maintenance personnel at task r1, the location of warehouse p, and the location of task r, which is calculated here using the Dijkstra shortest path algorithm; Dis(r1,r) represents the shortest distance function between the location of task r1 and the location of task r, which is calculated here using the Dijkstra shortest path algorithm.
[0013] The maintenance preparation time is uncertain. Based on this, in order to characterize the uncertainty of the time it takes for the team to complete the task, β g,s Indicator to indicate actual completion time Completion time The ratio between
[0014] Different teams will have different β g,s , β g,s The calculation method includes the following steps:
[0015] Step 1: Establish a historical time database of department g team s completing a certain task over the years, assuming For a set of historical data, record N sets of data;
[0016] Step 2: Adoption Get the uncertainty index β of department g team s for many years g,s ;
[0017] Step 3: Obtain the probability distribution of the uncertainty parameters of the team maintenance time through a data-driven method, and fit the historical data of the maintenance time of different teams to obtain the corresponding probability density distribution. The more historical data there are, the more accurate the probability distribution will be.
[0018] Step 4: Use K-means clustering method to obtain typical scenarios of maintenance time uncertainty for each team;
[0019] According to the typical scenario fitted, the maintenance preparation time is expressed as:
[0020] The specific modeling process of the maintenance process time model is as follows:
[0021] During the maintenance process, the uncertainty of maintenance time comes from three aspects: ① If a maintenance tool is not brought, it is necessary to return to the warehouse or office to find the tool, which affects the maintenance process time; ② In different on-site environments, the difficulty of performing the same task varies, which leads to different maintenance times; ③ Different teams and different professionals have different efficiency when handling the same maintenance task; therefore, the maintenance time of each maintenance task is difficult to accurately estimate;
[0022] Based on this, the present invention assumes that the maintenance process time obeys a truncated normal distribution, and its probability density function is expressed as:
[0023]
[0024] In the formula, Indicates the maintenance process time; represent the mean and standard deviation of the paternal normal distribution, respectively; represents variance; a and b represent the lower and upper bounds of the truncation interval respectively; represents the probability density function; φ(·), Φ(·) represent the probability density function and cumulative distribution function of the parent normal distribution, respectively;
[0025] Then the cumulative distribution function of the maintenance process time is:
[0026]
[0027] In the formula, represents the cumulative distribution function;
[0028] The mean value of maintenance process time μ 1 for:
[0029]
[0030] Standard deviation of maintenance process time σ 1 for:
[0031]
[0032] In the formula, α and β are intermediate variables;
[0033] For the maintenance process time, assume but In the interval (a,b), we have:
[0034]
[0035] Therefore, the probability density function of the maintenance process time is derived as:
[0036]
[0037] According to formula (9), the maintenance process time for the s group of the maintenance department g to complete the r maintenance task can be sampled.
[0038] The maintenance model constraint conditions of the maintenance constraint are as follows:
[0039] When the maintenance sequence is a variable to be determined, the maintenance sequence and maintenance preparation time need to be reflected in the form of constraints. Maintenance process time the connection between;
[0040] ① Maintenance constraints:
[0041]
[0042]
[0043] In the formula, S g,s,r,r2 Represents the maintenance order. If the maintenance order of department g team s is: task r first and then r2, then S g,s,r,r2 =1, otherwise S g,s,r,r2 =0;S g,s,r1,r Represents the maintenance order. If the maintenance order of team s in department g is: task r1 first and then r, then S g,s,r1,r =1, otherwise S g,s,r1,r =0;S g,s,p,r Represents the maintenance order. If the maintenance order of team s in department g is: task p first and then task r, then S g,s,p,r =1, otherwise S g,s,p,r =0; Z b represents the set of all teams in department g; Z g It represents the combination of automation, power generation, measurement and control, protection, and machinery; Z a , Z d and Z e They correspond to the task nodes, start nodes and virtual end nodes in the set, and the virtual end node indicates the end of the maintenance sequence of all maintenance groups; if the team s of the maintenance department g starts from the warehouse p, then ξ g,s,p =1;h r Indicates the start time of maintenance; f p The departure time from warehouse p is set as time 0; f r 、f r1 represents the maintenance completion time of task r and task r1; y r,t Indicates whether component r can be put into operation at time t, 1 indicates that it is put into operation; r, r1, r2 are the maintenance task numbers, and the order is: r1, r, r2; M is a large number; t indicates time; χ indicates the latest completion time of the task in a day;
[0044] In constraint (16), maintenance preparation time Maintenance process time It is still a variable. According to the maintenance preparation time model, the maintenance preparation time The constraints are expressed as:
[0045]
[0046] Constraints (20) and (22) mean that if S g,s,r1,r =1, then The calculation formula is (1); otherwise, Constraint (23) is the same as constraint (2); constraint (24) can be used to achieve the Logical judgment; Constraint (25) represents the number of spare parts initially brought by team s of department g; T represents the time interval;
[0047] ② Equipment commissioning constraints:
[0048] The maintenance task decision model of a hydropower plant needs to further consider the operation sequence of equipment after maintenance is completed. Based on this, the following constraints are used to represent this operation problem:
[0049]
[0050] In the formula, Z n and Z l Respectively represent the connection points of the hydropower plant units and the high-voltage line set; n and l represent the connection points of the nth unit and the lth line; o(l) and p(l) represent the first and last nodes of line l; j i,t 、j i,t-1 Respectively represent the actual operating status of device i at time t and t-1; j l,t Indicates the actual operating status of device l at time t; j o(l),t ,j p(l),t Respectively represent the actual operating status of the beginning and end of line l at time t; y n,t ,y l,t They represent the operational status of equipment n and equipment l respectively;
[0051] In the formula, the constraint on the right is nonlinear, and the nonlinear term is linearized into the following constraint condition:
[0052]
[0053] In the formula, y l,t , j o(l),t 、j p(l),t If one of them is 0, then j l,t is equal to 0, which means that line l cannot be put into operation at time t;
[0054] ③System operation constraints:
[0055] 1) Power balance constraints:
[0056]
[0057] In the formula, A G ,A Line They represent the correlation matrix respectively; represents the power flow of line l at hour t; It represents the dispatching demand of the National Electric Power Dispatching Center for the power plant at the i-th contact unit in the t period; represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during period t; represents the power generated by the unit at the i-th node abandoning water at time t; θ i,t represents the voltage phase angle of node i at hour t; θ j,t represents the voltage phase angle of node j at hour t; X ij represents the reactance of line (i, j);
[0058] 2) Phase angle upper and lower limit constraints:
[0059] θ i,t,min ≤θ i,t ≤θ i,t,max (34)
[0060] θ i,t,min ,θ i,t,max They represent the minimum and maximum voltage phase angles of node i at the tth moment respectively;
[0061] 3) Upper and lower limits of hydroelectric generator power
[0062]
[0063] In the formula, They represent the minimum output power and maximum output power of hydropower unit i at time t respectively;
[0064] 4) Hydropower generator climbing constraints:
[0065]
[0066] In the formula, They represent the upward or downward climbing rate of hydropower unit i at time t respectively; represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during the period t-1;
[0067] 5) Reservoir water constraints:
[0068]
[0069] Where V t Hrepresents the reservoir storage capacity at time t, q t represents the reservoir water flow at time t, Q t It represents the power generation flow rate used by the hydropower unit at time t, and Δt is the time interval;
[0070] 6) Reservoir capacity constraints:
[0071]
[0072] Where V t H represents the water storage capacity of the reservoir at time t, and They represent the maximum and minimum values of the reservoir capacity respectively.
[0073] The maintenance task decision objective function is as follows:
[0074] The optimization goal of the maintenance task decision model is to minimize the system water abandonment power and minimize the latest completion time of all maintenance tasks. Therefore, the overall objective function of the maintenance task decision problem is:
[0075]
[0076] In the formula, ω 1 and ω 2 They represent the weights of the abandoned water power and the latest completion time of the maintenance task respectively; Ψ represents the overall objective function.
[0077] The objective function and constraints of comprehensive maintenance task decision-making, as well as mathematical programming problems, are solved using Gurobi10.0.3 on the Matlab platform.
[0078] The present invention has the following beneficial effects:
[0079] 1. A method for allocating maintenance tasks of a hydropower plant taking into account dynamic time dependence of the present invention can quickly, efficiently and effectively allocate maintenance tasks of a hydropower plant, improve work efficiency, reduce labor costs, ensure quality and quantity, and complete maintenance tasks on time.
[0080] 2. The computational complexity of the maintenance task decision model of the present invention is related to the number of maintenance process time uncertainty scenarios. Therefore, the present invention uses the K-means clustering method to process the uncertainty of the maintenance process time to obtain typical scenarios of the maintenance process time. BRIEF DESCRIPTION OF THE DRAWINGS
[0081] Figure 1 It is a process diagram for arranging maintenance of the present invention.
[0082] Figure 2 This is the data flow diagram of the maintenance task decision model of the present invention. DETAILED DESCRIPTION
[0083] The embodiments of the present invention are further described below in conjunction with the accompanying drawings.
[0084] Embodiment 1:
[0085] See also Figure 1-2 A maintenance task allocation method for a hydropower plant considering dynamic time dependency is proposed. Firstly, a maintenance preparation time model is proposed which takes into account the uncertainties of the travel time of maintenance personnel to the maintenance site and the tool preparation time. Then, a maintenance process time model is proposed which takes into account the uncertainty of the maintenance time of a single working face, and the maintenance preparation time model and the maintenance process time model are transformed into maintenance constraints of the maintenance task allocation model. Finally, under the constraint of the maximum power generation power allowed by the State Grid Dispatching Center, the maintenance task allocation model for a hydropower plant considering dynamic time dependency is established with the objective functions of minimizing the system abandoned water power and minimizing the latest completion time of all maintenance tasks, considering the maintenance constraints, the hydraulic system operation constraints, and the equipment post-maintenance commissioning constraints.
[0086] Embodiment 2:
[0087] 1. The specific modeling process of the maintenance preparation time model is as follows:
[0088] For a hydroelectric power plant, the maintenance department is divided into five departments: automatic, power generation, measurement and control, protection, and machinery. Each department is further divided into more detailed equipment management groups. When the power plant issues a maintenance task r to the maintenance department g, each team will assign the task to the corresponding equipment management group s, where g = 1, 2, 3, 4, 5 represent the automatic, power generation, measurement and control, protection, and machinery departments respectively; s = 1, 2, 3, ... represent the sth equipment management group in a single department respectively; the present invention assumes It represents the preparation time for the s group of the maintenance department g to complete the maintenance task r; the following uses G g,s Indicates g department s group.
[0089] Among them, it should be noted that G g,s When accepting r task, Need to consider before this G g,s Have you performed other tasks? Includes the following:
[0090]
[0091] In the formula, represents the maintenance preparation time of task r; It represents the number of spare parts remaining after team s of department g completes task r1; represents the maximum number of spare parts that team s of department g can carry; Mg,s,r represents the number of spare parts required by team s in department g to perform task r; represents the Dirac function, that is, when hour, when hour, v g,s represents the average walking speed of team s in department g; Represents the time taken by maintenance personnel to prepare spare parts in the warehouse; p represents the warehouse location; Dis(r1,p,r) represents the shortest distance function between the location of maintenance personnel at task r1, the location of warehouse p, and the location of task r, which is calculated here using the Dijkstra shortest path algorithm; Dis(r1,r) represents the shortest distance function between the location of task r1 and the location of task r, which is calculated here using the Dijkstra shortest path algorithm.
[0092] It should be noted that the above analysis shows that the maintenance preparation time is uncertain. Based on this, in order to characterize the uncertainty of the team's task completion time, β g,s Indicator to indicate actual completion time Completion time The ratio between
[0093] Generally speaking, different teams will have different β g,s , β g,s The calculation method includes the following steps:
[0094] Step 1: Establish a historical time database of department g team s completing a certain task over the years, assuming For a set of historical data, record N sets of data;
[0095] Step 2: Adoption Get the uncertainty index β of department g team s for many years g,s ;
[0096] Step 3: Obtain the probability distribution of the uncertainty parameters of the team maintenance time through a data-driven method, and fit the historical data of the maintenance time of different teams to obtain the corresponding probability density distribution. The more historical data there are, the more accurate the probability distribution will be.
[0097] Step 4: Use K-means clustering method to obtain typical scenarios of maintenance time uncertainty for each team;
[0098] Therefore, according to the typical scenario fitted, the maintenance preparation time is expressed as:
[0099] 2. The specific modeling process of the maintenance process time model is as follows:
[0100] During the maintenance process, the uncertainty of maintenance time comes from three aspects: ① If a maintenance tool is not brought, it is necessary to return to the warehouse or office to find the tool, which affects the maintenance process time; ② In different on-site environments, the difficulty of performing the same task varies, which leads to different maintenance times; ③ Different teams and different professionals have different efficiency when handling the same maintenance task; therefore, the maintenance time of each maintenance task is difficult to accurately estimate;
[0101] It should be noted that the time uncertainty of a team completing a maintenance task will affect the total completion time of the maintenance task, which may in turn affect the power delivery time of the unit or line, causing huge economic losses to the hydropower plant. Therefore, it is crucial to find a suitable model to describe the time uncertainty of different teams completing a maintenance task.
[0102] Therefore, the present invention assumes that the maintenance process time obeys a truncated normal distribution, and its probability density function is expressed as:
[0103]
[0104] In the formula, Indicates the maintenance process time; represent the mean and standard deviation of the paternal normal distribution, respectively; represents variance; a and b represent the lower and upper bounds of the truncation interval respectively; represents the probability density function; φ(·), Φ(·) represent the probability density function and cumulative distribution function of the parent normal distribution, respectively;
[0105] Then the cumulative distribution function of the maintenance process time is:
[0106]
[0107] In the formula, represents the cumulative distribution function;
[0108] The mean value of maintenance process time μ 1 for:
[0109]
[0110] Standard deviation of maintenance process time σ 1 for:
[0111]
[0112] In the formula, α and β are intermediate variables.
[0113] For the maintenance process time, assume but In the interval (a,b), we have:
[0114]
[0115] Therefore, the probability density function of the maintenance process time can be derived as:
[0116]
[0117] According to formula (9), the maintenance process time for the s group of the maintenance department g to complete the r maintenance task can be sampled.
[0118] However, the computational complexity of the maintenance task decision model is related to the number of maintenance process time uncertainty scenarios. Therefore, the present invention adopts the K-means clustering method to deal with the uncertainty of the maintenance process time to obtain typical scenarios of the maintenance process time.
[0119] 3. Maintenance model constraints The specific maintenance model constraints are:
[0120] The above maintenance preparation time model and maintenance process time model provide a method for calculating the total maintenance time when the maintenance sequence is known. When the maintenance sequence is a variable to be determined, the maintenance sequence and maintenance preparation time need to be reflected in the form of constraints. Maintenance process time the connection between;
[0121] ① Maintenance constraints:
[0122]
[0123]
[0124] In the formula, S g,s,r,r2 Represents the maintenance order. If the maintenance order of department g team s is: task r first and then r2, then S g,s,r,r2 =1, otherwise S g,s,r,r2 =0;S g,s,r1,r Represents the maintenance order. If the maintenance order of team s in department g is: task r1 first and then r, then S g,s,r1,r =1, otherwise S g,s,r1,r =0;S g,s,p,r Represents the maintenance order. If the maintenance order of team s in department g is: task p first and then task r, then S g,s,p,r =1, otherwise S g,s,p,r =0; Z b represents the set of all teams in department g; Z g It represents the combination of automation, power generation, measurement and control, protection, and machinery; Z a , Z d and Z eThey correspond to the task nodes, start nodes and virtual end nodes in the set, and the virtual end node indicates the end of the maintenance sequence of all maintenance groups; Figure 1 As shown; if the team s of the maintenance department g starts from warehouse p, then ξ g,s,p =1;h r Indicates the start time of maintenance; f p The departure time from warehouse p is set as time 0; f r 、f r1 represents the maintenance completion time of task r and task r1; y r,t Indicates whether component r can be put into operation at time t, 1 means it is put into operation; r, r1, r2 are the maintenance task numbers, and the order is: r1, r, r2; M is a large number; t represents time; χ represents the latest completion time of the task in a day.
[0125] In constraint (16), maintenance preparation time Maintenance process time It is still a variable. According to the maintenance preparation time model, the maintenance preparation time The constraints are expressed as:
[0126]
[0127]
[0128] Constraints (20) and (22) mean that if S g,s,r1,r =1, then The calculation formula is (1); otherwise, Constraint (23) is the same as constraint (2); constraint (24) can be used to achieve the logical judgment; constraint (25) represents the number of spare parts initially brought by team s of department g; T represents the time interval.
[0129] ② Equipment commissioning constraints:
[0130] The maintenance task decision model of a hydropower plant needs to further consider the operation sequence of equipment after maintenance is completed. Based on this, the following constraints are used to represent this operation problem:
[0131]
[0132] In the formula, Z n and Z l Respectively represent the connection points of the hydropower plant units and the high-voltage line set; n and l represent the connection points of the nth unit and the lth line; o(l) and p(l) represent the first and last nodes of line l; j i,t 、j i,t-1 Respectively represent the actual operating status of device i at time t and t-1; jl,t Indicates the actual operating status of device l at time t; j o(l),t ,j p(l),t Respectively represent the actual operating status of the beginning and end of line l at time t; y n,t ,y l,t They represent the operational status of equipment n and equipment l respectively;
[0133] In the formula, the constraint on the right is nonlinear. The present invention linearizes the nonlinear term into the following constraint condition:
[0134]
[0135] In the formula, y l,t , j o(l),t 、j p(l),t If one of them is 0, then j l,t is equal to 0, which means that line l cannot be put into operation at time t;
[0136] ③System operation constraints:
[0137] 1) Power balance constraints:
[0138]
[0139] In the formula, A G ,A Line They represent the correlation matrix respectively; represents the power flow of line l at hour t; It represents the dispatching demand of the National Electric Power Dispatching Center for the power plant at the i-th contact unit in the t period; represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during period t; represents the power generated by the unit at the i-th node abandoning water at time t; θ i,t represents the voltage phase angle of node i at hour t; θ j,t represents the voltage phase angle of node j at hour t; X ij represents the reactance of line (i, j);
[0140] 2) Phase angle upper and lower limit constraints:
[0141] θ i,t,min ≤θ i,t ≤θ i,t,max (34)
[0142] θ i,t,min ,θ i,t,max They represent the minimum and maximum voltage phase angles at node i at the tth moment respectively.
[0143] 3) Upper and lower limits of hydroelectric generator power
[0144]
[0145] In the formula, They represent the minimum output power and maximum output power of hydropower unit i at time t respectively;
[0146] 4) Hydropower generator climbing constraints:
[0147]
[0148] In the formula, They respectively represent the upward or downward climbing rate of hydropower unit i at time t. represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during the period t-1;
[0149] 5) Reservoir water constraints:
[0150]
[0151] Where V t H represents the reservoir storage capacity at time t, q t represents the reservoir water flow at time t, Q t It represents the power generation flow rate used by the hydropower unit at time t, and Δt is the time interval;
[0152] 6) Reservoir capacity constraints:
[0153]
[0154] Where V t H represents the water storage capacity of the reservoir at time t, and They represent the maximum and minimum values of the reservoir capacity respectively.
[0155] 4. The specific objective function of maintenance task decision is:
[0156] The optimization goal of the maintenance task decision model is to minimize the system water abandonment power and minimize the latest completion time of all maintenance tasks. Therefore, the overall objective function of the maintenance task decision problem is:
[0157]
[0158] In the formula, ω 1 and ω 2 They represent the weights of the abandoned water power and the latest completion time of the maintenance task respectively; Ψ represents the overall objective function.
[0159] Based on the above objective functions and constraints, all mathematical programming problems of the present invention are solved using Gurobi10.0.3 on the Matlab 2018a platform.
[0160] The invention provides a method for allocating maintenance tasks for a hydropower plant taking into account time dynamic dependency. Compared with the traditional task allocation method, the method can not only improve the allocation efficiency, but also improve the maintenance efficiency and increase the income of the hydropower plant.
Claims
1. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency, characterized in that: Firstly, a maintenance preparation time model is proposed which takes into account the uncertainties of the travel time of maintenance personnel to the maintenance site and the tool preparation time. Then, a maintenance process time model is proposed which takes into account the uncertainty of the maintenance time of a single working face, and the maintenance preparation time model and the maintenance process time model are transformed into maintenance constraints of the maintenance task allocation model. Finally, under the constraint of the maximum power generation power allowed by the State Grid Dispatching Center, the maintenance task allocation model of a hydropower plant taking into account the dynamic time dependency is established with the objective functions of minimizing the system abandoned water power and minimizing the latest completion time of all maintenance tasks, taking into account the maintenance constraints, hydraulic system operation constraints and equipment post-maintenance commissioning constraints.
2. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 1, characterized in that: The specific modeling process of the maintenance preparation time model is as follows: For hydropower plants, the maintenance department is divided into five departments: automatic, power generation, measurement and control, protection, and machinery. Each department is divided into more detailed equipment management groups. When the power plant issues a maintenance task r to the maintenance department g, each team will assign the task to the corresponding equipment management group s, where g = 1, 2, 3, 4, 5 represent the automatic, power generation, measurement and control, protection, and machinery departments respectively; s = 1, 2, 3, ... represent the sth equipment management group in a single department respectively; Assumptions It represents the preparation time for the s team of the maintenance department g to complete the maintenance task r; Adopt G g,s represents the g department s group, where G g,s When accepting r task, Need to consider before this G g,s Have you performed other tasks? Includes the following: In the formula, represents the maintenance preparation time of task r; It represents the number of spare parts remaining after team s of department g completes task r1; represents the maximum number of spare parts that team s of department g can carry; M g,s,r represents the number of spare parts required by team s in department g to perform task r; represents the Dirac function, that is, when hour, when hour, v g,s represents the average walking speed of team s in department g; Represents the time taken by maintenance personnel to prepare spare parts in the warehouse; p represents the warehouse location; Dis(r1,p,r) represents the shortest distance function between the location of maintenance personnel at task r1, the location of warehouse p, and the location of task r, which is calculated here using the Dijkstra shortest path algorithm; Dis(r1,r) represents the shortest distance function between the location of task r1 and the location of task r, which is calculated here using the Dijkstra shortest path algorithm.
3. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 2, characterized in that: The maintenance preparation time is uncertain. Based on this, in order to characterize the uncertainty of the time it takes for the team to complete the task, β g,s Indicator to indicate actual completion time Completion time The ratio between Different teams will have different β g,s , β g,s The calculation method includes the following steps: Step 1: Establish a historical time database of department g team s completing a certain task over the years, assuming For a set of historical data, record N sets of data; Step 2: Adoption Get the uncertainty index β of department g team s for many years g,s ; Step 3: Obtain the probability distribution of the uncertainty parameters of the team maintenance time through a data-driven method, and fit the historical data of the maintenance time of different teams to obtain the corresponding probability density distribution. The more historical data there are, the more accurate the probability distribution will be. Step 4: Use K-means clustering method to obtain typical scenarios of maintenance time uncertainty for each team; According to the typical scenario fitted, the maintenance preparation time is expressed as:
4. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 3, characterized in that: The specific modeling process of the maintenance process time model is as follows: During the maintenance process, the uncertainty of maintenance time comes from three aspects: ① If a maintenance tool is not brought, it is necessary to return to the warehouse or office to find the tool, which affects the maintenance process time; ② In different on-site environments, the difficulty of performing the same task varies, which leads to different maintenance times; ③ Different teams and different professionals have different efficiency when handling the same maintenance task; therefore, the maintenance time of each maintenance task is difficult to accurately estimate; Based on this, the present invention assumes that the maintenance process time obeys a truncated normal distribution, and its probability density function is expressed as: In the formula, Indicates the maintenance process time; represent the mean and standard deviation of the paternal normal distribution, respectively; represents variance; a and b represent the lower and upper bounds of the truncation interval respectively; represents the probability density function; φ(·), Φ(·) represent the probability density function and cumulative distribution function of the parent normal distribution, respectively; Then the cumulative distribution function of the maintenance process time is: In the formula, represents the cumulative distribution function; The mean μ1 of the maintenance process time is: The standard deviation σ1 of the maintenance process time is: In the formula, α and β are intermediate variables; For the maintenance process time, assume but In the interval (a,b), we have: Therefore, the probability density function of the maintenance process time is derived as: According to formula (9), the maintenance process time for the s group of the maintenance department g to complete the r maintenance task can be sampled.
5. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 3, characterized in that: The maintenance model constraint conditions of the maintenance constraint are as follows: When the maintenance sequence is a variable to be determined, the maintenance sequence and maintenance preparation time need to be reflected in the form of constraints. Maintenance process time the connection between; ① Maintenance constraints: In the formula, S g,s,r,r2 Represents the maintenance order. If the maintenance order of department g team s is: task r first and then r2, then S g,s,r,r2 =1, otherwise S g,s,r,r2 =0;S g,s,r1,r Represents the maintenance order. If the maintenance order of team s in department g is: task r1 first and then r, then S g,s,r1,r =1, otherwise S g,s,r1,r =0;S g,s,p,r Represents the maintenance order. If the maintenance order of team s in department g is: task p first and then task r, then S g,s,p,r =1, otherwise S g,s,p,r =0; Z b represents the set of all teams in department g; Z g It represents the combination of automation, power generation, measurement and control, protection, and machinery; Z a , Z d and Z e They correspond to the task nodes, start nodes and virtual end nodes in the set, and the virtual end node indicates the end of the maintenance sequence of all maintenance groups; if the team s of the maintenance department g starts from the warehouse p, then ξ g,s,p =1;h r Indicates the start time of maintenance; f p The departure time from warehouse p is set as time 0; f r 、f r1 represents the maintenance completion time of task r and task r1; y r,t Indicates whether component r can be put into operation at time t, 1 indicates that it is put into operation; r, r1, r2 are the maintenance task numbers, and the order is: r1, r, r2; M is a large number; t indicates time; χ indicates the latest completion time of the task in a day; In constraint (16), maintenance preparation time Maintenance process time It is still a variable. According to the maintenance preparation time model, the maintenance preparation time The constraints are expressed as: Constraints (20) and (22) mean that if S g,s,r1,r =1, then The calculation formula is (1); otherwise, Constraint (23) is the same as constraint (2); constraint (24) can be used to achieve the Logical judgment; Constraint (25) represents the number of spare parts initially brought by team s of department g; T represents the time interval; ② Equipment commissioning constraints: The maintenance task decision model of a hydropower plant needs to further consider the operation sequence of equipment after maintenance is completed. Based on this, the following constraints are used to represent this operation problem: In the formula, Z n and Z l Respectively represent the connection points of the hydropower plant units and the high-voltage line set; n and l represent the connection points of the nth unit and the lth line; o(l) and p(l) represent the first and last nodes of line l; j i,t 、j i,t-1 Respectively represent the actual operating status of device i at time t and t-1; j l,t Indicates the actual operating status of device l at time t; j o(l),t ,j p(l),t Respectively represent the actual operating status of the beginning and end of line l at time t; y n,t ,y l,t They represent the operational status of equipment n and equipment l respectively; In the formula, the constraint on the right is nonlinear, and the nonlinear term is linearized into the following constraint condition: In the formula, y l,t , j o(l),t 、j p(l),t If one of them is 0, then j l,t is equal to 0, which means that line l cannot be put into operation at time t; ③System operation constraints: 1) Power balance constraints: In the formula, A G ,A Line They represent the correlation matrix respectively; represents the power flow of line l at hour t; It represents the dispatching demand of the National Electric Power Dispatching Center for the power plant at the i-th contact unit in the t period; represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during period t; represents the power generated by the unit at the i-th node abandoning water at time t; θ i,t represents the voltage phase angle of node i at hour t; θ j,t represents the voltage phase angle of node j at hour t; X ij represents the reactance of line (i, j); 2) Phase angle upper and lower limit constraints: i i,t,min ≤θ i,t ≤θ i,t,max (34) θ i,t,min ,θ i,t,max They represent the minimum and maximum voltage phase angles of node i at the tth moment respectively; 3) Upper and lower limits of hydroelectric generator power: In the formula, They represent the minimum output power and maximum output power of hydropower unit i at time t respectively; 4) Hydroelectric generator climbing constraints: In the formula, They represent the upward or downward climbing rate of hydropower unit i at time t respectively; represents the power output of the i-th hydroelectric generating unit in the hydroelectric power plant during the period t-1; 5) Reservoir water constraints: Where V t H represents the reservoir storage capacity at time t, q t represents the reservoir water flow at time t, Q t It represents the power generation flow rate used by the hydropower unit at time t, and Δt is the time interval; 6) Reservoir capacity constraints: Where V t H represents the water storage capacity of the reservoir at time t, and They represent the maximum and minimum values of the reservoir capacity respectively.
6. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 5, characterized in that: The maintenance task decision objective function is as follows: The optimization goal of the maintenance task decision model is to minimize the system water abandonment power and minimize the latest completion time of all maintenance tasks. Therefore, the overall objective function of the maintenance task decision problem is: Where ω1 and ω2 represent the weights of the abandoned water power and the latest completion time of the maintenance task, respectively; Ψ represents the overall objective function.
7. A method for allocating maintenance tasks of a hydropower plant taking into account time dynamic dependency according to claim 6, characterized in that: The objective function and constraints of comprehensive maintenance task decision-making, as well as mathematical programming problems, are solved using Gurobi10.0.3 on the Matlab platform.
Citation Information
Patent Citations
A multi-time scale coordinated maintenance scheduling optimization method
CN109190777A
An intelligent management and control linkage equipment maintenance method and system
CN109685352A
A multi-type power supply overhaul arrangement method based on mixed integer programming
CN109767078A
Oil-gas well maintenance task scheduling processing method and device
CN112598262A
Large-scale multi-target unit maintenance optimization method
CN115456205A
