Unit commitment problem tight and simple model construction method based on single unit pricing cutting plane

Through the model construction method based on single-unit pricing cutting plane, the problem of low computing efficiency of unit combination model in the power system is solved, more efficient grid resource scheduling and optimized configuration are achieved, the contract power demand is met, and the power saving of the power grid is improved Emission reduction effect.

CN118965691APending Publication Date: 2024-11-15GUANGXI UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410935166.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-12
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The calculation efficiency of the unit combination model in the power system is low, making it difficult to quickly find the optimal solution, affecting the optimal allocation of power grid resources and energy conservation and emission reduction.

Method used

The unit combination problem-making method is adopted based on single-unit pricing cutting plane. By obtaining the basic data of generator sets, defining pricing sub-problems, constructing a single-unit pricing cutting plane, and adding it to the unit combination model to establish a single-unit-based The unit combination model of group pricing cut plane.

Benefits of technology

The calculation efficiency of the unit model is improved, the solution complexity is reduced, and the grid resource scheduling and optimized configuration are achieved. The actual demand for contract power is met, and the goal of optimized resource allocation and energy conservation and emission reduction is achieved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118965691A_ABST
    Figure CN118965691A_ABST
Patent Text Reader

Abstract

The invention discloses a unit commitment problem tight and simple model construction method based on a single unit pricing cut plane. The method comprises the following steps: acquiring basic data of a generator unit of a power system; establishing a unit combination model according to the basic data of the generator unit; defining a pricing sub-problem, and defining a single unit pricing cut plane based on the solution of the sub-problem; and adding the single-unit pricing cutting plane to the unit commitment model, and establishing a unit commitment model based on the single-unit pricing cutting plane. The model constructed by the method disclosed by the invention is more compact and simpler, and the calculation efficiency is higher.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of power system dispatching, and in particular to a method for constructing a compact and concise model of a unit commitment problem based on a single unit pricing cutting plane. Background Art

[0002] The power system is a system with many components, large scale and complex structure. As one of the core issues of the power system, unit combination (UC) refers to the adjustment of the unit output in each period by reasonably arranging the start and stop status of the unit to minimize the total operating cost of the power system. The research on UC problems involves multiple disciplines such as power system theory, optimization theory and computer science. The generator unit investment plan obtained based on UC can save 1%-3% of operating costs. In addition, the UC problem can be modeled as a mixed integer programming (MIP) problem, which is a NP-Hard problem in mathematics. Therefore, it is quite difficult to obtain the optimal solution to a large-scale UC problem within an acceptable time.

[0003] In recent years, with the rapid development of optimization theory and algorithms, and commercial solvers, the MIP method has become the main method for solving UC problems with its powerful modeling capabilities and high solution efficiency. It has been widely used in PJM (Pennsylvania-New Jersey-Maryland), the largest competitive wholesale market in the United States, and power system operators. The main idea of ​​the MIP method is to use the MIP theory to construct a mathematical model of the UC problem, and then call an efficient solver to solve it. With the continuous improvement of the MIP theory and the deepening of the study of the UC model, researchers have found that different UC models have significant differences in efficiency. Therefore, improving the UC model to improve its computational efficiency has become the main research direction of the MIP method. Compactness and simplicity are two important indicators for evaluating the quality of UC models. The stronger the compactness of the model, the smaller the search space of its solution, so that the solver can find the optimal solution more quickly. The simpler the model, the fewer the number of variables, constraints, and non-zero elements, and the faster the solver can process the problem. Therefore, power grid companies are in urgent need of a more efficient and computationally efficient power system model to more effectively dispatch power grid generation resources and achieve optimal resource allocation.

[0004] The information disclosed in this background technology section is only intended to enhance the understanding of the overall background of the invention and should not be regarded as an acknowledgment or any form of suggestion that the information constitutes the prior art already known to a person skilled in the art. Summary of the invention

[0005] The object of the present invention is to provide a method for constructing a compact and concise model of the unit commitment problem based on a single unit pricing cutting plane, thereby overcoming the shortcoming of low computational efficiency of the power system unit commitment model.

[0006] To achieve the above object, the present invention provides a method for constructing a compact and concise model of a unit commitment problem based on a single unit pricing cutting plane, comprising the following steps:

[0007] Step 1: Obtain basic data of power system generator sets;

[0008] Step 2: Establish a unit combination model based on the basic data of the generator set;

[0009] Step 3: Define the pricing sub-problem, and based on the solution of the sub-problem, define the pricing cutting plane for the single unit;

[0010] Step 4: Add the single unit pricing cutting plane to the unit combination model, and establish a unit combination model based on the single unit pricing cutting plane.

[0011] Preferably, in the above technical solution, in step 1, the basic data of the generator set includes operating characteristic data, load forecast data and rotating standby data of each time period of the generator set.

[0012] Preferably, in the above technical solution, step 2 of the unit combination model includes defining arbitrary state variables and establishing arbitrary constraints; the constraints include startup cost constraints, unit initial state constraints, unit logical state constraints, unit minimum rise and fall time constraints, unit limitations and upper bound constraints, climbing constraints and power balance constraints.

[0013] Preferably, in the above technical solution, step 2 establishes a unit commitment model, when defining any state variables and establishing any constraints. The specific model includes the following:

[0014] (a) Objective function

[0015]

[0016] in, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β iis the coefficient of the power generation cost function of unit i, u i,t represents the start / stop status of unit i in period t, where u i,t =0 means that unit i is shut down during period t, u i,t =1 means that unit i is started during period t; s i,t represents the start-up status of unit i in period t, s i,t =1 means that unit i is started and running during period t, s i,t =0 indicates other situations; x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1 ,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1 ,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t represents the shutdown status of unit i in period t, d i,t =1 means that unit i is shut down during period t, d i,t =0 means other situations;

[0017] (b) Power balance constraints

[0018]

[0019] Among them, P D,t is the load demand during period t;

[0020] (c) Spinning reserve constraints

[0021]

[0022] in, is the upper limit of the output of unit i, R tis the spinning reserve demand during period t;

[0023] (d) State variable constraints

[0024] s i,t -d i,t =u i,t -u i,t-1

[0025] (e) Minimum start / stop time constraints

[0026]

[0027] in, T on,i represents the minimum operating time of unit i, T off,i represents the minimum downtime of unit i, U i =[min(T,u i,0 ( T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )( T off,i +T i,0 ))] + ; It should be noted that u i,0 represents the initial state before the dispatch of unit i, T i,0 Indicates the start / stop time of unit i before scheduling. Positive numbers are the number of periods that have been started, and negative numbers are the number of periods that have been stopped. min(·,·) means the minimum of the two. [·] + =max(0,·);

[0028] (f) Unit output constraints

[0029] u i,t P i ≤P i,t

[0030]

[0031] in, P i is the lower bound of the output of unit i;

[0032] (g) Unit climbing constraints

[0033] P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t P start,i

[0034] P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i

[0035] Among them, P up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,i They represent the down-climbing limit and shutdown climbing limit of unit i respectively;

[0036] (h) Start-up cost constraints

[0037] S i,t ≥C hot,i s i,t

[0038]

[0039] Among them, when t- T off,i -T cold,i ≤0 and [-T i,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; otherwise, f init,i,t =0; C hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i;

[0040] (i) Initial state constraints

[0041] u i,t =u i,0 , t∈[1,...,U i +L i ]

[0042] (j) Linearization constraint of quadratic term in cost function

[0043] z i,t ≥2γ i p i,l P i,t -γ i (p i,l ) 2 l=0,1,2,…,L

[0044] Where L is the given segmentation parameter,

[0045] (k) Binary variable constraints

[0046] u i,t ,s i,t ,d i,t ∈{0,1};

[0047] The expression form (UC-M) of the motor unit (UC) model for two time periods is as follows:

[0048]

[0049] Among them, x i =[u i ;s i ;d i ],n=3NT, A is a concise expression of system coupling constraints (including power balance constraints and spinning reserve constraints). i is the coefficient matrix of system coupling constraints of unit i, L is the right-hand side term of system coupling constraints, χ i The feasible domain formed by all operating constraints of unit i; the operating constraints include: state variable constraints, minimum start / stop time constraints, unit output constraints, unit climbing constraints, startup cost constraints, initial state constraints, cost function quadratic term linearization constraints, and binary variable constraints.

[0050] Preferably, in the above technical solution, defining the pricing sub-problem in step 3 includes:

[0051] (1) Based on the convex analysis theory, the convex envelope function of the unit commitment model is constructed;

[0052] (2) Calculate the convex hull price based on the subgradient function of the convex hull function;

[0053] (3) Construct the dual problem of the finite unit pricing problem and obtain the relaxed master problem based on it;

[0054] (4) Given the convex hull price, define a subproblem for each single machine group;

[0055] (5) Construct a cutting plane based on the results obtained for each sub-problem.

[0056] Preferably, in the above technical solution, defining the pricing sub-problem in step 3 includes:

[0057] The Dantzig-Wolfe method is used to calculate the convex hull price. According to the convex analysis theory, the convex envelope function v of the unit combination model v(L) is constructed. c (L).

[0058]

[0059] Among them, λ is The Lagrange multiplier of ;

[0060] v c Subgradient of (L) is the convex hull price λ * (L), that is

[0061]

[0062] remember is conv(χ i ) of all extreme points (assuming χ i bounded), then It is equivalent to the following single-unit pricing problem 1UC-PP:

[0063]

[0064] If the Lagrangian relaxation model 1UC-RPP of 1UC-PP is feasible, then its dual problem 1UC-PP-D is:

[0065]

[0066] 1UC-PP-D uses constraint generation method to solve; given a subset The dual problem 1UC-RPP of the single-unit finite pricing problem corresponding to 1UC-PP-D can be constructed as follows:

[0067]

[0068] At this point, we can get The relaxed master problem RMP is as follows:

[0069]

[0070]

[0071] The pricing subproblem SP is defined as follows:

[0072]

[0073] Step 0: k = 1,

[0074] Step 1: Solve RMP to obtain λ k ,

[0075] Step 2: Solve SP to get r i (λ k)as well as

[0076] Step 3: If Then k is the optimal solution, otherwise Go to step 1.

[0077] Preferably, in the above technical solution, step 3 of defining the single unit pricing cutting plane includes:

[0078] Given For each unit i, the following pricing sub-problem SP can be defined as follows:

[0079]

[0080] Based on the solution to the above problem, the single unit pricing cutting plane 1UC-cut can be further defined as follows:

[0081]

[0082] According to the definition of 1UC-cut, since the right side of the inequality is the minimum value of the left side, the definition of the minimum value shows that the inequality holds, so 1UC-cut is χ i Valid inequalities.

[0083] Preferably, in the above technical solution, step 4 of establishing a unit commitment model based on a single unit pricing cutting plane comprises:

[0084] Given Cut the single unit pricing plane Added to the original unit combination model, the unit combination model 1UC-cut-M based on the single unit Pricing cutting plane is as follows:

[0085]

[0086] In the above formula, N represents the total number of units. It is a concise expression of the power balance constraint, and L is the right-hand side term of the power balance constraint;

[0087] According to the single unit pricing cutting plane definition, is i Therefore, the above compact and concise model based on the Pricing cutting plane of a single unit is an effective model for the unit commitment problem.

[0088] Since the continuous relaxation optimal value of the above tight and concise model based on the single unit pricing cutting plane is not less than The continuous relaxation optimal value of The continuous relaxation optimal value of is not less than the continuous relaxation optimal value of the original unit combination basic model. Therefore, the above tight and concise model based on the single unit Pricing cutting plane is a tighter model than the basic model.

[0089] Specifically:

[0090] Given The unit combination model based on the single unit pricing cutting plane (1UC-cut-M) is as follows:

[0091]

[0092] If you take That is, taking the convex hull price, the objective function value of the continuous relaxation problem above is equal to the objective function value of the following problem (UC-Conv-M-CR):

[0093]

[0094] The above theory is recorded as Theorem 1, and the reason is proved as follows:

[0095] (a) Note (χ i ) CR is i The direct continuous relaxation of is x i It is also a valid inequality for conv(χ i ) is an effective inequality. And because Therefore, the objective function value of the continuous relaxation of 1UC-cut-M is less than or equal to the objective function value of UC-Conv-M-CR.

[0096] (b) is denoted as 1UC-M.

[0097]

[0098] because Obviously, the objective function value of the continuous relaxation of 1UC-M is less than or equal to the objective function value of the continuous relaxation of 1UC-cut-M.

[0099] (c) Any feasible solution to 1UC-M Then there is

[0100]

[0101] The objective function value of .

[0102] The last ≥ by Get, the last one =, because is the optimal multiplier. The formula before the equal sign is the Lagrangian dual of UC-Conv-M-CR, and the strong duality of linear programming holds. Therefore, the continuous relaxation objective function value of 1UC-M is greater than or equal to the continuous relaxation objective function value of UC-Conv-M-CR.

[0103] In summary, the objective function value of the continuous relaxation problem of 1UC-cut-M is equal to the objective function value of the following problem (UC-Conv-M-CR).

[0104] Based on the conclusion obtained in (5), we can further derive two inferences, which are given and proved below.

[0105] Corollary 1: When Right now When it is the optimal multiplier of the continuous relaxation of the UC problem, the objective function value of the continuous relaxation of the UC problem (UC-M-CR) is equal to the objective function value of 1UC-cut-M-CR, that is, the introduction of 1UC-cut will not make the original UC problem model tighter.

[0106] The reasons are as follows:

[0107] (a) Note (χ i ) CR is i The direct continuous relaxation of is x i , and Therefore, the objective function value of 1UC-cut-M-CR is less than or equal to the objective function value of UC-M-CR.

[0108] (b) Due to Obviously, the objective function value of the continuous relaxation of 1UC-M is less than or equal to the objective function value of the continuous relaxation of 1UC-cut-M.

[0109] (c) Any feasible solution to 1UC-M Then there is

[0110]

[0111] The objective function value of .

[0112] The last ≥ by Get, the last one =, because is the optimal multiplier. The formula before the equal sign is the Lagrangian dual of UC-Conv-M-CR, and the strong duality of linear programming holds. Therefore, the continuous relaxation objective function value of 1UC-M is greater than or equal to the continuous relaxation objective function value of UC-M-CR.

[0113] In summary, the objective function value of the continuous relaxation problem of 1UC-cut-M is equal to the objective function value of the problem (UC-M-CR). Corollary 1 is proved.

[0114] Corollary 2: Assuming that the objective function value of UC-M-CR is less than that of UC-Conv-M-CR, the UC-M model is not the best UC model. For any satisfy Then 1UC-cut-M is tighter than UC-M model.

[0115] The reasons are as follows:

[0116] first It must exist. Use proof by contradiction. If it does not exist, Then there is

[0117]

[0118] According to the DW method, the objective function value of UC-M-CR is equal to the objective function value of UC-Conv-M-CR, which is inconsistent with the assumption. Therefore, there must be

[0119] From the proof of Theorem 1, we can know that the objective function value of 1UC-cut-M-CR is greater than or equal to the objective function value of 1UC-M-CR. because but The objective function value of .

[0121] Therefore, 1UC-cut-M is tighter than the UC-M model, and the proof is complete.

[0122] Preferably, in the above technical solution, the unit commitment model established in step 4 is a tight and concise model of the unit commitment problem based on the single unit pricing cutting plane. Considering the unit commitment model in two time periods, the optimization objective function is:

[0123]

[0124] The constraints are:

[0125] 1) Power balance constraints

[0126]

[0127] 2) Spinning reserve constraints

[0128]

[0129] 3) State variable constraints

[0130] s i,t -d i,t =u i,t -u i,t-1

[0131] 4) Minimum start / stop time constraints

[0132]

[0133] 5) Unit output constraints

[0134] u i,t P i ≤P i,t

[0135]

[0136] 6) Unit climbing constraints

[0137] P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t P start,i

[0138] P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i

[0139] 7) Start-up cost constraints

[0140] S i,t ≥C hot,i s i,t

[0141]

[0142] 8) Initial state constraints

[0143] u i,t =u i,0 ,t∈[1,…,U i +L i ]

[0144] 9) Linearization constraint of quadratic term of cost function

[0145] z i,t ≥2γ i p i,l P i,t -γ i (p i,l )2 l=0,1,2,…,L

[0146] Where L is the given segmentation parameter,

[0147] 10) Binary variable constraints

[0148] u i,t ,s i,t ,d i,t ∈{0,1};

[0149] 11) 1UC-cut

[0150] Given definition

[0151]

[0152] Then the 1UC-cut constraint is given:

[0153]

[0154] In the above constraint formula, F C is the optimization goal, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β i is the coefficient of the power generation cost function of unit i, u i,t represents the start / stop status of unit i in period t, u i,t =0 means that unit i is shut down during period t, u i,t =1 means that unit i is started during period t; s i,t represents the start-up status of unit i in period t, s i,t =1 means that unit i is started and running during period t, s i,t =0 means other situations, x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1 ,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t represents the shutdown status of unit i in period t, d i,t =1 means that unit i is shut down during period t, d i,t =0 indicates other situations); P D,t is the load demand during period t, R t is the spinning reserve demand during period t; represents the upper limit of the output of unit i, P i represents the lower bound of the output of unit i; [·] + represents max(0,·), T on,i represents the minimum operating time of unit i, T off,i represents the minimum downtime of unit i, U i =[min(T,u i,0 ( T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )( T off,i +T i,0 ))] + ,u i,0 represents the initial state before the dispatch of unit i, T i,0 Indicates the start / stop time of unit i before scheduling. Positive numbers are the number of periods that have been started, and negative numbers are the number of periods that have been stopped. min(·,·) means the minimum of the two. Indicates that unit i is Always on; P up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,iThey represent the down-slope limit and shutdown slope limit of unit i respectively; C hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i; when t- T off,i -T cold,i ≤0 and [-T i,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; in addition, f init,i,t =0; x i The feasible domain formed by all operating constraints of unit i; the operating constraints include: state variable constraints, minimum start / stop time constraints, unit output constraints, unit ramp constraints, startup cost constraints, initial state constraints, cost function quadratic term linearization constraints, and binary variable constraints; Represents the convex hull price.

[0155] Compared with the prior art, the present invention has the following beneficial effects: the present invention is a method for constructing a tight and concise model of the unit combination problem based on the single unit pricing cutting plane. Taking into account the characteristic that the tighter the original model in the UC model of the power system, the more simplicity will be sacrificed, resulting in the characteristic that the calculation efficiency may not be improved, by adding DWB cuts to the original UC model, the original model is as tight as the convex hull model, but also has simplicity, which reduces the complexity of solving the unit model, greatly improves the calculation efficiency, and has been rigorously mathematically proven and has a theoretical basis. At the same time, the model solution based on the Gurobi11.0.0 tool shows that the compact and concise two-period unit combination model constructed by the unit combination model establishment method based on the single-unit Pricing cutting plane provided by the present invention, when the objective function is piecewise linearized, sets the solution accuracy to (0.00001%), and the calculation efficiency of the model is improved. In the unit combination model without the Pricing cutting plane, the total time consumed for data processing and solution is 11.66s, and in the unit combination model with the Pricing cutting plane, the total time consumed for data processing and solution is 11.20s. In summary, the present invention provides a method and device for establishing a unit combination model with a single-unit Pricing cutting plane for power grid companies, which is used to control and dispatch power grid power generation resources, while meeting the actual needs of the units to complete the contracted electricity, and achieving the goals of optimal resource allocation and energy conservation and emission reduction. BRIEF DESCRIPTION OF THE DRAWINGS

[0156] Figure 1It is a flow chart of a method for constructing a compact and concise model for unit commitment problem based on a single unit pricing cutting plane according to the present invention. DETAILED DESCRIPTION

[0157] The specific implementation modes of the present invention are described in detail below in conjunction with the accompanying drawings, but it should be understood that the protection scope of the present invention is not limited by the specific implementation modes.

[0158] Unless explicitly stated otherwise, throughout the specification and claims, the term “comprise” or variations such as “include” or “comprising”, etc., will be understood to include the stated elements or components but not to exclude other elements or components.

[0159] like Figure 1 As shown, a method for constructing a tight and concise model of a unit commitment problem based on a single unit pricing cutting plane according to a specific embodiment of the present invention is illustrated by taking a two-period power system unit commitment example, where (T=24, N=5).

[0160] 1. If Figure 1 As shown, the method for establishing the unit combination model of this embodiment includes the following steps:

[0161] Collect basic data of power system generator units;

[0162] The basic data of the generator set includes operating characteristic data and load forecast data of the generator set.

[0163] Table 1 Generator data (I)

[0164]

[0165] Table 2 Generator data (II)

[0166]

[0167]

[0168] Table 3 Load and spinning reserve data for each period

[0169] Time Active load(MW) Spinning reserve (MW) 1 350 35 2 375 37.5 3 425 42.5 4 475 47.5 5 500 50 6 550 55 7 575 57.5 8 600 60 9 650 65 10 700 70 11 725 72.5 12 750 75 13 700 70 14 650 65 15 600 60 16 525 52.5 17 500 50 18 550 55 19 600 60 20 700 70 21 650 65 22 550 55 23 450 45 24 400 40

[0170] The spinning reserve data for each period is 10% of the total power of all units.

[0171] 2. Establish a 2-period unit commitment model, and its optimization objective function is:

[0172]

[0173] Among them, F C is the optimization goal, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β i is the coefficient of the power generation cost function of unit i, u i,t Indicates the start / stop status of unit i in period t (u i,t =0 means that unit i is shut down during period t, u i,t =1 means unit i is started during period t), s i,t represents the start-up status of unit i in period t (s i,t =1 means that unit i is started and running during period t, s i,t =0 means other cases), x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1 ,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1 ,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t Indicates the shutdown status of unit i in period t (d i,t =1 means that unit i is shut down during period t, d i,t =0 indicates other situations).

[0174] a) Power balance constraints:

[0175]

[0176] Where P D,t is the load demand during period t.

[0177] b) Spinning reserve constraints

[0178]

[0179] Where R t is the spinning reserve demand data for period t, Represents the upper bound of the output of unit i.

[0180] c) State variable constraints

[0181] s i,t -d i,t =u i,t -u i,t-1

[0182] d) Minimum start / stop time constraints

[0183]

[0184]

[0185] in Indicates that unit i is Always on, [·] + represents max(0,·), U i =[min(T,u i,0 (T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )(T off,i +T i,0 ))] + ,u i,0 represents the initial state before the dispatch of unit i, T i,0 Indicates the start / stop time of unit i before scheduling (positive number is the number of time periods that have been started, negative number is the number of time periods that have been stopped).

[0186] e) Unit output constraints

[0187] u i,t P i ≤P i,t

[0188]

[0189] in P i Represents the lower bound of the output of unit i.

[0190] f) Unit climbing constraints

[0191] P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t P start,i

[0192] P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i

[0193] Where P up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,i They represent the down-slope limit and shutdown slope limit of unit i respectively.

[0194] g) Start-up cost constraints

[0195] S i,t ≥C hot,i s i,t

[0196]

[0197] Among them C hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i. When t- T off,i -T cold,i ≤0 and [-T i,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; in addition, f init,i,t =0.

[0198] h) Initial state constraints

[0199] u i,t =u i,0 ,t∈[1,…,U i +L i ]

[0200] where u i,0 Represents the initial state before unit i is dispatched.

[0201] i) Linearization constraint of quadratic term in cost function

[0202] z i,t ≥2γ i p i,l P i,t -γ i (p i,l ) 2 l=0,1,2,…,L

[0203] Where L is the given segmentation parameter,

[0204] j) Binary variable constraints

[0205] u i,t ,s i,t ,d i,t ∈{0,1}.

[0206] 3. Forming a concise expression of the two-period UC model (UC-M)

[0207]

[0208] Among them, x i =[u i ;s i ;d i ],n=3NT, A is a concise expression of system coupling constraints (including power balance constraints and spinning reserve constraints). i is the coefficient matrix of system coupling constraints of unit i, L is the right-hand side term of system coupling constraints, χ i The feasible domain formed by all operating constraints of unit i (including: state variable constraints, minimum start / stop time constraints, unit output constraints, unit climbing constraints, startup cost constraints, initial state constraints, linearization constraints of quadratic terms of cost function, and binary variable constraints).

[0209] Fourth, based on the actual operating requirements of the unit, the convex hull price is calculated using the Dantzig-Wolfe method.

[0210] According to the data of unit combination and convex analysis theory, the convex envelope function v of (L) is constructed c (L),

[0211]

[0212] Among them, λ is The Lagrange multiplier of . Solve for v c Subgradient of (L) is the convex hull price λ * (L), that is

[0213]

[0214] remember is conv(χ i ) of all extreme points (assuming χ i bounded), then It is equivalent to the following single unit pricing problem (1UC-PP):

[0215]

[0216] When 1UC-RPP is feasible, its dual problem (1UC-PP-D) is:

[0217]

[0218] Since 1UC-PP-D is too large to be solved directly, the dual problem of the single-unit finite pricing problem corresponding to 1UC-PP-D (1UC-RPP) is constructed as follows:

[0219]

[0220] At this point, we can get The relaxed master problem (RMP) is as follows:

[0221]

[0222] Furthermore, the Pricing subproblem (SP) is defined as follows:

[0223]

[0224] First, initialize the variables, k = 1,

[0225] Then follow these steps:

[0226] Step 1: Solve RMP to obtain λ k ,

[0227] Step 2: Solve SP to get r i (λ k )as well as

[0228] Step 3: If Then k is the optimal solution, otherwise Go to step 1.

[0229] 5. Single-unit Pricing Cut Plane Construction

[0230] Given For each unit i, the following Pricing subproblem (SP) can be defined as follows:

[0231]

[0232] Based on the solutions of each problem obtained in (4), substitute the single unit pricing cut plane (1UC-cut).

[0233]

[0234] From the definition of the minimum value, we know that this inequality must hold, so 1UC-cut is X i Valid inequalities.

[0235] VI. Constructing a unit combination model based on the pricing cutting plane of a single unit

[0236] Given By adding the Pricing cut plane (1UC-cut) obtained in (5) to the original UC-M model, the unit commitment model (1UC-cut-M) based on the single unit Pricing cut plane can be obtained as follows:

[0237]

[0238] 7. Finally, a compact and concise model of the unit combination problem based on the single unit Pricing cutting plane is obtained.

[0239] The model is established using the above-mentioned method for establishing the unit combination model.

[0240] Considering the two-period unit commitment model, the optimization objective function is:

[0241]

[0242] 1) Power balance constraints

[0243]

[0244] 2) Spinning reserve constraints

[0245]

[0246] 3) State variable constraints

[0247] s i,t -d i,t =u i,t -u i,t-1

[0248] 4) Minimum start / stop time constraints

[0249]

[0250] 5) Unit output constraints

[0251] u i,t P i ≤P i,t

[0252]

[0253] 6) Unit climbing constraints

[0254] P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t P start,i

[0255] P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i

[0256] 7) Start-up cost constraints

[0257] S i,t ≥C hot,i s i,t

[0258]

[0259] 8) Initial state constraints

[0260] u i,t =u i,0 ,t∈[1,…,U i +L i ]

[0261] 9) Linearization constraint of quadratic term of cost function

[0262] z i,t ≥2γ i p i,l P i,t -γ i (p i,l ) 2 l=0,1,2,…,L

[0263] Where L is the given segmentation parameter,

[0264] 10) Binary variable constraints

[0265] u i,t,s i,t ,d i,t ∈{0,1}.

[0266] 11) 1UC-cut

[0267] Given definition

[0268]

[0269] Then the 1UC-cut constraint is given:

[0270]

[0271] In the above constraint formula, F C is the optimization goal, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β i is the coefficient of the power generation cost function of unit i, u i,t Indicates the start / stop status of unit i in period t (u i,t =0 means that unit i is shut down during period t, u i,t =1 means unit i is started during period t), s i,t represents the start-up status of unit i in period t (s i,t =1 means that unit i is started and running during period t, s i,t =0 means other cases), x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1 ,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t Indicates the shutdown status of unit i in period t (d i,t =1 means that unit i is shut down during period t, d i,t =0 indicates other situations). D,t is the load demand during period t, R t is the spinning reserve demand during period t. represents the upper limit of the output of unit i, P i represents the lower bound of the output of unit i. [·] + represents max(0,·), T on,i represents the minimum operating time of unit i, T off,i represents the minimum downtime of unit i, U i =[min(T,u i,0 ( T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )( T off,i +T i,0 ))] + ,u i,0 represents the initial state before the dispatch of unit i, T i,0 represents the start / stop time of unit i before scheduling (positive number is the number of periods that have been started, negative number is the number of periods that have been stopped), min(·,·) means the minimum of the two. Indicates that unit i is Always on. up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,i They represent the down-climbing limit and shutdown climbing limit of unit i respectively. hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i. When t- T off,i -Tcold,i ≤0 and [-T i,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; in addition, f init,i,t =0. i The feasible domain formed by all operating constraints of unit i (including: state variable constraints, minimum start / stop time constraints, unit output constraints, unit climbing constraints, startup cost constraints, initial state constraints, linearization constraints of quadratic terms of cost function, and binary variable constraints). Represents the convex hull price.

[0272] The foregoing description of specific exemplary embodiments of the present invention is for the purpose of illustration and demonstration. These descriptions are not intended to limit the present invention to the precise form disclosed, and it is clear that many changes and variations can be made based on the above teachings. The purpose of selecting and describing the exemplary embodiments is to explain the specific principles of the present invention and its practical application, so that those skilled in the art can realize and utilize various different exemplary embodiments of the present invention and various different selections and changes. The scope of the present invention is intended to be limited by the claims and their equivalents.

Claims

1. A method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane, characterized in that: The following steps are involved: Step 1: Obtain basic data of power system generator sets; Step 2: Establish a unit combination model based on the basic data of the generator set; Step 3: Define the pricing sub-problem, and based on the solution of the sub-problem, define the pricing cutting plane for the single unit; Step 4: Add the single unit pricing cutting plane to the unit combination model, and establish a unit combination model based on the single unit pricing cutting plane.

2. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1 is characterized in that: Step 1: The basic data of the generator set includes the operating characteristic data of the generator set, load forecast data and spinning reserve data of each time period.

3. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1 is characterized in that: Step 2: The unit combination model includes defining arbitrary state variables and establishing arbitrary constraints; the constraints include startup cost constraints, unit initial state constraints, unit logical state constraints, unit minimum rise and fall time constraints, unit restrictions and upper bound constraints, climbing constraints and power balance constraints.

4. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1 is characterized in that: Step 2: Establishing the unit combination model includes: (a) Objective function in, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β i is the coefficient of the power generation cost function of unit i, u i,t represents the start / stop status of unit i in period t, where u i,t =0 means that unit i is shut down during period t, u i,t =1 means that unit i is started during period t; s i,t represents the start-up status of unit i in period t, s i,t =1 means that unit i is started and running during period t, s i,t =0 indicates other situations; x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1 ,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1 ,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t represents the shutdown status of unit i in period t, d i,t =1 means that unit i is shut down during period t, d i,t =0 means other situations; (b) Power balance constraints Among them, P D,t is the load demand during period t; (c) Spinning reserve constraints in, is the upper limit of the output of unit i, R t is the spinning reserve demand during period t; (d) State variable constraints s i,t -d i,t =u i,t -u i,t-1 (e) Minimum start / stop time constraints Among them, T on,i represents the minimum operating time of unit i, T off,i represents the minimum downtime of unit i, U i =[min(T,u i,0 ( T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )( T off,i +T i,0 ))] + ; It should be noted that u i,0 represents the initial state before the dispatch of unit i, T i,0 Indicates the start / stop time of unit i before scheduling. Positive numbers are the number of periods that have been started, and negative numbers are the number of periods that have been stopped. min(·,·) means the minimum of the two. [·] + =max(0,·); (f) Unit output constraints in i,t P i ≤P i,t in, P i is the lower bound of the output of unit i; (g) Unit climbing constraints P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t P start,i P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i Among them, P up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,i They represent the down-climbing limit and shutdown climbing limit of unit i respectively; (h) Start-up cost constraints S i,t ≥C hot,i s i,t Among them, when t- T off,i -T cold,i ≤0 and [-T i,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; otherwise, f init,i,t =0; C hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i; (i) Initial state constraints and i,t =and i,0 ,t∈[1,...,U i +L i ] (j) Linearization constraint of quadratic term in cost function z i,t ≥2γ i p i,l P i,t -γ i (p i,l ) 2 l=0,1,2,…,L Where L is the given segmentation parameter, (k) Binary variable constraints u i,t ,s i,t ,d i,t ∈{0,1}; The motor unit model is expressed as follows: Among them, x i =[u i ;s i ;d i ],n=3NT, A is a concise expression of system coupling constraints (including power balance constraints and spinning reserve constraints). i is the coefficient matrix of system coupling constraints of unit i, L is the right-hand side term of system coupling constraints, χ i The feasible domain formed by all operating constraints of unit i; the operating constraints include: state variable constraints, minimum start / stop time constraints, unit output constraints, unit climbing constraints, startup cost constraints, initial state constraints, cost function quadratic term linearization constraints, and binary variable constraints.

5. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1 is characterized in that: The pricing sub-problems defined in step 3 include: (1) Based on the convex analysis theory, the convex envelope function of the unit commitment model is constructed; (2) Calculate the convex hull price based on the subgradient function of the convex hull function; (3) Construct the dual problem of the finite unit pricing problem and obtain the relaxed master problem based on it; (4) Given the convex hull price, define a subproblem for each single machine group; (5) Construct a cutting plane based on the results obtained for each sub-problem.

6. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 5 is characterized in that: The pricing sub-problems defined in step 3 include: The Dantzig-Wolfe method is used to calculate the convex hull price. According to the convex analysis theory, the convex envelope function v of the unit combination model v(L) is constructed. c (L), Among them, λ is The Lagrange multiplier of ; v c Subgradient of (L) is the convex hull price λ * (L), that is remember is conv(χ i ), assuming that χ i If bounded, It is equivalent to the following single-unit pricing problem 1UC-PP: If the Lagrangian relaxation model 1UC-RPP of 1UC-PP is feasible, then its dual problem 1UC-PP-D is: 1UC-PP-D uses constraint generation method to solve; given a subset The dual problem 1UC-RPP of the single-unit finite pricing problem corresponding to 1UC-PP-D can be constructed as follows: At this point, we can get The relaxed master problem RMP is as follows: The pricing subproblem SP is defined as follows: Step 0: k = 1, Step 1: Solve RMP to obtain λ k , Step 2: Solve SP to get r i (λ k )as well as Step 3: If Then k is the optimal solution, otherwise Go to step 1.

7. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1, characterized in that: Step 3 defines the pricing cutting plane for a single unit group, including: Given For each unit i, the following pricing sub-problem SP can be defined as follows: Based on the solution to the above problem, the single unit pricing cutting plane 1UC-cut can be further defined as follows: According to the definition of 1UC-cut, since the right side of the inequality is the minimum value of the left side, the definition of the minimum value shows that the inequality holds, so 1UC-cut is χ i Valid inequalities.

8. The method for constructing a compact and concise model for unit commitment problem based on a single unit pricing cutting plane according to claim 1, characterized in that: Step 4: Establishing a unit combination model based on the single unit pricing cutting plane includes: Given Cut the single unit pricing plane Adding it to the original unit combination model, the unit combination model 1UC-cut-M based on the single unit Pricing cutting plane is obtained as follows: In the above formula, N represents the total number of units. It is a concise expression of the power balance constraint, and L is the right-hand side term of the power balance constraint; According to the single unit pricing cutting plane definition, is i Therefore, the above compact and concise model based on the Pricing cutting plane of a single unit is an effective model for the unit commitment problem. Since the continuous relaxation optimal value of the above tight and concise model based on the single unit pricing cutting plane is not less than The continuous relaxation optimal value of The continuous relaxation optimal value of is not less than the continuous relaxation optimal value of the original unit combination basic model. Therefore, the above tight and concise model based on the single unit Pricing cutting plane is a tighter model than the basic model.

9. The method for constructing a compact and concise model for the unit commitment problem based on a single unit pricing cutting plane according to claim 1, characterized in that: The unit commitment model established in step 4 has the following optimization objective function: The constraints are: 1) Power balance constraints 2) Spinning reserve constraints 3) State variable constraints s i,t -d i,t =u i,t -u i,t-1 4) Minimum start / stop time constraints 5) Unit output constraints in i,t P i ≤P i,t 6) Unit climbing constraints P i,t -P i,t-1 ≤u i,t-1 P up,i +s i,t s tart,i P i,t-1 -P i,t ≤u i,t P down,i +d i,t P shut,i 7) Start-up cost constraints S i,t ≥C hot,i s i,t 8) Initial state constraints and i,t =and i,0 ,t∈[1,…,U i +L i ] 9) Linearization constraint of quadratic term of cost function z i,t ≥2γ i p i,l P i,t -γ i (p i,l ) 2 l=0,1,2...,L Where L is the given segmentation parameter, 10) Binary variable constraints u i,t ,s i,t ,d i,t ∈{0,1}; 11) 1UC-cut Given definition Then the 1UC-cut constraint is given: In the above constraint formula, F C is the optimization goal, is the unit number, is the time period number, N and T represent the total number of generator sets and the total number of time periods respectively, i,t is an auxiliary variable introduced to facilitate the quadratic term γ of the unit power generation cost function. i (P i,t ) 2 Linearization, S i,t is the startup cost of unit i during period t, P i,t is the output of unit i in period t, α i , β i is the coefficient of the power generation cost function of unit i, u i,t represents the start / stop status of unit i in period t, u i,t =0 means that unit i is shut down during period t, u i,t =1 means that unit i is started during period t; s i,t represents the start-up status of unit i in period t, s i,t =1 means that unit i is started and running during period t, s i,t =0 means other situations, x i =[u i ;s i ;d i ;P i ; S i ;z i ],u i =[u i,1 ,…u i,T ],s i =[s i,1 ,…s i,T ],d i =[d i,1 ,…d i,T ], P i =[P i,1 ,…P i,T ],S i =[S i,1 ,…S i,T ],z i =[z i,1 ,…z i,T ], c i For x i The coefficient, c i It can be obtained from the above objective function expression, d i,t represents the shutdown status of unit i in period t, d i,t =1 means that unit i is shut down during period t, d i,t =0 indicates other situations); P D,t is the load demand during period t, R t is the spinning reserve demand during period t; represents the upper limit of the output of unit i, P i represents the lower bound of the output of unit i; [·] + represents max(0,·), T on,i represents the minimum operating time of unit i, T off,i represents the minimum downtime of unit i, U i =[min(T,u i,0 ( T on,i -T i,0 ))] + , L i =[min(T,(1-u i,0 )( T off,i +T i,0 ))] + ,u i,0 represents the initial state before the dispatch of unit i, T i,0 Indicates the start / stop time of unit i before scheduling. Positive numbers are the number of periods that have been started, and negative numbers are the number of periods that have been stopped. min(·,·) means the minimum of the two. Indicates that unit i is Always on; P up,i and P start,i They represent the ramp limit and start-up ramp limit of unit i, respectively. down,i and P shut,i They represent the down-slope limit and shutdown slope limit of unit i respectively; C hot,i represents the hot start cost of unit i, C cold,i represents the cold start cost of unit i, T cold,i Indicates the cold start time of unit i; When t- T off,i -T cold,i ≤0 and [-T ,0 ] + <|t- T off,i -T cold,i When -1|+1, f init,i,t =1; In addition, init,i,t =0; x i The feasible domain formed by all operating constraints of unit i; the operating constraints include: state variable constraints, minimum start / stop time constraints, unit output constraints, unit ramp constraints, startup cost constraints, initial state constraints, cost function quadratic term linearization constraints, and binary variable constraints; Represents the convex hull price.