Power System Operation OptimizationDecomposed and coordinated operation of multi-area system
The multi-area system decomposed and coordinated operation (DCO) is studied to make better utilization of large-scale inter-connected power systems to optimize resource utilization in a wider geography. In the DCO scheme, the global optimization is achieved by the information interaction between the coordinator and intra-regional system operators. In this area, a novel decomposition coordination approach based on dynamic multipliers is proposed. By utilizing a sensitivity analysis method, the Lagrangian multipliers of sub-problems are extended from constants to dynamic functions of coupled variables, which enables the sub-problems to predict the change of multipliers and, therefore, facilitates the convergence of decentralized optimization. The proposed approach can significantly improve the computational efficiency of decomposition and coordination. The proposed decomposition coordination algorithm is employed to solve the multi-area DC-OPF, which is the basic model of the day-ahead generation scheduling. The proposed decomposition coordination algorithm is also capable of solving the multi-area AC-OPF to realize the intra-day generation scheduling.
References
Inducting objective function algorithm for large-scale MILP
An efficient method to solve the long-term security constrained unit commitment (SCUC) is a requisite for power system operators in many countries, particularly those with many coal-fired generating units, which require a long time to start up and shut down. However, the complexity that is introduced by the energy or fuel constraints in the long-term SCUC problem often results in exorbitant computation time. Motivated by this, a new type of approach, which is termed the inducing-objective-function (IOF)-based method, is proposed. This method significantly improves the computational efficiency. In the proposed method, the inducing factors are introduced into the objective function of the SCUC relaxation problem to induce more UC state variables to satisfy the integrality requirement after several iterations. According to the relaxation solution, the objective function of the original SCUC model is modified. Thus, the process of solving the modified model using the branch-and-cut algorithm can be more efficient. Because the solution of this modified model can be near-optimal for the original model, the gap between the near-optimal and the optimal solution is estimated to decide whether the near-optimal solution is acceptable for practical application. If the near-optimal solution is not acceptable, it will be used as the initial solution to solve the original model. Because the initial solution is of high quality, it can significantly speed up the branch-and-cut process.
References
Network aggregation theory and method for inter-regional and multi-level system coordination
Conventional network reduction and aggregation methodologies, e.g., the Norton equivalence, only concern the boundary equivalence of the network equations. The internal system operating constraints, however, are ignored. To facilitate the inter-regional power trading and the coordination between the transmission system and the distribution systems, it is beneficial for the coordinator and the upper-level system operator to know the aggregated operating feasible region of the subsystems. This motivates us to extend the conventional network reduction methodologies to incorporate the internal system operating constraints when studying the external equivalent characteristics of a system. The innovated methodology is based on the projection theory. We partition the variables into two types, namely the internal state variables and the boundary coordination variables. By project the feasible region with regard to the internal state variables onto the subspace of the coordination variables, the external equivalence incorporating both the network equation and the operating constraints can be evaluated. We also propose a novel polyhedron projection algorithm which calculate the projection by enumerating vertices of the projected polytope in a breath-first manner. The computation efficiency of the proposed algorithm outperforms the classical Fourier elimination algorithm by 5 8 times. The proposed algorithm can also tackle large-scale network problems. The proposed network aggregation theory and algorithm is studied to realize the non-iterative inter-regional market clearing and the TSO-DSO coordination.
References
|