6 February 2023 in IEEE Transactions on Automation Science and Engineering
Security-constrained unit commitment (SCUC) is one of the most fundamental optimization problems in power systems. The objective of SCUC is to minimize the operating cost while respecting both system-wide and generator-specific constraints. It leads to a large-scale and mixed-integer programming (MIP) model with a large number of binary decision variables which is difficult to solve. This paper, based on the convex hull theory of single-unit, proposes a linearization method for the hydro-thermal SCUC problem with decoupled thermal units and variable-head hydro units. Then, the strategy of embedding two types of convex hulls in a multi-unit commitment and the heuristic method of constructing a feasible solution are designed, by which the multi-UC is approximated from large-scale mixed-integer programming to linear programming that can be solved in polynomial time. Finally, we theoretically prove that the optimal solution of the proposed LP model is always better than that of the Lagrangian Relaxation model. Numerical experiments on several large-scale test systems demonstrate the effectiveness and efficiency of the proposed method. Note to Practitioners —This paper proposes a linear programming model for the SCUC problem by lifting up to a higher-dimensional space. It realizes an important innovation in reducing the computational complexity of SCUC from the perspective of linearization. The proposed method can be well applied to large-scale long-term unit commitment problems. To better use this method, the following two properties should be highlighted: 1) the error of the proposed method is less than the Lagrangian relaxation method and decreases with the increasing system scales and 2) the computational efficiency of the proposed method is 10-100 times faster than that of the MIP model. We have tested many practical power systems and find that the error of the proposed LP model is usually very small compared with the precise MIP while the computational performance is significantly improved. In some practical cases, the decision makers usually do not want to find the precise optimal solution while only an approximation under a fast speed, because the boundary condition is imprecise. The proposed method is useful. Besides, for the cases that need the precise optimal solution, the proposed method can provide a high-quality initial solution for the MIP model to accelerate the convergence.
19 October 2022 in IEEE Transactions on Power Systems
The single-unit commitment (1UC) aims at maximizing the payoff within a time series of given electricity prices. 1UC is subject to generation constraints, which is formulated as a mixed-integer programming (MIP) optimization problem. To reduce the computational complexity of PSU-1UC, this paper constructs the convex hull of PSU-1UC. Focusing on the possible combinations of generating and pumping time intervals, we first establish a dynamic program (DP) model which is solved in polynomial time. Second, a set of public variables were defined to describe the coupling relationship between different consecutive time intervals. Then, we reformulate the DP model into a linear programming (LP) model in a higher-dimensional space, which provides the convex hull formulation of PSU-1UC. Finally, we theoretically prove that the optimal solutions of the proposed convex hull model and the original MIP are the same. The exponential time complexity of PSU-1UC is reduced to polynomial time complexity, which will speed up the PSU self-scheduling/bidding problems and the decomposed algorithm for large-scale hydrothermal UC problems. Numerical experiments demonstrate the effectiveness and efficiency of the proposed model for PSU-1UC.
25 January 2022 in IEEE Transactions on Power Systems
Total transfer capability evaluation is an effective method to analyze the backbone transmission capability among regions. To address renewable energy uncertainties, an interval total transfer capability model based on the multi-dimensional holomorphic embedding method and sum of squares relaxation technique is proposed to solve the regional total transfer capability in meshed high voltage direct current systems. First, the multi-dimensional holomorphic embedding method is used to derive the analytical expressions of regional tie lines. Second, the interval total transfer capability model can be reformulated by two bi-level optimization models. Third, sum of squares relaxation is employed to solve the two optimization problems. Numerical results on a 40-bus European Synthetic System and the Chinese meshed high voltage direct current system validate the effectiveness of the proposed model and method.
1 December 2020 in IEEE Electrification Magazine
Today, the global energy crisis is becoming more serious, which is manifested by the shortage of fossil fuels and considerable environmental pollution. As a supplement to large-scale centralized power generation, distributed energy resources, such as wind and photovoltaic (PV) power, provide a new way to solve the energy crisis.
1 November 2019 in Applied Thermal Engineering
2 June 2023 in IEEE Transactions on Network Science and Engineering
Thermal power generation is the main source of carbon emissions. Adopting low-carbon dispatching and developing renewable energy sources (RESs) are effective ways to reduce carbon emissions. This article constructs a mixed-integer programming (MIP) model of low-carbon full-scenario unit commitment with nonanticipativity. To overcome the curse of dimensionality problem caused by the use of a massive number of scenarios, we employ the adjustable robust optimization approach (AROA) to reformulate the full-scenario unit commitment as a deterministic robust model. In addition, we establish the precise adjustable robust convex hull of generation constraints in a higher dimensional space and generate a relaxed linear programming (LP) formulation of the original MIP model. Then, we design a heuristic method for obtaining a near-optimal feasible solution by converting a large-scale MIP into an LP model that can be solved in polynomial time. The numerical experiments presented in this article demonstrate the effectiveness and efficiency of the proposed method.