Optimal reserve requirements and units schedule in contingency Constrained Unit Commitment

This paper proposes a two-stage robust optimization approach to solve the N- k contingency-constrained unit commitment (CCUC) problem. In our approach, both generator and transmission line contingencies are considered. Compared to the traditional approach using a given set of components as candidates for possible failures, our approach considers all possible component failure scenarios. We consider the objectives of minimizing the total generation cost under the worst-case contingency scenario and/or the total pre-contingency cost. We formulate CCUC as a two-stage robust optimization problem and develop a decomposition framework to enable tractable computation. In our framework, the master problem makes unit commitment decisions and the subproblem discovers the worst-case contingency scenarios. By using linearization techniques and duality theory, we transform the subproblem into a mixed-integer linear program (MILP). The most violated inequalities generated from the subproblem are fed back into the master problem during each iteration. Our approach guarantees a globally optimal solution in a finite number of iterations. In reported computational experiments, we test both primal and dual decomposition approaches. Our computational results verify the effectiveness of our proposed approach.

Optimal scheduling of distributed battery storage for enhancing the security and the economics of electric power systems with emission constraints

The ISO implements Security Constraint Unit Commitment (SCUC) for clearing of day-ahead market. In this paper, SCUC is also used for simultaneous clearing of energy and reserve market. Spinning reserve and of generating units and Demand Response Programs (DRPs) are considered as system operating reserves in the proposed model. A Mixed Integer Programming model is proposed for power system modeling along with DRPs. The proposed model is applied to the IEEE RTS to demonstrate its effectiveness. The results show that the use of DRPs' reserve, reduce the system operation costs and have high impact in reliability improvement and reduction in market clearing price in critical or peak hours.

This paper studies how to sample load more realistically and efficiently for security constraint unit commitment (SCUC) problems in order to achieve a high degree of robustness of the unit commitment (UC) solution. For example, given the UC solution, 95% of load profiles can be supplied. Principal component analysis (PCA) is introduced to find a clear feature of the historical load in two-dimensional space rather than the original high-dimensional load space, whose feature is hard to capture. Kernel density estimation (KDE) with Gaussian kernel is applied to form the probability density function (PDF), from which hourly load profiles are sampled. The load profiles based on sparse sampling are used to find the UC solution with high robustness while the load profiles based on dense sampling are used to verify the robustness of the obtained UC solution.

Unified solution of a non-convex SCUC problem using combination of modified Branch-and-Bound method with Quadratic Programming

In this paper, Security Constrained Unit Commitment (SCUC) problem with combined Thermal- Solar generating units is solved using Artificial Bee Colony (ABC) algorithm. SCUC problem aims to obtain minimum generation cost while satisfying the system, network and security constraints. The SCUC problem is divided into Unit Commitment Problem (UCP) which is considered as the master problem and Security Constrained Economic Dispatch (SCED) is considered as the sub problem. Here, both thermal and solar generations are considered in UCP and SCED solutions. Binary Coded ABC Algorithm is used to solve the UCP and Real Coded ABC Algorithm is used for solving the SCED problem. The constraints such as spinning reserves, hourly load demands, ramp up/ramp down limits of generators, minimum up/down limits, line flow and voltage limits are considered in the problem formulation. Beta distribution function is employed to forecast the solar power generation in different seasons. The comparison is carried out with and without incorporating solar generation. The proposed method is validated on a 6 bus system and a South Indian 86 bus utility.

This paper presents a new approach for the contingency-constrained single-bus unit commitment problem. The proposed model explicitly incorporates an n - K security criterion by which power balance is guaranteed under any contingency state comprising the simultaneous loss of up to K generation units. Instead of considering all possible contingency states, which would render the problem intractable, a novel method based on robust optimization is proposed. Using the notion of umbrella contingency, the robust counterpart of the original problem is formulated. The resulting model is a particular instance of bilevel programming which is solved by its transformation to an equivalent single-level mixed-integer programming problem. Unlike previously reported contingency-dependent approaches, the robust model does not depend on the size of the set of credible contingencies, thus providing a computationally efficient framework. Simulation results back up these conclusions.

Unit Commitment (UC) is an essential decision taken by ISO to ensure reliable and economic operation of the power system. Renewable energy penetration is increasing in a power system due its inexhaustive and environment friendly nature. Renewable energy poses some challenges to the present power systems due to its high uncertainty. In addition to this, the impact of contingencies on the power system also cannot be ignored. Both renewable energy and contingencies make the power system more prone to uncertain behaviour which can affect the economics as well as reliability of the power system. In this paper, UC is solved using deterministic and stochastic approaches. Deterministic UC considers forecasted wind data and Stochastic UC considers uncertain scenarios of the wind. Practically the power system is more prone to uncertainty because of renewable energy penetration and contingencies. Thus, this paper discusses how a UC decision varies as more uncertainties arises. Mixed Integer Linear Programming (MILP) is used for obtaining the UC decision results for IEEE 30-bus system. The results of UC, power dispatch and generation costs obtained with the two approaches have been compared.

This paper proposes a resilient and secure configuration for coastal distribution grids by integrating the security constraint unit commitment (SCUC) and mobile marine microgrids (MMMGs). In the proposed configuration, MMMGs can be connected to the coastal distribution grids in both normal and post-disaster operations. It is assumed that both MMMGs and SCUC networks include both dispatchable (e.g., gas turbines and diesel generators) and nondispatchable generators (e.g., photovoltaics and wind turbines). The proposed problem consists of realistic formulations that seek to minimize the total MMMGs and SCUC operation costs, while maximizing distribution grid resiliency. A heuristic technique, known as the collective decision optimization algorithm, is employed to address the complexity and nonlinearity of the formulated problem. Moreover, the unscented transform technique is adopted to model the uncertainties associated with renewable energy sources output and load demand. To show the effectiveness and merits of the proposed configuration, the IEEE 69-bus distribution network is selected and tested for both normal and post-disaster operations.

We present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually nondominated solutions. We study the impact of aggregation on two large-scale UC instances: one from the academic literature and the other based on real-world operator data. Our computational tests demonstrate that, when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Furthermore, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

Robust optimisation has been applied to the dispatching problem considering fault outage of power systems. The traditional fault outage uncertainty set are too conservative. To solve this problem, a robust contingency constrained unit commitment (CCUC) model considering the outage probability of units and transmission lines is proposed. The proposed model has the following characteristics: (i) the outage probability of units is determined by normal operation time and fault repair time, whereas the outage probability of transmission lines is determined by length and load rate; (ii) based on the probability criterion of unit outage contingencies, the outage probabilities of units and transmission lines are both incorporated into the modelling of uncertainty sets; (iii) the robust CCUC model obtains UC decision of base case and the UC decision under uncertainty scenarios can adjust the output of units by spinning reserve capacity to cope with stochastic fault outage scenarios. The proposed robust CCUC model is solved with Benders‐column and constraint generation (C&CG) method combined with Benders decomposition method and C&CG method. Simulations on the modified IEEE‐RTS‐79 system and IEEE‐RTS‐96 system demonstrate the effectiveness and reliability of the proposed robust CCUC model.

The short-term unit commitment (UC) problem in hydrothermal power generation is a large-scale, mixed-integer nonlinear program, which is difficult to solve efficiently, especially for large-scale instances. It is possible to approximate the nonlinear objective function of the problem by means of piecewise-linear functions, so that UC can be approximated by an mixed-integer linear program (MILP); applying the available efficient general-purpose MILP solvers to the resulting formulations, good quality solutions can be obtained in a relatively short amount of time. We build on this approach, presenting a novel way to approximating the nonlinear objective function based on a recently developed class of valid inequalities for the problem, called ldquoperspective cuts.rdquo At least for many realistic instances of a general basic formulation of UC, an MILP-based heuristic obtains comparable or slightly better solutions in less time when employing the new approach rather than the standard piecewise linearizations, while being not more difficult to implement and use. Furthermore, ldquodynamicrdquo formulations, whereby the approximation is iteratively improved, provide even better results if the approximation is appropriately controlled.

There is increasing evidence of shortage of ramping resources in the real-time operation of power systems. To explain and remedy this problem systematically, in this paper we take a novel look at the way the day-ahead unit commitment (UC) problem represents the information about load, generation and ramping constraints. We specifically investigate the approximation error made in mapping of the original problem, that would decide the continuous-time generation and ramping trajectories of the committed generating units, onto the discrete-time problem that is solved in practice. We first show that current practice amounts to approximating the trajectories with linear splines. We then offer a different representation through cubic splines that provides physically feasible schedules and increases the accuracy of the continuous-time generation and ramping trajectories by capturing sub-hourly variations and ramping of load in the day-ahead power system operation. The corresponding day-ahead UC model is formulated as an instance of mixed-integer linear programming (MILP), with the same number of binary variables as the traditional UC formulation. Numerical simulation over real load data from the California ISO demonstrate that the proposed UC model reduces the total day-ahead and real-time operation cost, and the number of events of ramping scarcity in the real-time operations.

Flexibility enhancement of multi-district DISCOs considering a trade-off between congestion and extractable reserve capacity from virtual energy storage systems

A novel projected two-binary-variable formulation for unit commitment in power systems