Convex hull construction method and system for single-unit combination problem
By constructing multi-state models and state transfer rules, establishing a dynamic programming model and transforming it into a linear programming model, the problems of low efficiency and low accuracy of unit convex hull construction in the existing technology are solved, and a more efficient and reliable power system is achieved Scheduling and energy management.
Patent Information
- Application Number
- CN202410839891.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-26
- Publication Date
- 2024-11-15
AI Technical Summary
The existing unit convex hull construction methods are low efficiency, low accuracy and low reliability, making it difficult to meet the real-time scheduling needs of large-scale power systems, especially when the grid load changes rapidly.
By abstractly constructing a multi-state model, a state transfer rule is constructed based on the minimum start-stop time constraint, a dynamic programming model is established, and a mixed integer programming model is converted into a linear programming model to determine the best power generator start-up Stop strategy.
It improves the operating efficiency and responsiveness of the power system, reduces energy waste, enhances the overall safety and stability of the power grid, simplifies the calculation process, and improves the economicality of power production.
Smart Images

Figure CN118971174A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of power system dispatching, and in particular to a convex hull construction method and system for a single unit combination problem. Background Art
[0002] The economic operation and reliability of power systems have always been key research topics in the field of power engineering. With the expansion of the scale of power grids and the continuous development of the power market, higher requirements have been put forward for the dispatch and management of power systems, especially the start-up and shutdown operations of single units, which are directly related to the economy and stability of the power system. Therefore, how to efficiently make unit start-up and shutdown decisions has become an important research direction. Traditionally, this problem is mainly handled by the Mixed-Integer Programming (MIP) model, which can effectively describe the start-up and shutdown states of the units and their constraints. However, in actual operation, due to its high nonlinearity and complexity, it often requires large computing resources and time.
[0003] Although existing technologies are able to handle complex unit start and shutdown problems, they still show several shortcomings when dealing with real-time scheduling problems in large-scale power systems. First, the mixed integer programming model is limited by the solution speed and scale in practical applications, especially when the grid load changes rapidly, it is difficult to meet the needs of real-time scheduling. Secondly, dynamic programming is difficult to directly adapt to the computational burden brought by the expansion of scale when dealing with multi-state and multi-stage decision-making problems. In addition, when the linear programming model is directly applied to deal with the unit start and shutdown problem, the nonlinear characteristics of the state transition are ignored, which may lead to non-optimal or unstable decisions. Summary of the invention
[0004] In view of the above-mentioned problems, the present invention is proposed.
[0005] Therefore, the technical problem solved by the present invention is that the existing method for constructing the convex hull of a generator set has low efficiency, low accuracy, low reliability, and the problem of how to make start-stop decisions for generator sets in a point power system.
[0006] To solve the above technical problems, the present invention provides the following technical solutions: a convex hull construction method for a single-unit combination problem, including abstracting and constructing a multi-state model to characterize the start and stop states of the unit for the start and stop operations of the single unit in the power system, and constructing the state space of the unit based on the unit state characterization; constructing state transfer rules based on the minimum start and stop time constraints of the unit, and establishing a dynamic programming model to calculate the optimal operating cost; transforming the single-unit combination problem from a mixed integer programming model to a linear programming model, constructing a linear programming model based on the dynamic programming model, and determining the optimal start and stop strategy for the electric generator.
[0007] As a preferred solution of the convex hull construction method for the single-unit combination problem described in the present invention, wherein: the start-stop state of the unit characterization includes the state related to the start-stop of the unit in the power system, which is represented by the start-stop state of the unit, the start-up instruction, the shutdown instruction and the current start-stop state duration. The single-unit combination state represented by the start-stop state and the start-stop state duration is abstracted into a multi-state model, which is expressed as:
[0008] (x,u,d,l)
[0009] Among them, x represents the start and stop status of the unit, u represents the start command, d represents the stop command, and l represents the duration of the current start and stop status.
[0010] As a preferred solution of the convex hull construction method for the single unit unit combination problem of the present invention, wherein: the state space of the unit is constructed including constructing the state space of the unit based on the unit state representation; when the unit is kept on, x=1, the state space of the unit is represented by the set Ω on Indicates; if the minimum startup time T on =1, the unit startup state space set Ω on It is expressed as:
[0011] Ω on =={(x,u,d,l)∈1×{0,1}×0×1}
[0012] If the minimum startup time T on >1, the unit startup state space set Ω on It is expressed as:
[0013]
[0014] When the unit remains shut down, x = 0, the state space of the unit passes through the set Ω off Indicates; if the minimum shutdown time T off =1, the unit shutdown state space set Ω off It is expressed as:
[0015] Ω off =={(x,u,d,l)∈0×0×{0,1}×1}
[0016] If the minimum shutdown time T off >1, the unit shutdown state space set Ω off It is expressed as:
[0017]
[0018] The minimum startup time and minimum shutdown time are analyzed through the space characteristics of the startup and shutdown states of the unit.
[0019] As a preferred solution of the convex hull construction method for the single unit combination problem described in the present invention, wherein: the state transition rule constructed includes constructing the state transition rule of the unit startup and shutdown state space based on the minimum startup and shutdown time constraint of the unit; when the unit remains on and the minimum startup time T on =1, the state transition rule is adapted to the transition from the unit state (1,1,0,1) to the state (1,0,0,1), or from the state (1,1,0,1) to the state (0,0,1,1); when the unit remains on, and the minimum on time T on >1, the state transition rule is applicable to the transition from the unit state (1,1,0,1) to the state (1,0,0,2), or from the state (1,0,0,l) and 1 <l<T on , transfer to state (1,0,0,l+1), or from state (1,0,0,T on ) transfers to state (0,0,1,1); when the unit remains shut down and the minimum shutdown time T off =1, the state transition rule is adapted to the state (0,0,1,1) of the unit to the state (0,0,0,1), or the state (0,0,1,1) to the state (1,0,1,1); when the unit remains shut down and the minimum start time T off >1, the state transition rule is applicable to the transition from the unit state (0,0,1,1) to the state (0,0,0,2), or from the state (0,0,0,l) and 1 <l<T off , transfer to state (0,0,0,l+1), or from state (1,0,0,T off ) transfers to state (1,1,0,1).
[0020] As a preferred solution of the convex hull construction method for the single unit unit commitment problem of the present invention, wherein: the establishment of the dynamic programming model includes establishing the unit commitment problem as a dynamic programming model based on the state space and state transition rules of the unit, which is expressed as:
[0021] Z DP =min i∈Ω {v DP (i,1)}
[0022]
[0023] v DP (i,T)=V(i,T),i∈Ω
[0024] Among them, Z DP represents the optimal operating cost of the corresponding dynamic programming model, Ω represents the state space, Ω=Ω on +Ω off , v DP(i, t) represents the optimal operating cost from time period t to the last time period in the dynamic programming model while maintaining state i during time period t, j represents the state transferred from state i, V(j, t) represents the operating cost of maintaining state j during time period t, v DP (i, T) is the boundary condition of the last period T in the dynamic programming model, and V(i, T) represents the operating cost of the unit maintaining state i in the last period T.
[0025] As a preferred solution of the convex hull construction method for the single unit unit combination problem of the present invention, wherein: the construction of the linear programming model includes transforming the single unit unit combination problem from a mixed integer programming model to a linear programming model, and constructing a linear programming model based on a dynamic programming model, which is expressed as:
[0026] maxZ LP
[0027] Z LP ≤v LP (i,1),i∈Ω
[0028] v LP (i,t)≤v LP (j,t+1)+V(j,t),i∈Ω,j∈Ω from (i),t∈{1,...,T-1}
[0029] v LP (i,T)≤V(i,T),i∈Ω
[0030] Among them, Z LP represents the optimal operating cost of the corresponding linear programming model, v LP (i, t) represents the optimal operating cost from period t to the last period in the linear programming model while maintaining state i during period t, v LP (i,T) represents the boundary condition of the last period T in the linear programming model, and the cost of the terminal state does not exceed V(i,T).
[0031] As a preferred solution of the convex hull construction method for the single-unit combination problem described in the present invention, the power generator start-stop strategy includes determining the optimal power generator start-stop strategy based on the cost and demand of unit state transfer by calculating the optimal operating cost of the linear programming model.
[0032] Another object of the present invention is to provide a convex hull construction system for a single unit combination problem, which can construct state transfer rules based on the minimum start and stop time constraints of the unit, establish a dynamic programming model to calculate the optimal operating cost, and solve the problem of low efficiency in the current unit convex hull construction.
[0033] As a preferred solution of the convex hull construction system for the single-unit combination problem described in the present invention, it includes: a state construction module, a dynamic programming module, and a linear programming module; the state construction module is used to abstract and construct a multi-state model to characterize the start and stop state of the unit for the start and stop operation of the single unit in the power system, and construct the state space of the unit based on the unit state characterization; the dynamic programming module is used to construct state transfer rules based on the minimum start and stop time constraints of the unit, and establish a dynamic programming model to calculate the optimal operating cost; the linear programming module is used to transform the single-unit combination problem from a mixed integer programming model to a linear programming model, construct a linear programming model based on the dynamic programming model, and determine the optimal start and stop strategy of the power generator.
[0034] A computer device includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of a convex hull construction method for a single unit combination problem.
[0035] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of a convex hull construction method for a single-unit unit combination problem.
[0036] Beneficial effects of the present invention: The convex hull construction method for the single-unit combination problem provided by the present invention abstracts the start and stop operations of the single unit in the power system and constructs a multi-state model, which not only allows accurate tracking and control of each state change of the unit, but also supports more sophisticated operation decisions by providing a detailed state space, thereby enhancing the adaptability and responsiveness of the power system operation. Through the state transition rules constructed based on the minimum start and stop time constraints, the application of dynamic programming not only provides a theoretically reasonable decision-making process, but also makes the calculation process feasible in actual operation, thereby improving the economy of power production and reducing energy waste. The problem is converted from a mixed integer programming model to a linear programming model, which not only improves the operating efficiency, but also indirectly enhances the overall security of the power grid by ensuring the stability and reliability of the power supply. The present invention achieves better results in terms of efficiency, cost and stability. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative work.
[0038] Figure 1 An overall flow chart of a convex hull construction method for a single unit combination problem provided in the first embodiment of the present invention.
[0039] Figure 2 This is a diagram of unit combination results obtained by a convex hull model of a convex hull construction method for a single unit unit combination problem provided in a second embodiment of the present invention.
[0040] Figure 3 A unit combination result diagram of a mixed integer programming model of a convex hull construction method for a single unit unit combination problem provided in the second embodiment of the present invention.
[0041] Figure 4 A graph showing the time required to solve a convex hull model of a convex hull construction method for a single unit combination problem provided in the second embodiment of the present invention.
[0042] Figure 5 An overall flow chart of a convex hull construction system for a single unit combination problem provided in the third embodiment of the present invention. DETAILED DESCRIPTION
[0043] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the drawings of the specification. Obviously, the described embodiments are part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary persons in the art without creative work should fall within the scope of protection of the present invention.
[0044] Example 1
[0045] Reference Figure 1 , as an embodiment of the present invention, provides a convex hull construction method for a single unit unit combination problem, comprising:
[0046] S1: For the start and stop operation of a single unit in the power system, a multi-state model is abstracted and constructed to represent the start and stop state of the unit, and the state space of the unit is constructed based on the unit state representation.
[0047] Furthermore, the start and stop states of the units are characterized, including the states related to the start and stop of the units in the power system, which are represented by the start and stop states of the units, the start instructions, the stop instructions and the current start and stop state duration. The combined state of the single unit represented by the start and stop states and the start and stop state duration is abstracted into a multi-state model, which is expressed as:
[0048] (x,u,d,l)
[0049] Among them, x represents the start and stop status of the unit, u represents the start command, d represents the stop command, and l represents the duration of the current start and stop status.
[0050] It should be noted that constructing the state space of the unit includes constructing the state space of the unit based on the unit state representation; when the unit remains turned on, x=1, the state space of the unit is represented by the set Ω on Indicates; if the minimum startup time T on =1, the unit startup state space set Ω on It is expressed as:
[0051] Ω on =={(x,u,d,l)∈1×{0,1}×0×1}
[0052] If the minimum startup time T on >1, the unit startup state space set Ω on It is expressed as:
[0053]
[0054] When the unit remains shut down, x = 0, the state space of the unit passes through the set Ω off Indicates; if the minimum shutdown time T off =1, the unit shutdown state space set Ω off It is expressed as:
[0055] Ω off =={(x,u,d,l)∈0×0×{0,1}×1}
[0056] If the minimum shutdown time T off >1, the unit shutdown state space set Ω off It is expressed as:
[0057]
[0058] The minimum startup time and minimum shutdown time are analyzed through the space characteristics of the startup and shutdown states of the unit.
[0059] It should also be noted that by defining the start and stop states of a single unit in the power system, not only the problem of insufficient expression of the start and stop behavior of the unit in the traditional model is solved, but also the flexibility and response speed of the dispatch strategy are improved. The refined representation method allows the system to track and manage the operating status of each unit more accurately, thereby optimizing the operating efficiency of the overall power system. For the start-up state, the state space Ω on According to the minimum startup time T on , and can be refined into more specific subsets to accurately control the optimal startup time of the unit. on = 1, the simplicity of the state space ensures a fast decision response, which is suitable for situations where startup is urgent; on >1, a more complex state space can manage the startup process in detail, optimize the energy efficiency and cost-effectiveness of long-term operation, and the shutdown state space Ωoff Also according to T off The setting adjustments enable the system to maximize energy saving effects while ensuring equipment safety. The creation of these state spaces not only improves the accuracy of operation, but also reduces the wear and maintenance costs of the units through reasonable scheduling, and extends the service life of the equipment. Especially in the frequently changing power demand, the operation of the units can be flexibly adjusted according to the actual situation, effectively reducing ineffective energy consumption and operating costs.
[0060] S2: Construct state transfer rules based on the minimum start and stop time constraints of the unit, and establish a dynamic programming model to calculate the optimal operating cost.
[0061] Furthermore, constructing the state transition rule includes constructing the state transition rule of the unit startup and shutdown state space based on the minimum startup and shutdown time constraint of the unit; when the unit remains on and the minimum startup time T on =1, the state transition rule is adapted to the transition from the unit state (1,1,0,1) to the state (1,0,0,1), or from the state (1,1,0,1) to the state (0,0,1,1); when the unit remains on, and the minimum on time T on >1, the state transition rule is applicable to the transition from the unit state (1,1,0,1) to the state (1,0,0,2), or from the state (1,0,0,l) and 1 <l<T on , transfer to state (1,0,0,l+1), or from state (1,0,0,T on ) transfers to state (0,0,1,1); when the unit remains shut down and the minimum shutdown time T off =1, the state transition rule is adapted to the state (0,0,1,1) of the unit to the state (0,0,0,1), or the state (0,0,1,1) to the state (1,0,1,1); when the unit remains shut down and the minimum start time T off >1, the state transition rule is applicable to the transition from the unit state (0,0,1,1) to the state (0,0,0,2), or from the state (0,0,0,l) and 1 <l<T off , transfer to state (0,0,0,l+1), or from state (1,0,0,T off ) transfers to state (1,1,0,1).
[0062] It should be noted that the establishment of a dynamic programming model includes establishing the unit commitment problem as a dynamic programming model based on the state space and state transition rules of the unit, which can be expressed as:
[0063] Z DP =min i∈Ω {v DP (i,1)}
[0064]
[0065] v DP (i,T)=V(i,T),i∈Ω
[0066] Among them, Z DP represents the optimal operating cost of the corresponding dynamic programming model, Ω represents the state space, Ω=Ω on +Ω off , v DP (i, t) represents the optimal operating cost from time period t to the last time period in the dynamic programming model while maintaining state i during time period t, j represents the state transferred from state i, V(j, t) represents the operating cost of maintaining state j during time period t, v DP (i, T) is the boundary condition of the last period T in the dynamic programming model, and V(i, T) represents the operating cost of the unit maintaining state i in the last period T.
[0067] It should also be noted that the state transfer rules are designed according to the minimum start-up and shutdown time constraints of the unit, which is crucial to ensure the economy and reliability of the unit operation. For example, it is stipulated that when the unit remains in the start-up state and the minimum start-up time T on When T is equal to 1, the unit can transfer from state (1,1,0,1) to state (1,0,0,1) or (0,0,1,1). This design allows rapid response to system load reduction while meeting the minimum operating time, optimizing energy consumption and reducing unnecessary operating costs. on >1, by setting the incremental duration, the operation of the unit can be carefully controlled to make it more in line with the actual power demand, reducing mechanical wear and energy waste caused by frequent start and stop. For the rule design of the shutdown state, when T off =1, the unit can quickly transfer from state (0,0,1,1) to state (0,0,0,1) or (1,0,1,1). Such flexible conversion helps to cope with sudden increase in power demand and ensure the stability and reliability of power supply. off Time, the incremental duration setting also helps to protect mechanical equipment and avoid damage caused by frequent operation. The constructed dynamic programming model integrates the state space and state transition rules, realizes the optimal cost calculation from time period t to t+1, and improves the operating efficiency of the power system.
[0068] S3: Transform the single unit unit combination problem from a mixed integer programming model to a linear programming model, build a linear programming model based on the dynamic programming model, and determine the optimal power generator start-stop strategy.
[0069] Furthermore, constructing a linear programming model includes transforming the unit commitment problem of a single unit from a mixed integer programming model to a linear programming model, and constructing a linear programming model based on a dynamic programming model, which is expressed as:
[0070] maxZ LP
[0071] Z LP ≤v LP (i,1),i∈Ω
[0072] v LP (i,t)≤v LP (j,t+1)+V(j,t),i∈Ω,j∈Ω from (i),t∈{1,...,T-1}
[0073] v LP (i,T)≤V(i,T),i∈Ω
[0074] Among them, Z LP represents the optimal operating cost of the corresponding linear programming model, v LP (i, t) represents the optimal operating cost from period t to the last period in the linear programming model while maintaining state i during period t, v LP (i,T) represents the boundary condition of the last period T in the linear programming model, and the cost of the terminal state does not exceed V(i,T).
[0075] It should be noted that the power generator start-stop strategy includes determining the best power generator start-stop strategy based on the cost and demand of unit state transfer by calculating the optimal operating cost of the linear programming model.
[0076] It should also be noted that in the present invention, the traditional mixed integer programming model is converted into a linear programming model. Mixed integer programming usually involves a large number of binary variables and continuous variables when dealing with unit start-up and shutdown problems, which makes the solution process computationally intensive and time-consuming. By converting it into a linear programming model, the present invention effectively simplifies the complexity of the problem, thereby reducing the demand for computing resources and speeding up the solution. Based on the optimal solution of the linear programming model, the present invention can provide an accurate power generator start-up and shutdown strategy, which takes into account the power demand, the operating cost of the unit and the reliability requirements of the system, thereby optimizing the overall operating efficiency and cost-effectiveness of the power system. By optimizing the cost and strategy output by the model, the system operator can make more accurate decisions to adapt to the ever-changing power market and technical conditions.
[0077] Example 2
[0078] Reference Figure 2-Figure 4, which is an embodiment of the present invention, provides a convex hull construction method for a single unit combination problem. In order to verify the beneficial effects of the present invention, scientific demonstration is carried out through economic benefit calculation and simulation experiments.
[0079] Firstly, based on the unit data in the IEEE-118 test case and combined with the randomly generated electricity price data, the consistency and computational efficiency of the constructed single-unit unit combination convex hull model and the mixed integer programming model are tested.
[0080] refer to Figure 2-3 , the 54 single units were established as mixed integer programming models and convex hull models respectively, and the optimal operating cost was calculated in combination with the electricity price curve. All test results showed that the unit combination results obtained by the convex hull model were consistent with those obtained by the mixed integer programming model.
[0081] refer to Figure 4 , the 54 single units were established as mixed integer programming models and convex hull models respectively, and the optimal operating cost was calculated in combination with the electricity price curve. All test results showed that the computing time required for solving the convex hull model was significantly reduced compared with the computing time required for the mixed integer programming model.
[0082] The unit combination problem is represented as a mixed integer linear programming problem. The "curse of dimensionality" problem it faces makes it very difficult to solve the problem. Even though the discrete optimization technology is very mature, it has not changed the nature of the NP-hard problem. It is still challenging to efficiently obtain the optimal solution to the mixed integer programming problem. The advantage of constructing the convex hull of the unit combination problem is that the mixed integer programming problem originally describing the unit combination problem is equivalently converted into a linear programming problem, which changes the nature of the optimization problem. The existing solution technology is very friendly to linear programming problems, and there are very mature algorithms with polynomial time complexity, which makes it easy to obtain the optimal solution to the unit combination problem.
[0083] Example 3
[0084] Reference Figure 5 , as an embodiment of the present invention, provides a convex hull construction system for a single unit unit commitment problem, including a state construction module, a dynamic programming module, and a linear programming module.
[0085] The state construction module is used to abstract and construct a multi-state model to represent the start and stop state of a single unit in the power system, and to construct the state space of the unit based on the unit state representation; the dynamic programming module is used to construct state transfer rules based on the minimum start and stop time constraints of the unit, and to establish a dynamic programming model to calculate the optimal operating cost; the linear programming module is used to transform the single unit combination problem from a mixed integer programming model to a linear programming model, and to construct a linear programming model based on the dynamic programming model to determine the optimal start and stop strategy for the power generator.
[0086] If the function 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 technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.
[0087] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in conjunction with such instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in conjunction with such instruction execution systems, devices or apparatuses.
[0088] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering, or processing in another suitable manner as necessary, and then stored in a computer memory.
[0089] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc. It should be noted that the above embodiments are only used to illustrate the technical solution of the present invention and are not limited. Although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical solution of the present invention can be modified or replaced by equivalents without departing from the spirit and scope of the technical solution of the present invention, which should be included in the scope of the claims of the present invention.
[0090] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.
Claims
1. A convex hull construction method for a single unit unit combination problem, characterized in that: include: For the start and stop operation of a single unit in the power system, a multi-state model is abstracted and constructed to represent the start and stop state of the unit, and the state space of the unit is constructed based on the unit state representation; Based on the minimum start and stop time constraints of the unit, the state transfer rules are constructed, and a dynamic programming model is established to calculate the optimal operating cost; The single-unit unit commitment problem is transformed from a mixed integer programming model to a linear programming model, and a linear programming model is constructed based on the dynamic programming model to determine the optimal power generator start-stop strategy.
2. The convex hull construction method for the single unit unit combination problem according to claim 1, characterized in that: The start-stop state characterizing the unit includes the state related to the start-stop of the unit in the power system, which is represented by the start-stop state of the unit, the start command, the stop command and the current start-stop state duration. The unit combination state of the single unit represented by the start-stop state and the start-stop state duration is abstracted into a multi-state model, which is represented as: (x,u,d,l) Among them, x represents the start and stop status of the unit, u represents the start command, d represents the stop command, and l represents the duration of the current start and stop status.
3. The convex hull construction method for the single unit unit combination problem according to claim 2, characterized in that: The constructing the state space of the unit includes constructing the state space of the unit based on the unit state representation; When the unit remains on, x = 1, the state space of the unit passes through the set Ω on express; If the minimum startup time T on =1, the unit startup state space set Ω on It is expressed as: Ω on =={(x,u,d,l)∈1×{0,1}×0×1} If the minimum startup time T on >1, the unit startup state space set Ω on It is expressed as: When the unit remains shut down, x = 0, the state space of the unit passes through the set Ω off express; If the minimum shutdown time T off =1, the unit shutdown state space set Ω off It is expressed as: Ω off =={(x,u,d,l)∈0×0×{0,1}×1} If the minimum shutdown time T off >1, the unit shutdown state space set Ω off It is expressed as: The minimum startup time and minimum shutdown time are analyzed through the space characteristics of the startup and shutdown states of the unit.
4. The convex hull construction method for the single unit unit combination problem according to claim 3, characterized in that: The state transition rule construction includes constructing the state transition rule of the unit startup and shutdown state space based on the minimum startup and shutdown time constraint of the unit; When the unit remains on and the minimum on time T on =1, the state transition rule is adapted to the transition from the unit state (1,1,0,1) to the state (1,0,0,1), or from the state (1,1,0,1) to the state (0,0,1,1); When the unit remains on and the minimum on time T on >1, the state transition rule is applicable to the transition from the unit state (1,1,0,1) to the state (1,0,0,2), or from the state (1,0,0,l) and 1 <l<T on , transfer to state (1,0,0,l+1), or from state (1,0,0,T on )Transfer to state (0,0,1,1); When the unit remains shut down and the minimum shutdown time T off =1, the state transition rule is adapted to the transition from the unit state (0,0,1,1) to the state (0,0,0,1), or from the state (0,0,1,1) to the state (1,0,1,1); When the unit remains stopped and the minimum start time T off >1, the state transition rule is applicable to the transition from the unit state (0,0,1,1) to the state (0,0,0,2), or from the state (0,0,0,l) and 1 <l<T off , transfer to state (0,0,0,l+1), or from state (1,0,0,T off ) transfers to state (1,1,0,1).
5. The convex hull construction method for the single unit unit combination problem according to claim 4, characterized in that: The establishment of the dynamic programming model includes establishing the unit commitment problem as a dynamic programming model based on the state space and state transition rules of the unit, which is expressed as: Z DP =min i∈Ω {v} DP (i,1)} v DP (i,T)=V(i,T),i∈Ω Among them, Z DP represents the optimal operating cost of the corresponding dynamic programming model, Ω represents the state space, Ω=Ω on +Ω off , v DP (i, t) represents the optimal operating cost from time period t to the last time period in the dynamic programming model while maintaining state i during time period t, j represents the state transferred from state i, V(j, t) represents the operating cost of maintaining state j during time period t, v DP (i, T) is the boundary condition of the last period T in the dynamic programming model, and V(i, T) represents the operating cost of the unit maintaining state i in the last period T.
6. The convex hull construction method for the single unit unit combination problem according to claim 5, characterized in that: The construction of the linear programming model includes converting the single unit unit combination problem from a mixed integer programming model to a linear programming model, and constructing the linear programming model based on the dynamic programming model, which is expressed as: maxZ LP s.t.Z LP ≤v LP (i,1),i∈Ω v LP (i,t)≤v LP (j,t+1)+V(j,t),i∈Ω,j∈Ω from (i),t∈{1,...,T-1} v LP (i,T)≤V(i,T),i∈Ω Among them, Z LP represents the optimal operating cost of the corresponding linear programming model, v LP (i, t) represents the optimal operating cost from period t to the last period in the linear programming model while maintaining state i during period t, v LP (i,T) represents the boundary condition of the last period T in the linear programming model, and the cost of the terminal state does not exceed V(i,T).
7. The convex hull construction method for the single unit unit combination problem according to claim 6, characterized in that: The power generator start-stop strategy includes determining the best power generator start-stop strategy based on the cost and demand of unit state transfer by calculating the optimal operating cost of a linear programming model.
8. A system using the convex hull construction method for the single unit unit combination problem as claimed in any one of claims 1 to 7, characterized in that: Including state construction module, dynamic programming module, linear programming module; The state construction module is used to abstract and construct a multi-state model to represent the start and stop state of a single unit in a power system, and to construct a state space of the unit based on the unit state representation; The dynamic programming module is used to construct state transfer rules based on the minimum start and stop time constraints of the unit, and establish a dynamic programming model to calculate the optimal operating cost; The linear programming module is used to transform the single unit unit combination problem from a mixed integer programming model to a linear programming model, construct a linear programming model based on a dynamic programming model, and determine the optimal power generator start-stop strategy.
9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the convex hull construction method for the single-unit unit combination problem described in any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the convex hull construction method for the single unit unit commitment problem according to any one of claims 1 to 7 are implemented.
