Parallel period splitting calculation method and system for long-term scheduling problem of power system
Through the parallel period split calculation method, the long-term scheduling problem of the power system is decomposed into independent short-period sub-problems in parallel solution, reconstructing feasible solutions and calculating the lower bound of the objective function, solving the problem of long solution time and inability to evaluate the solution quality in the existing technology , realize efficient and reliable power system scheduling.
Patent Information
- Application Number
- CN202411374565.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-29
- Publication Date
- 2024-11-15
AI Technical Summary
In the prior art, the solution time of long-term scheduling problems of power systems is long and the lower bound of the optimal objective function value cannot be provided, resulting in the inability to evaluate the quality of the solution.
The parallel period splitting calculation method is used to split the long-period scheduling problem into multiple independent short-period sub-problems. After parallel solution, the feasible solution of the original problem is reconstructed, and the lower bound of the optimal objective function value is calculated to evaluate the quality of the solution.
It significantly reduces the solution time, provides objective standards for evaluating the quality of the solution, ensures the reliability and effectiveness of the final result, and meets the optimal economic scheduling results.
Smart Images

Figure CN118966711A_ABST
Abstract
Description
Background Art
[0002] In the power system, the production, transmission and consumption of electric energy must be carried out simultaneously. This feature requires that there should be an effective dispatching method in the power system to ensure the safety of the power grid and the users' access to safe and economical electricity. For long-term dispatching problems, the dispatching cycle is generally one year or more, and the time resolution can be hours, days, weeks or months. It is not only important for the long-term construction and planning of the power system, but also can allocate fuel to units with fuel consumption constraints on a weekly or monthly basis according to the annual contract volume, providing strategic guidance for medium- and short-term dispatching problems. Due to the large scale of long-term dispatching problems, the serial cycle splitting algorithm is generally used to solve them.
[0003] The basic idea of the cycle splitting algorithm is to divide the long scheduling cycle into a series of short scheduling cycles, and then solve the optimization problem on the short scheduling cycle to achieve the purpose of solving the original problem. Therefore, under the cycle splitting algorithm, quite a number of short scheduling cycle optimization problems will be solved. The basic idea of the serial cycle splitting algorithm is to solve the optimization problems on each short scheduling cycle in turn. Its basic solution idea is: divide the long scheduling cycle of the original problem into several short scheduling cycles of equal length, and obtain the initial start and stop status and power generation of all units before the start of the first time period; solve each short scheduling cycle sub-problem in turn, obtain the optimal solution of each sub-problem, and use the optimal solution as the feasible solution of the original problem in this part of the time period.
[0004] According to the execution process of the serial cycle splitting algorithm, it can be found that the algorithm has the following significant characteristics: 1. In the serial cycle splitting algorithm, since all short scheduling cycle subproblems must be solved sequentially and cannot be solved in parallel, this means that the solution time of this method is longer; 2. For the original problem, the solution of each sub-problem is the optimal solution for that part of the time period, and it is impossible to obtain the optimal solution for the entire time period. Therefore, the algorithm cannot provide the lower bound of the optimal objective function value of the original problem, resulting in the inability to evaluate the quality of the final feasible solution; 3. When all the short scheduling cycle sub-problems can be successfully solved in sequence, the optimal solutions of all sub-problems can be put together to obtain a feasible solution to the original problem. Otherwise, it is still necessary to reconstruct the feasible solution to the original problem. Summary of the invention
[0005] The technical problem to be solved by the present invention is to provide a parallel cycle splitting calculation method and system for the long-term scheduling problem of the power system in view of the deficiencies in the above-mentioned prior art, which is used to solve the technical problems existing in the prior art that large-scale long-cycle problems take a long time to solve and cannot provide a lower bound of the optimal objective function value.
[0006] The present invention adopts the following technical solutions: The parallel cycle splitting calculation method for the long-term dispatching problem of the power system includes the following steps: S1. Establish the long-term dispatch problem of power system; S2. Split the long cycle of the long cycle scheduling problem into K A short scheduling period sub-problem is solved, and the initial on / off status and power generation of all units before the start of the first period are obtained; S3, the step S2 obtained K Independent short scheduling period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short scheduling period sub-problems; S4, reconstructing a feasible solution to the original long-term scheduling problem according to the optimal solutions of all short-term scheduling period sub-problems solved in step S3; S5. Calculate the lower bound of the optimal objective function value of the long-period scheduling problem based on the feasible solution obtained in step S4, and use the lower bound of the optimal objective function value to evaluate the long-period power system scheduling problem.
[0007] Preferably, the objective function of the long-term dispatch problem of the power system is established as:
[0008] in, represents the objective function, is the time period index, is the total number of time periods, is the unit index, is the total number of units.
[0009] Preferably, the constraints are as follows: System load balancing constraints:
[0010] in, For the crew In the period The power generation capacity, for System net load during the time period; System positive and negative spinning reserve demand constraints:
[0011] Line transmission security constraints:
[0012] in, is the line index, For line The transmission capacity limit of is the unit part of the transmission power distribution factor matrix, is the net load part of the transmission power distribution factor matrix; Unit output level limit
[0013] in, are the lower and upper bounds of the possible output of the unit, are the lower and upper limits of the unit’s rated power, For the crew In the period On / off status; Unit ramp rate limit constraints
[0014] in, For the crew The maximum climbing rate, is the length of a single period; Minimum startup time constraints:
[0015] in, For the crew The number of time periods that need to be kept powered on at the start of scheduling. For the crew The minimum number of power-on periods; Minimum shutdown time constraint:
[0016] in, For the crew The number of time periods that need to remain shut down at the start of scheduling. For the crew The minimum number of shutdown periods, Index for the time period; Unit startup cost constraints:
[0017] in, For the crew In the period startup costs, For the crew The cost of starting up, For the crew In the period The on / off status of the
[0018] Preferably, in step S2, a basic long-term TCUC problem is expressed as , the short scheduling period subproblem is:
[0019] in, is the final time period index of the last short-term scheduling subproblem, is the total number of scheduling periods.
[0020] Preferably, in step S3, the short scheduling period sub-problem is a mixed integer linear programming problem of finite scale; and parallel solving is set during the solving process.
[0021] Preferably, in step S4, the method for constructing a feasible solution is as follows: First, by adjusting the time period The start and stop status and power generation of the units in the nearby time periods are divided into short-term scheduling sub-problems and Connect the optimal solutions of A feasible solution for ; Then by adjusting the time period The start and stop status and power generation of the units in the nearby time periods will be the short-term scheduling problem The feasible solution and short-period scheduling subproblem of The optimal solution of A feasible solution for ; repeat K-1 Next, connect the optimal solutions of all the short-term scheduling sub-problems to obtain the original optimization problem A feasible solution of .
[0022] Preferably, when adjusting the start and stop status and power generation of the unit, it is only necessary to solve a series of short-term TCUC problems. k The specific process of this adjustment is as follows: In the k Before the adjustment, the problem has been obtained A feasible solution to this problem is combined with the short-term scheduling subproblem Connect the optimal solutions of A feasible solution of .
[0023] Preferably, around the period The method for determining the time interval for adjusting the start and stop status of the unit and the rescheduling of the power generation is as follows: Four variables need to be introduced: For the crew In short cycle The number of periods to remain in shutdown state at the beginning; For the crew In short cycle The number of time periods that the device remains powered on at the beginning; For the crew In short cycle The number of time periods during which the power is turned off at the end; For the crew In short cycle The number of time periods that the device remains powered on at the beginning; and The value of is based on the short-term scheduling subproblem The optimal solution of is directly obtained; and Obtained from the feasible solution of the problem; Case 1: and ; The following conclusions were obtained:
[0024] At this time, the unit In the period The time range for the nearby power on / off status and power generation to be readjusted is ; Case 2: and ; The following conclusions were obtained:
[0025] Case 3: and ; The following conclusions were obtained:
[0026] Case 4: and ; The following conclusions were obtained: .
[0028] Preferably, in step S5, the original optimization problem obtained under the parallel periodic sub-algorithm is The quality of the feasible solution is determined by the optimality gap Conduct an assessment as follows:
[0029] in, represents the objective function value corresponding to the feasible solution of the original optimization problem, is the number of short-term subproblems, and They are the suboptimal objective function values and their corresponding dual gap values obtained for all short-cycle scheduling subproblems under the parallel cycle splitting algorithm.
[0030] In a second aspect, an embodiment of the present invention provides a parallel cycle splitting computing system for a long-term scheduling problem of a power system, comprising: Building modules to establish the long-term dispatching problem of power systems; Splitting module, splits the long cycle of the long cycle scheduling problem into K A short scheduling period sub-problem is solved, and the initial on / off status and power generation of all units before the start of the first period are obtained; Solving module, for the obtained K Independent short scheduling period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short scheduling period sub-problems; The reconstruction module reconstructs a feasible solution to the original long-term scheduling problem based on the optimal solutions of all short-term scheduling period sub-problems obtained; The output module calculates the lower bound of the optimal objective function value of the long-period scheduling problem based on the obtained feasible solution, and uses the lower bound of the optimal objective function value to evaluate the long-period power system scheduling problem.
[0031] In a third aspect, a computer device comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the steps of the parallel cycle splitting calculation method for the long-term dispatch problem of the power system are implemented.
[0032] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, including a computer program, which, when executed by a processor, implements the steps of the parallel cycle splitting calculation method for the long-term scheduling problem of the power system.
[0033] Compared with the prior art, the present invention has at least the following beneficial effects: A parallel cycle splitting computational method for the long-term dispatch problem of power systems. By carefully dividing the original problem into multiple independent or weakly coupled sub-problems, we can use parallel computing frameworks (such as MPI, OpenMP, CUDA, etc.) to solve these sub-problems in parallel on multi-core processors, multi-processor servers, and even cloud computing platforms; this divide-and-conquer strategy significantly reduces the overall solution time because multiple sub-problems can be processed by different processors or computing nodes at the same time. In addition, reasonable task scheduling and data allocation strategies can further optimize resource utilization, reduce communication overhead and waiting time, and thus further improve parallel efficiency; while solving in parallel, theoretical analysis methods are introduced to conduct in-depth research on the objective function, aiming to derive the lower bound of its optimal value. This step is crucial because it not only provides an objective criterion for evaluating the quality of the current solution, but also provides guidance for the algorithm during the solution process, such as adjusting the search strategy or termination condition by comparing the gap between the current solution and the optimal lower bound. For certain specific types of problems (such as linear programming, convex optimization, etc.), mature theoretical tools and techniques have been developed to derive the optimal lower bound. For more general problems, it may be necessary to combine the characteristics of the problem and innovatively apply mathematical analysis, optimization theory or heuristic methods to make estimates. Combining parallel computing with theoretical evaluation can not only significantly improve the speed of solving large-scale long-term problems, but also continuously evaluate the quality of the solution during the solution process to ensure the reliability and effectiveness of the final result.
[0034] Furthermore, the objective function takes into account the fuel cost and startup cost of the unit, and takes minimizing the total cost as the optimization goal, which can make the solution direction of the scheduling problem meet the needs of the actual problem, so that the final solved scheduling result meets the economic optimality.
[0035] Furthermore, based on system-level factors such as system load balance and transmission line safety and node-level constraints such as unit operation, the physical operation process of the actual system is expressed in the form of constraints so that the final solved scheduling result meets the actual operating conditions.
[0036] Furthermore, the long cycle of the original problem is divided into multiple independent short cycles, which greatly reduces the scale of each cycle in the time dimension.
[0037] Furthermore, the original problem is divided into multiple short-period sub-problems. Each sub-problem is small in scale and independent of each other. The solver can be directly called for solving. The solution process can run in parallel, thereby speeding up the solution.
[0038] Furthermore, by adjusting the start / stop status and power generation capacity of the units in several time periods near the first and last time periods, the solutions of two adjacent short-period scheduling subproblems can be connected.
[0039] Furthermore, when connecting the solutions of the two sub-problems and adjusting the start and stop status of the unit and the power generation capacity, it is only necessary to solve a series of short-term scheduling problems so that the time coupling constraints between the two sub-problems are satisfied, thereby satisfying the constraints of the original problem.
[0040] Furthermore, by determining the time interval for adjusting the start and stop status of the units and the rescheduling of the power generation, the scheduling cycle range of the scheduling problem required for adjustment is obtained, so that the solutions to all short-term sub-problems are adjusted, and finally a solution that satisfies all the constraints of the original problem is obtained.
[0041] Furthermore, by solving the lower limit of the optimal value of the objective function, the optimality gap is used to evaluate the quality of the feasible solution to the original problem.
[0042] It can be understood that the beneficial effects of the second aspect mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here.
[0043] In summary, the method of the present invention can significantly reduce the time required to solve long-period power system scheduling problems commonly seen in actual engineering projects, and the quality of the solution can be evaluated using the lower bound of the optimal objective function value.
[0044] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings to be used in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0046] Figure 1 is a flow chart of the method of the present invention; Figure 2 A schematic diagram of a computer device provided by an embodiment of the present invention; Figure 3 The present invention is a block diagram of an electronic device provided according to an embodiment. DETAILED DESCRIPTION
[0047] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0048] In the description of the present invention, it should be understood that the terms “include” and “comprises” indicate the presence of described features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or collections thereof.
[0049] It should also be understood that the terms used in the present specification are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the present specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.
[0050] It should be further understood that the term "and / or" used in the present specification and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, and includes these combinations. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in the present invention generally indicates that the associated objects are in an "or" relationship.
[0051] It should be understood that, although the terms first, second, third, etc. may be used to describe preset ranges, etc. in the embodiments of the present invention, these preset ranges should not be limited to these terms. These terms are only used to distinguish preset ranges from each other. For example, without departing from the scope of the embodiments of the present invention, the first preset range may also be referred to as the second preset range, and similarly, the second preset range may also be referred to as the first preset range.
[0052] The word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrases "if it is determined" or "if (stated condition or event) is detected" may be interpreted as "when it is determined" or "in response to determining" or "when detecting (stated condition or event)" or "in response to detecting (stated condition or event)", depending on the context.
[0053] Various structural schematic diagrams of the embodiments disclosed in the present invention are shown in the accompanying drawings. These figures are not drawn to scale, and some details are magnified and some details may be omitted for the purpose of clear expression. The shapes of various regions and layers shown in the figures and the relative sizes and positional relationships therebetween are only exemplary, and may deviate in practice due to manufacturing tolerances or technical limitations, and those skilled in the art may additionally design regions / layers with different shapes, sizes, and relative positions according to actual needs.
[0054] The present invention provides a parallel cycle splitting calculation method for the long-term dispatching problem of the power system, which can effectively solve the long-term dispatching problem of the power system with high efficiency and high quality; based on the long-term unit combination problem considering the transmission safety constraint, a model representation including the target cost function, the system load balance constraint, the system positive and negative rotating reserve demand constraint, the line transmission safety constraint, the unit output level limit constraint, the unit power generation power ramp constraint and the minimum on / off time constraint is established. A parallel cycle splitting algorithm is proposed, which divides the original problem into several sub-problems, and greatly improves the solution efficiency through parallel solution. It is theoretically proved that the present invention can obtain the lower bound of the optimal objective function value of the long-term dispatching problem, which provides a basis for the evaluation of the quality of the final solution. In order to ensure that the coupling constraints between the sub-problems are satisfied, a corresponding feasible solution construction method is proposed. The present invention relates to a parallel cycle splitting algorithm for the long-term dispatching problem of the power system, which can realize efficient solution for this large-scale optimization problem and give the optimal cost lower bound, thereby providing a reference basis for the construction of the power system and the configuration scheme of new energy in practical engineering.
[0055] See also Figure 1 The present invention provides a parallel cycle splitting calculation method for a long-term dispatching problem of a power system, comprising the following steps: S1. Systematic representation of the problem; S101. Establish a basic model for the long-term dispatching problem of power system; Objective function:
[0056] in, represents the objective function, is the time period index, is the total number of time periods, is the unit index, is the total number of units.
[0057] Constraints: 1) System load balancing constraints:
[0058] in, For the crew In the period The power generation capacity, for System net load during the period (net load is the sum of load and uncertain new energy) 2) System positive and negative spinning reserve demand constraints:
[0059] 3) Line transmission security constraints:
[0060] in, is the line index, For line The transmission capacity limit of is the unit part of the transmission power distribution factor matrix, is the net load part of the transmission power distribution factor matrix.
[0061] 4) Unit output level constraints
[0062] in, are the lower and upper bounds of the possible output of the unit, are the lower and upper limits of the unit’s rated power, For the crew In the period The power on / off status of the machine, 0 means off, 1 means on.
[0063] 5) Unit climbing rate limit constraints
[0064] in, For the crew The maximum climbing rate, The length of a single period.
[0065] 6) Minimum boot time constraint:
[0066] in, For the crew The number of time periods that need to be kept powered on at the start of scheduling. For the crew The minimum number of power-on periods.
[0067] 7) Minimum shutdown time constraint:
[0068] in, For the crew The number of time periods that need to remain shut down at the start of scheduling. For the crew The minimum number of shutdown periods.
[0069] 8) Unit startup cost constraints:
[0070] in, For the crew In the period Start-up costs (variable), For the crew The cost required to start up (fixed amount).
[0071] S102, basic description of the cycle splitting algorithm; The basic idea of the cycle splitting algorithm is to divide the long scheduling cycle into a series of short scheduling cycles, and then solve the optimization problem on the short scheduling cycle to achieve the purpose of solving the original problem. Therefore, under the cycle splitting algorithm, a considerable number of short scheduling cycle optimization problems will be solved. In order to better distinguish the optimization problems on different short scheduling cycles, the following form is introduced to represent the Transmission Constrained Unit Commitment (TCUC) problem of different short scheduling cycles:
[0072] in, Indicates the scheduling period of the TCUC subproblem from time period Start to period End, and all units are in the period Before and during the period After the end, the on / off status and power generation power are both fixed values. Indicates the scheduling period of the TCUC subproblem from time period Start to period End, and all units are in the period Before the start, the on / off status and power generation are fixed values, and all units are in the period After the end, the on / off status and power generation are both variable values. Indicates the scheduling period of the TCUC subproblem from time period Start to period End, and all units are in the period Before and during the period After the end, the on / off state and the power generation are variable values. In the parallel cycle splitting algorithm, except for the problem in the first short scheduling cycle, the problem is , the other problems in the short scheduling period are of the form .
[0073] S2: Split the long scheduling cycle of the original problem into K A short scheduling cycle is created, and the initial on / off status and power generation of all units are obtained before the start of the first period; According to the definition in step S1, a basic long-term TCUC problem is expressed as , and the corresponding long scheduling period Split into the following series of short scheduling period sub-problems connected end to end:
[0074] S3, independent parallel solution of short scheduling period sub-problems; Through the division in step S2, the original problem is converted into several independent short-scheduling period sub-problems. The time coupling constraints between these sub-problems are temporarily relaxed, so they can be solved separately at the same time. Each short-scheduling period sub-problem is a mixed integer linear programming problem of limited scale. Its solution method is generally branch and bound method, cutting plane method, Lagrangian relaxation method, etc. It can be solved directly using tools such as Gurobi, CPLEX, COPT solver, etc. During the solution process, it is necessary to pay attention to setting parallel solution, which can greatly improve the solution speed.
[0075] S4. Reconstruct the original long-term scheduling problem based on the optimal solutions of all short-term scheduling period sub-problems solved in step S3. A feasible solution for ; Under the parallel cycle splitting algorithm, when solving each short-cycle scheduling sub-problem, the coupling constraints between each short-cycle scheduling sub-problem (unit ramp rate constraint and minimum on / off time constraint) are not considered. Therefore, simply combining the optimal solutions of all short-cycle scheduling sub-problems in chronological order may not be the original optimization problem. Therefore, it is necessary to reconstruct a feasible solution to the original optimization problem based on the optimal solutions of all short-cycle scheduling subproblems. When connecting the optimal solutions of each short-cycle scheduling subproblem, a feasible solution to the original optimization problem is obtained by fine-tuning the start and stop status and power generation of the unit in individual time periods.
[0076] The method to construct a feasible solution is as follows: First, by adjusting the time period The start and stop status and power generation of the units in the nearby time periods are divided into short-term scheduling sub-problems and The optimal solution of A feasible solution for ; Then by adjusting the time period The start and stop status and power generation of the units in the nearby time periods will be the short-term scheduling problem The feasible solution and short-period scheduling subproblem of The optimal solution of A feasible solution for ; This process is repeated K-1 Then, the optimal solutions of all the short-term scheduling sub-problems are connected to obtain the original optimization problem A feasible solution of .
[0077] When adjusting the start and stop status and power generation of the unit, it is only necessary to solve a series of short-term TCUC problems. k The specific process of this adjustment: In the k Before the adjustment, the problem has been obtained A feasible solution to this problem needs to be combined with the short-term scheduling subproblem The optimal solution of A feasible solution of .
[0078] To achieve this goal, during the period The start and stop status and power generation of the units in the nearby time periods need to be rescheduled. In order to improve the efficiency of the adjustment and ensure the effect of the adjustment, it is necessary to select a suitable adjustment period. A method for determining the time interval for adjusting the start and stop status of the unit and the rescheduling of the power generation.
[0079] First, we need to introduce four variables: For the crew In short cycle The number of periods to remain in shutdown state at the beginning For the crew In short cycle The number of time periods that the device remains powered on at the beginning For the crew In short cycle The last number of time periods to remain in shutdown state For the crew In short cycle The number of time periods that the device remains powered on at the beginning in, and The value of can be determined according to the short-term scheduling subproblem The optimal solution of is directly obtained; and It can be obtained directly based on the feasible solution of the problem.
[0080] Based on the above four variables, the following will introduce four cases (Case 1~Case 4) around the time period. A method for determining the time interval for adjusting the start and stop status of the unit and the rescheduling of the power generation.
[0081] Case 1: and ; In this case, the unit In the interval The last period is the power-on state, in the interval The device is initially powered off. and The value of is not 0.
[0082] if , indicating that in the interval On the crew The minimum startup time constraint is not met. At this time, it is necessary to adjust the startup and shutdown state and power generation power of the unit in this interval; if and , indicating that the unit The minimum startup time constraint can be met, but during the period The power generation of the unit needs to be adjusted because the power generation of the unit during this period does not meet the first and last power-on and power-off constraints of the unit (that is, the unit needs to reach the minimum output level before shutting down); if , indicating that , on the unit The minimum shutdown time constraint cannot be met. At this time, it is necessary to adjust the on / off state and power generation power of the unit in this interval.
[0083] Therefore, in Case 1, the following conclusions are obtained:
[0084] At this time, the unit In the period The time range for the nearby power on / off status and power generation to be readjusted is .
[0085] Case 2: and ; In this case, the unit In the interval The last period is the shutdown state, in the interval The start time is the power on state. and The value of is not 0.
[0086] if , indicating that in the interval On the crew The minimum startup time constraint is not met, and the startup and shutdown state and power generation of the unit in this interval need to be adjusted; if and , indicating that the unit The minimum startup time constraint can be met, but during the period The power generation of the unit needs to be adjusted because the power generation of the unit in this interval does not meet the unit's first and last on / off constraints (that is, the unit needs to reach the minimum output level before shutting down); if , indicating that On the crew The minimum shutdown time constraint cannot be met. At this time, it is necessary to adjust the on / off state and power generation power of the unit in this interval.
[0087] Therefore, in Case 2, the following conclusions are obtained:
[0088] Case 3: and ; In this case, the unit In the interval The last period is the power-on state, in the interval The start time is the power on state. and The value of is not 0.
[0089] if , indicating that in the interval On the crew The minimum startup time constraint is not met, and the startup and shutdown state and power generation of the unit in this interval need to be adjusted; if and , indicating that the unit The minimum startup time constraint can be met, but in the interval The climbing rate constraint of the unit cannot be met, and the power generation level of the unit in this interval needs to be adjusted.
[0090] Therefore, in Case 3, the following conclusions are obtained:
[0091] Case 4: and ; In this case, the unit In the interval The last period is the shutdown state, in the interval The start time is off. and The value of is not 0.
[0092] if , indicating that in the interval On the crew The minimum shutdown time constraint is not met. At this time, it is necessary to adjust the on / off state and power generation power of the unit in this interval.
[0093] Therefore, in Case 4, the following conclusions are obtained:
[0094] Considering that the power generation of all units should be adjusted simultaneously, it is stipulated that:
[0095] According to the above formula, around the period The time interval for adjusting the on / off status of the unit and the rescheduling of the power generation is .
[0096] Now we only need to solve the short-term scheduling problem Any feasible solution to this short-term problem can solve the problem The feasible solution and short-period scheduling subproblem of The optimal solution of So far, k The adjustment is completed.
[0097] In progress k There are two points to add during this adjustment: 1) When solving short-term scheduling problems There may be no solution when the time interval is too small, which means that the adjustment time interval needs to be expanded. Therefore, it can be updated as follows and :
[0098] Take advantage of newer and Re-solving the short-term scheduling problem This process can be repeated until a feasible solution to the problem is obtained. As the interval length continues to increase, the possibility of finding a feasible solution to the short-term scheduling problem increases. In actual power system scheduling problems, it is rare to need to repeat the solution multiple times. Basically, a feasible solution to the short-term scheduling problem can be obtained by adjusting it once.
[0099] 2) When solving short-term scheduling problems When , the efficiency of solving this short-term problem can be accelerated by using the minimum on / off time constraint of the unit. For example, if the interval length , and the unit In the period Before and during After that, they are all in shutdown state, so in the short-term scheduling problem Among all feasible solutions of All devices must remain powered off.
[0100] S5. Calculation of the lower bound of the optimal objective function value of the original problem.
[0101] For the original long-term economic dispatch problem ,use To represent the optimal objective function value corresponding to the optimal solution of the problem, according to the objective function in S1, it can be found that is the sum of the operating costs of all units at different times. Therefore, if the optimal solution of the original problem is in the interval The corresponding optimal unit operating cost is To express it, we get the following formula:
[0102] Use below and They represent the short scheduling cycle subproblem solved under the parallel cycle splitting algorithm. and The optimal objective function value is obtained.
[0103] Consider the following theorem: Theorem 1: Under the parallel cycle splitting algorithm, the following inequality holds
[0104] The proof of Theorem 1 is as follows: For the original optimization problem For any optimal solution of The above part can definitely satisfy the short scheduling period subproblem All constraints of , so the optimal solution is in the interval The above part is the short scheduling period subproblem A feasible solution of , the objective function value corresponding to this feasible solution is actually .therefore, It will definitely not be worse than the short scheduling period subproblem The optimal objective function value is smaller, so that the first formula of Theorem 1 holds.
[0105] Similarly, the original optimization problem Any optimal solution of The above part can definitely satisfy the short scheduling period subproblem All constraints of , so the optimal solution is in the interval The above part is a sub-problem A feasible solution of , the objective function value corresponding to this feasible solution is actually .therefore, It will definitely not be worse than the short scheduling period subproblem The optimal objective function value is smaller, so that the second formula of Theorem 1 holds.
[0106] So far, the proof of Theorem 1 is complete.
[0107] Based on Theorem 1, we can get the following conclusions: 1) For the original optimization problem For example, assuming that the objective function value corresponding to any feasible solution of the problem is , then according to Theorem 1, the following formula holds
[0108] According to the above formula, through and The difference between them evaluates the quality of the feasible solution, which is a very important advantage of the parallel cycle splitting algorithm proposed in the present invention.
[0109] 2) The serial cycle splitting algorithm cannot provide the original optimization problem The lower bound of the optimal objective function value of , thus making it impossible to evaluate the quality of the feasible solution of the original problem obtained by the algorithm. This is because under the serial cycle splitting algorithm, the short scheduling cycle subproblem All feasible solutions of must satisfy the same unit initial condition constraints, that is, The initial start-up and shutdown status of the units and the power generation level before (the initial conditions are based on the short scheduling period sub-problem The optimal solution of the original optimization problem is determined in the time period The current unit start-up and shutdown status and power generation level and short scheduling cycle sub-problem The initial conditions of the units are the same. Therefore, under the serial cycle splitting algorithm, the original optimization problem The optimal solution is in the interval The part may not be a short scheduling period sub-problem A feasible solution of . Therefore, it is impossible to determine that the optimal solution of the original optimization problem is in the interval The corresponding optimal unit operating cost sum The optimal solution to the short scheduling period subproblem Therefore, under the serial cycle splitting algorithm, it is impossible to obtain the conclusion similar to that in Theorem 1.
[0110] 3) Due to the complexity of the feasible space of power system dispatching problems, the original optimization dispatching problem There may be more than one optimal solution, that is, although the optimal objective function value of the original optimization scheduling problem is unique, there may be multiple unit start-stop and power generation scheduling plans that can obtain the optimal objective function value, and different unit start-stop and power generation scheduling plans are in the interval Different total unit operating costs may be obtained Based on this consideration, we find that Theorem 1 gives all possible A lower limit value of .
[0111] 4) Under the parallel cycle splitting algorithm, if all short-cycle scheduling subproblems are solved directly using commercial solver software (such as Gurobi, COPT, CPLEX, etc.), generally this type of software will provide a dual gap value while giving the suboptimal objective function value of the problem.
[0112] Suppose that the suboptimal objective function values and their corresponding dual gap values obtained by all short-cycle scheduling subproblems under the parallel cycle splitting algorithm are and , we can get the following conclusions:
[0113] Combining the above formula and conclusion 1), the original optimization problem obtained under the parallel cycle division algorithm is The quality of a feasible solution is evaluated by the optimality gap gap determined as follows.
[0114]
[0115] in, Represents the objective function value corresponding to the feasible solution of the original optimization problem.
[0116] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "platform".
[0117] In another embodiment of the present invention, a parallel cycle splitting calculation system for the long-term scheduling problem of an electric power system is provided. The system can be used to implement the parallel cycle splitting calculation method for the long-term scheduling problem of an electric power system mentioned above. Specifically, the parallel cycle splitting calculation system for the long-term scheduling problem of an electric power system includes a building module, a splitting module, a solving module, a reconstruction module and an output module.
[0118] Among them, the building module establishes the long-term scheduling problem of the power system; Splitting module, splits the long cycle of the long cycle scheduling problem into K A short scheduling period sub-problem is solved, and the initial on / off status and power generation of all units before the start of the first period are obtained; Solving module, for the obtained K Independent short scheduling period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short scheduling period sub-problems; The reconstruction module reconstructs a feasible solution to the original long-term scheduling problem based on the optimal solutions of all short-term scheduling period sub-problems obtained; The output module calculates the lower bound of the optimal objective function value of the long-period scheduling problem based on the obtained feasible solution, and uses the lower bound of the optimal objective function value to evaluate the long-period power system scheduling problem.
[0119] In another embodiment of the present invention, a terminal device is provided, which includes a processor and a memory, wherein the memory is used to store a computer program, the computer program includes program instructions, and the processor is used to execute the program instructions stored in the computer storage medium. The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. It is the computing core and control core of the terminal, which is suitable for implementing one or more instructions, and is specifically suitable for loading and executing one or more instructions to implement the corresponding method flow or corresponding function; the processor described in the embodiment of the present invention can be used for the operation of the parallel cycle splitting calculation method for the long-term scheduling problem of the power system, including: Establish the long-term dispatch problem of power system; split the long-term dispatch problem into K A short scheduling period sub-problem is created, and the initial on / off status and power generation of all units before the start of the first period are obtained; K Independent short dispatching period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short dispatching period sub-problems; a feasible solution to the original long-term dispatching problem is reconstructed according to the optimal solutions of all short dispatching period sub-problems obtained; the lower bound of the optimal objective function value of the long-term dispatching problem is calculated based on the feasible solution obtained, and the long-term power system dispatching problem is evaluated using the lower bound of the optimal objective function value.
[0120] In another embodiment of the present invention, the present invention also provides a storage medium, specifically a computer-readable storage medium (Memory), which is a memory device in a terminal device for storing programs and data. It is understandable that the computer-readable storage medium here can include both the built-in storage medium in the terminal device and the extended storage medium supported by the terminal device, and can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it. The computer-readable storage medium provides a storage space, which stores the operating system of the terminal. In addition, one or more instructions suitable for being loaded and executed by the processor are also stored in the storage space, and these instructions can be one or more computer programs (including program codes). It should be noted that more specific examples (non-exhaustive list) of the computer-readable storage medium here include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
[0121] Computer readable storage media also include data signals propagated in baseband or as part of a carrier wave, which carry readable program codes. Such propagated data signals can take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The readable storage medium can also be any readable medium other than a readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, device, or device. The program code contained on the readable storage medium can be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above.
[0122] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).
[0123] The processor may load and execute one or more instructions stored in the computer-readable storage medium to implement the corresponding steps of the parallel cycle splitting calculation method for the long-term scheduling problem of the power system in the above embodiment; the processor may load and execute the following steps: Establish the long-term dispatch problem of power system; split the long-term dispatch problem into K A short scheduling period sub-problem is created, and the initial on / off status and power generation of all units before the start of the first period are obtained; K Independent short dispatching period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short dispatching period sub-problems; a feasible solution to the original long-term dispatching problem is reconstructed according to the optimal solutions of all short dispatching period sub-problems obtained; the lower bound of the optimal objective function value of the long-term dispatching problem is calculated based on the feasible solution obtained, and the long-term power system dispatching problem is evaluated using the lower bound of the optimal objective function value.
[0124] See also Figure 2 , the terminal device is a computer device. The computer device 60 of this embodiment includes: a processor 61, a memory 62, and a computer program 63 stored in the memory 62 and executable on the processor 61. When the computer program 63 is executed by the processor 61, the parallel cycle splitting calculation method for the long-term dispatching problem of the power system in the embodiment is implemented. To avoid repetition, it is not described one by one here. Alternatively, when the computer program 63 is executed by the processor 61, the functions of each model / unit in the parallel cycle splitting calculation system for the long-term dispatching problem of the power system in the embodiment are implemented. To avoid repetition, it is not described one by one here.
[0125] The computer device 60 may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The computer device 60 may include, but is not limited to, a processor 61 and a memory 62. Those skilled in the art will appreciate that Figure 2 This is only an example of the computer device 60 and does not constitute a limitation of the computer device 60. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the computer device may also include input and output devices, network access devices, buses, etc.
[0126] The processor 61 may be a central processing unit (CPU), or other general-purpose processors, central processing units, graphics processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, data processing logic based on quantum computing, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.
[0127] The memory 62 may be an internal storage unit of the computer device 60, such as a hard disk or memory of the computer device 60. The memory 62 may also be an external storage device of the computer device 60, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc., equipped on the computer device 60.
[0128] Furthermore, the memory 62 may include both an internal storage unit of the computer device 60 and an external storage device. The memory 62 is used to store computer programs and other programs and data required by the computer device. The memory 62 may also be used to temporarily store data that has been output or is to be output.
[0129] Any reference to a memory, database or other medium used in the embodiments provided in the present application may include at least one of a non-volatile and a volatile memory. Non-volatile memory may include a read-only memory (ROM), a magnetic tape, a floppy disk, a flash memory, an optical memory, a high-density embedded non-volatile memory, a resistive random access memory (ReRAM), a magnetic random access memory (MRAM), a ferroelectric random access memory (FRAM), a phase change memory (PCM), a graphene memory, etc. Volatile memory may include a random access memory (RAM) or an external cache memory, etc. As an illustration and not limitation, RAM may be in various forms, such as a static random access memory (SRAM) or a dynamic random access memory (DRAM), etc.
[0130] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but is not limited thereto.
[0131] See also Figure 3 The terminal device 600 is an electronic device, and the electronic device is in the form of a general computing device. The components of the electronic device may include but are not limited to: at least one processing unit 610, at least one storage unit 620, a bus 630 connecting different platform components (including the storage unit 620 and the processing unit 610), a display unit 640, etc.
[0132] The storage unit stores program codes, which can be executed by the processing unit 610, so that the processing unit 610 performs the steps according to various exemplary embodiments of the present invention described in the above method section of this specification. For example, the processing unit 610 can perform the following steps: Figure 1 Follow the steps shown in .
[0133] The storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 6201 and / or a cache memory unit 6202 , and may further include a read-only memory unit (ROM) 6203 .
[0134] The storage unit 620 may also include a program / utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.
[0135] Bus 630 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
[0136] The electronic device 600 may also communicate with one or more external devices 700 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 600, and / or communicate with any device that enables the electronic device 600 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 650. Furthermore, the electronic device 600 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 660. The network adapter 660 may communicate with other modules of the electronic device 600 via a bus 630. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage platforms, etc.
[0137] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. The components of the embodiments of the present invention described and shown in the drawings here can usually be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.
[0138] IEEE-118 node system data is used here to test the computational effect of the parallel cycle splitting algorithm. In order to test the scheduling problem under long-term cycles, based on the system load demand data in 24 time periods, the system load demand data for 1 week, 2 weeks, 1 month and 1 year were obtained by combining the daily load demand change error. In the test, the length of each short cycle is 1 day, and each scheduling period is 1 hour. In the test, all short-cycle scheduling sub-problems are solved by directly calling the CPLEX solver. When performing parallel calculations, 7 computers are called to complete parallel tasks. According to the system load demand data, the following formula is used to obtain the system's positive and negative rotating reserve demand data in each time period:
[0139] Table 1 shows the main test results of the parallel cycle splitting algorithm under different scheduling cycles.
[0140] Table 1 Main calculation results obtained using the parallel cycle splitting algorithm
[0141] In Table 1, the computing time T1 represents the time for solving all short-cycle scheduling subproblems without using parallel computing methods, T2 represents the time for reconstructing a feasible solution to the original problem based on the solution of all short-cycle scheduling subproblems, and T3 represents the time for solving all short-cycle scheduling subproblems using parallel computing methods.
[0142] Table 2 shows the main test results of the direct solution method under different scheduling periods.
[0143] Table 2 Main calculation results obtained using the direct solution method
[0144] Table 3 shows the main test results of the serial cycle splitting algorithm under different scheduling cycles.
[0145] Table 3 Main calculation results obtained using the serial cycle splitting algorithm
[0146] Comparing the data in Table 1 and Table 2, it can be found that the parallel cycle splitting algorithm proposed in the present invention has higher computational efficiency and better computational effect than the direct solution method in solving large-scale long-term TCUC problems. In particular, when the scheduling period is 1 year, the direct solution method cannot even successfully solve the original optimization problem, because the solution will be terminated due to memory overflow. When the parallel computing method is called, the computational efficiency of the parallel cycle splitting algorithm can be further improved. In the test, considering that the time length of each short cycle is 1 day, when the scheduling period is 1 week, 2 weeks, 1 month and 1 year, the number of short cycle scheduling sub-problems to be solved is 7, 14, 30 and 365 respectively. In the test, 7 short cycle scheduling sub-problems can be solved independently and in parallel by 7 computers at the same time. After using the parallel computing method, the calculation speed is not increased by 7 times, because for the long cycle scheduling problem, its parallel computing time is actually equal to the time to solve the short cycle scheduling sub-problem that takes the longest time among all short cycle scheduling sub-problems.
[0147] Comparing the data in Table 1 and Table 3, it is found that when using parallel computing, the parallel cycle splitting algorithm proposed in the present invention also has higher computing efficiency and better computing effect than the serial cycle splitting algorithm when solving large-scale long-term TCUC problems. The computing time of the present invention is much shorter than that of the serial cycle splitting algorithm. In fact, this is caused by the structure of the two algorithms themselves. Under the serial cycle splitting algorithm, all short-cycle scheduling subproblems must be solved in chronological order, while under the parallel cycle splitting algorithm, since the coupling constraints between the short-cycle scheduling subproblems are ignored, all short-cycle scheduling subproblems can be solved independently in parallel, which is one of the most significant advantages of the parallel cycle splitting algorithm.
[0148] In addition, the serial cycle splitting algorithm cannot provide a lower bound on the optimal objective function value of the original problem, and thus cannot calculate the optimality gap, and cannot effectively evaluate the quality of the feasible solution obtained by the algorithm. In contrast, the parallel cycle splitting algorithm can provide a lower bound on the optimal objective function value of the original problem, and thus evaluate the quality of the final feasible solution by calculating the optimality gap.
[0149] In summary, the parallel cycle splitting calculation method and system for the long-term dispatching problem of the power system of the present invention can significantly reduce the time required to solve the long-period power system dispatching problems commonly seen in actual engineering projects, and the quality of the solution can be evaluated using the lower bound of the optimal objective function value.
[0150] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.
[0151] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0152] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in the present invention can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0153] In the embodiments provided by the present invention, it should be understood that the disclosed devices / terminals and methods can be implemented in other ways. For example, the device / terminal embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0154] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0155] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0156] If the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.
[0157] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0158] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0159] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0160] The above contents are only for explaining the technical idea of the present invention and cannot be used to limit the protection scope of the present invention. Any changes made on the basis of the technical solution in accordance with the technical idea proposed by the present invention shall fall within the protection scope of the claims of the present invention.
Claims
1. Parallel cycle splitting calculation method for long-term power system dispatch problem, It is characterized in that The following steps are involved: S1. Establish the long-term dispatch problem of power system; S2. Split the long cycle of the long cycle scheduling problem into K A short scheduling period sub-problem is solved, and the initial on / off status and power generation of all units before the start of the first period are obtained; S3, the step S2 obtained K Independent short scheduling period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short scheduling period sub-problems; S4, reconstructing a feasible solution to the original long-term scheduling problem according to the optimal solutions of all short-term scheduling period sub-problems solved in step S3; S5. Calculate the lower bound of the optimal objective function value of the long-period scheduling problem based on the feasible solution obtained in step S4, and use the lower bound of the optimal objective function value to evaluate the long-period power system scheduling problem.
2. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 1, It is characterized in that The objective function of the long-term dispatch problem of the power system is established as: in, represents the objective function, is the time period index, is the total number of time periods, is the unit index, is the total number of units.
3. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 2, It is characterized in that The constraints are as follows: System load balancing constraints: in, For the crew In the period The power generation capacity, for System net load during the time period; System positive and negative spinning reserve demand constraints: Line transmission security constraints: in, is the line index, For Line The transmission capacity limit of is the unit part of the transmission power distribution factor matrix, is the net load part of the transmission power distribution factor matrix; Unit output level limit constraints in, are the lower and upper bounds of the possible output of the unit, are the lower and upper limits of the unit’s rated power, For the crew In the period On / off status; Unit ramp rate limit constraints in, For the crew The maximum climbing rate, is the length of a single period; Minimum startup time constraints: in, For the crew The number of time periods that need to be kept powered on at the start of scheduling. For the crew The minimum number of power-on periods; Minimum shutdown time constraint: in, For the crew The number of time periods that need to remain shut down at the start of scheduling. For the crew The minimum number of shutdown periods, Index for the time period; Unit startup cost constraints: in, For the crew In the period startup costs, For the crew The cost of starting up, For the crew In the period The on / off status of the 4. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 1, It is characterized in that In step S2, a basic long-term TCUC problem is expressed as , the short scheduling period subproblem is: in, is the final time period index of the last short-term scheduling subproblem, is the total number of scheduling periods.
5. The parallel cycle splitting calculation method for the long-term dispatch problem of power system according to claim 1, It is characterized in that In step S3, the short scheduling cycle sub-problem is a mixed integer linear programming problem of finite scale; and parallel solution is set in the solution process.
6. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 1, It is characterized in that In step S4, the method for constructing a feasible solution is as follows: First, by adjusting the time period The start and stop status and power generation of the units in the nearby time periods are divided into short-term scheduling sub-problems and Connect the optimal solutions of A feasible solution for ; Then by adjusting the time period The start and stop status and power generation of the units in the nearby time periods will be the short-term scheduling problem The feasible solution and short-period scheduling subproblem of The optimal solution of A feasible solution for ; repeat K-1 Next, connect the optimal solutions of all the short-term scheduling sub-problems to obtain the original optimization problem A feasible solution of .
7. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 6, It is characterized in that When adjusting the start and stop status and power generation of the unit, it is only necessary to solve a series of short-term TCUC problems. k The specific process of this adjustment is as follows: In the k Before the adjustment, the problem has been obtained A feasible solution to this problem is combined with the short-term scheduling subproblem Connect the optimal solutions of A feasible solution of .
8. The parallel cycle splitting calculation method for the long-term dispatch problem of the power system according to claim 6, It is characterized in that Around the period The method for determining the time interval for adjusting the start and stop status of the unit and the rescheduling of the power generation is as follows: Four variables need to be introduced: For the crew In short cycle The initial number of periods to remain in shutdown state; For the crew In short cycle The number of time periods that the device remains powered on at the beginning; For the crew In short cycle The number of time periods during which the power is turned off at the end; For the crew In short cycle The number of time periods that the device remains powered on at the beginning; and The value of is based on the short-term scheduling subproblem The optimal solution of is directly obtained; and Obtained from the feasible solution of the problem; Case 1: and ; The following conclusions were obtained: At this time, the unit In the period The time range for the nearby power on / off status and power generation to be readjusted is ; Case 2: and ; The following conclusions were obtained: Case 3: and ; The following conclusions were obtained: Case 4: and ; The following conclusions were obtained: 。 9. The parallel cycle splitting calculation method for the long-term dispatch problem of power system according to claim 1, It is characterized in that In step S5, the original optimization problem obtained under the parallel cycle division algorithm is The quality of the feasible solution is determined by the optimality gap Conduct an assessment as follows: in, represents the objective function value corresponding to the feasible solution of the original optimization problem, is the number of short-term subproblems, and They are the suboptimal objective function values and their corresponding dual gap values obtained for all short-cycle scheduling subproblems under the parallel cycle splitting algorithm.
10. A parallel cycle splitting computing system for long-term dispatching problems in power systems. It is characterized in that include: Building modules to establish the long-term dispatching problem of power systems; Splitting module, splits the long cycle of the long cycle scheduling problem into K A short scheduling period sub-problem is solved, and the initial on / off status and power generation of all units before the start of the first period are obtained; Solving module, for the obtained K Independent short scheduling period sub-problems are solved independently and in parallel to obtain the optimal solutions of all short scheduling period sub-problems; The reconstruction module reconstructs a feasible solution to the original long-term scheduling problem based on the optimal solutions of all short-term scheduling period sub-problems obtained; The output module calculates the lower bound of the optimal objective function value of the long-period scheduling problem based on the obtained feasible solution, and uses the lower bound of the optimal objective function value to evaluate the long-period power system scheduling problem.
