Search

Given its physical characteristics and the range of services that it can provide, energy storage raises unique modeling challenges. This paper summarizes capabilities that operational, planning, and resource-adequacy models that include energy storage should have and surveys gaps in extant models. Existing models that represent energy storage differ in fidelity of representing the balance of the power system and energy-storage applications. Modeling results are sensitive to these differences. The importance of capturing chronology can raise challenges in energy-storage modeling. Some models ‘decouple’ individual operating periods from one another, allowing for natural decomposition and rendering the models relatively computationally tractable. Energy storage complicates such a modeling approach. Improving the representation of the balance of the system can have major effects in capturing energy-storage costs and benefits. [ABSTRACT FROM AUTHOR]

Modern mixed-integer quadratic solvers generally handle binary variables more efficiently than nonlinear mixed-integer solvers. This is relevant to the power system operation models as the unit commitment formulations typically contain a large number of binary variables. This paper investigates how to achieve the accuracy level close to the one of the exact nonlinear models, but by utilising convex models and solvers. The presented unit commitment model is based on a Taylor-series expansion where both the voltage magnitude and angle are quadratically constrained. To achieve high accuracy, the model takes advantage of the meshed transmission network structure that enables replacement of the quadratic inequality constraints that cause constraint relaxation errors with the linear equality constraints. Quadratic constraints to be replaced as well as the operating point parameters are determined based on the presolve. The first presented case study validates the model's accuracy and the convergence of the iterative algorithm, while the second is a non-iterative full unit commitment problem. Unit commitment results show superior accuracy and similar computation times to the existing quadratic formulations on one hand and faster computation times than the exact nonlinear polar formulation on the other. [ABSTRACT FROM AUTHOR]

Battery swapping stations (BSSs) have a potential of becoming a part of the electric vehicle charging infrastructure mix. A number of aggregated BSSs have a significant capacity and can act as strategic players in electricity market. This paper formulates a discrete cluster model for optimal operation of aggregated BSSs that take part in the day-ahead energy and reserve capacity markets and have sufficient combined capacity to affect market prices. In the presented bilevel structure the upper-level problem optimally defines charging and discharging schedules, as well as reserve capacity, of the aggregated BSSs, while the lower-level problem clears the market and provides locational marginal prices for each BSS, as well as the reserve capacity prices. This problem is converted into a single-level equivalent using the Karush-Kuhn-Tucker optimality conditions. The presented case study reveals that BSSs can collect significant revenues when providing reserve capacity. The main benefit of the proposed cluster model is computational tractability and solution accuracy, which depends on the resolution of the clusters. [ABSTRACT FROM AUTHOR]

Battery energy storage is becoming an important part of modern power systems. As such, its operation model needs to be integrated in the state-of-the-art market clearing, system operation, and investment models. However, models that commonly represent operation of a large-scale battery energy storage are inaccurate. A major issue is that they ignore the dependence of the charging power on the battery state of energy. Consequently, market players might suffer great monetary losses for not being able to follow their day-ahead schedule and/or deliver the scheduled reserves. In order to bridge the gap between very detailed low-level battery charging constraints and high-level battery operation models used in the literature, this paper examines a dependence of battery charging ability on its state of energy. It proposes a laboratory procedure, which can be used for any battery type and technology, to obtain this dependence. It also formulates an accurate linear battery charging model, which closely approximates the real-life battery charging constraints. The proposed battery charging model is compared against the models commonly used in the literature. Battery operation schedules obtained by all the models are compared against experimentally obtained results in order to assess the value of the proposed model in real life. [ABSTRACT FROM AUTHOR]

Preventive security-constrained optimal power flow (PSCOPF) dispatches controllable generators at minimum cost while ensuring that the system adheres to all operating constraints. All the transmission and generation limits are respected during both the pre- and post-contingency states without relying on post-contingency redispatch. Therefore, all credible generation contingencies should be modeled in PSCOPF and the system-wide automatic primary response should be allocated accordingly among synchronized generators by adjusting their droop coefficients. This paper proposes a new PSCOPF model that optimizes the droop coefficients of the synchronized generators. The cost savings attained with the proposed approach and its computational performance are evaluated. Different wind penetration levels and reserve policies are tested using annual simulations on the one- and three-area IEEE Reliability Test System. [ABSTRACT FROM PUBLISHER]

Renewable electricity generation not only provides affordable and emission-free electricity but also introduces additional complexity in the day-ahead planning procedure. To address the stochastic nature of renewable generation, system operators must schedule enough controllable generation to have the flexibility required to compensate unavoidable real-time mismatches between the production and consumption of electricity. This flexibility must be scheduled ahead of real-time and comes at a cost, which should be minimized without compromising the operational reliability of the system. Energy storage facilities, such as pumped hydro energy storage (PHES), can respond quickly to mismatches between demand and generation. Hydraulic constraints on the operation of PHES must be taken into account in the day-ahead scheduling problem, which is typically not done in deterministic models. Stochastic optimization enhances the procurement of flexibility, but requires more computational resources than conventional deterministic optimization. This paper proposes a deterministic and an interval unit commitment formulation for the co-optimization of controllable generation and PHES, including a representation of the hydraulic constraints of the PHES. The proposed unit commitment (UC) models are tested against a stochastic UC formulation on a model of the Belgian power system to compare the resulting operational cost, reliability, and computational requirements. The cost-effective regulating capabilities offered by the PHES yield significant operational cost reductions in both models, while the increase in calculation times is limited. [ABSTRACT FROM PUBLISHER]

Large-scale integration of wind farms causes volatile bus net injections. Although these fluctuations are anticipated, their timing, magnitude and duration cannot be predicted accurately. In order to maintain the operational reliability of the system, this uncertainty must be adequately addressed at the day-ahead generation scheduling stage. The ad-hoc reserve rules incorporated in deterministic unit commitment formulations do not adequately account for this uncertainty. Scenario-based stochastic unit commitment formulations model this uncertainty more precisely, but require computationally demanding simulations. Interval and robust optimization techniques require less computing resources, but produce overly conservative and thus expensive generation schedules. This paper proposes a transmission-constrained unit commitment formulation that improves the performance of the interval unit commitment. The uncertainty is modeled using upper and lower bounds, as in the interval formulation, but inter-hour ramp requirements are based on net load scenarios. This improved interval formulation has been tested using the IEEE RTS-96 and compared with existing stochastic, interval and robust unit commitment techniques in terms of solution robustness and cost. These results show that the proposed method outperforms the existing interval technique both in terms of cost and computing time. [ABSTRACT FROM PUBLISHER]