Search

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]

We introduce emerging utility-scale energy storage (e.g., batteries) as part of the set of control measures in a corrective form of the security-constrained unit commitment (SCUC) problem. This enhanced SCUC (ESCUC) leverages utility-scale energy storage for multiple applications. In the base case, the storage units are optimally charged and discharged to realize economic operation. Immediately following a contingency, the injections of storage units are adjusted almost instantly to alleviate short-term emergency overloads, thereby avoiding potential cascading outages and giving slow ramping generating units time to adjust their output. The ESCUC is a large two-stage mixed-integer programming problem. A Benders decomposition has been developed to solve this problem. In order to achieve computational tractability, we present several acceleration techniques to improve the convergence of the proposed algorithm. Case studies on the RTS-79 and RTS-96 systems demonstrate the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Energy storage can alleviate the problems that the uncertainty and variability associated with renewable energy sources such as wind and solar create in power systems. Besides applications such as frequency control, temporal arbitrage or the provision of reserve, where the location of storage is not particularly relevant, distributed storage could also be used to alleviate congestion in the transmission network. In such cases, the siting and sizing of this distributed storage is of crucial importance to its cost-effectiveness. This paper describes a three-stage planning procedure to identify the optimal locations and parameters of distributed storage units. In the first stage, the optimal storage locations and parameters are determined for each day of the year individually. In the second stage, a number of storage units is available at the locations that were identified as being optimal in the first stage, and their optimal energy and power ratings are determined. Finally, in the third stage, with both the locations and ratings fixed, the optimal operation of the storage units is simulated to quantify the benefits that they would provide by reducing congestion. The quality of the final solution is assessed by comparing it with the solution obtained at the first stage without constraints on storage sites or size. The approach is numerically tested on the IEEE RTS 96. [ABSTRACT FROM AUTHOR]

This paper proposes a new transmission-constrained unit commitment method that combines the cost-efficient but computationally demanding stochastic optimization and the expensive but tractable interval optimization techniques to manage uncertainty on the expected net load. The proposed hybrid unit commitment approach applies the stochastic formulation to the initial operating hours of the optimization horizon, during which the wind forecasts are more accurate, and then switches to the interval formulation for the remaining hours. The switching time is optimized to balance the cost of unhedged uncertainty from the stochastic unit commitment against the cost of the security premium of the interval unit commitment formulation. These hybrid, stochastic, and interval formulations are compared using Monte Carlo simulations on a modified 24-bus IEEE Reliability Test System. The results demonstrate that the proposed unit commitment formulation results in the least expensive day-ahead schedule among all formulations and can be solved in the same amount of time as a full stochastic unit commitment. However, if the range of the switching time is reduced, the hybrid formulation in the parallel computing implementation outperforms the stochastic formulation in terms of computing time. [ABSTRACT FROM PUBLISHER]

This paper considers the yearly maintenance scheduling of generating units within a market environment. Each producer schedules its units' maintenance periods to maximize its revenue using a bilevel approach. The upper-level problem of this bilevel model seeks maximum revenue and contains unit scheduling constraints, while the lower-level problems represent the market clearing process under different operating conditions. This single producer maintenance problem can be recast as a mathematical program with equilibrium constraints (MPEC). Since the MPECs of all producers have to be considered simultaneously and the market clearing process is common to all of them, the proposed formulation for maintenance scheduling is an equilibrium problem with equilibrium constraints (EPEC) corresponding to a multiple-leader-common-follower game. The solution of this EPEC is a set of equilibria, in which none of the producers is able to increase its revenue unilaterally by changing the maintenance periods of its generating units. [ABSTRACT FROM PUBLISHER]