Yishen Wang

Near-Optimal Method for Siting and Sizing of Distributed Storage in a Transmission Network

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.

Toward Cost-Efficient and Reliable Unit Commitment Under Uncertainty

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.

Comparison of scenario reduction techniques for the stochastic unit commitment

A number of scenario reduction techniques have been proposed to make possible the practical implementation of stochastic unit commitment formulations. These scenario-reduction techniques aggregate similar scenarios based on their metrics, such as their probability, hourly magnitudes, or the cost resulting from each scenario. This paper compares these different scenario reduction techniques in terms of the resulting operating cost and the amount of time required to complete computation of the stochastic UC. This comparison is based on Monte Carlo simulations of the resulting generation schedules for a modified version of the 24-bus IEEE-RTS.

Stochastic Multistage Coplanning of Transmission Expansion and Energy Storage

Transmission expansion and energy storage increase the flexibility of power systems and, hence, their ability to deal with uncertainty. Transmission lines have a longer lifetime and a more predictable performance than energy storage, but they require a very large initial investment. While battery energy storage systems (BESS) can be built faster and their capacity can be increased gradually, their useful life is shorter because their energy capacity degrades with time and each charge and discharge cycle. Additional factors, such as the expected profiles of load and renewable generation significantly affect planning decisions. This paper proposes a stochastic, multistage, coplanning model of transmission expansion, and BESS that considers both the delays in transmission expansion and the degradation in storage capacity under different renewable generation and load increase scenarios. The proposed model is tested using a modified version of the IEEE-RTS. Sensitivity analyses are performed to assess how factors such as the planning method, the storage chemistry characteristics, the current transmission capacity, and the uncertainty on future renewable generation and load profiles affect the investment decisions.

Robust, adaptive or nonlinear control for modern power systems

Major objectives in power system control design include regulation of voltages and frequency, adequate damping of oscillations and preservation of synchronism in the face of large disturbances. These objectives must be met in the face of changing operating conditions some of which may not be anticipated a priori. Further, modern operating schemes will enhance the level of uncertainty. It is unlikely that traditional off-line tuning of simple decentralised controllers will be adequate. This paper looks at what some modern control tools have to offer in the power systems context. In particular, we review robust, adaptive and nonlinear control and their possible combinations. Their applicability to various classes of power system control problem is considered. In particular, the type of modelling uncertainty (structured or unstructured) and type of disturbance (small or large) is important. In system theoretic terms there seems to be many opportunities for further use of centralised (and decentralized) nonlinear control.<<ETX>>

Optimal Energy Storage Siting and Sizing: A WECC Case Study

The large-scale integration of grid-scale energy storage and the increasing penetration of renewable resources motivate the development of techniques for determining the optimal ratings and locations of storage devices. This paper proposes a method for identifying the sites where energy storage systems should be located to perform spatio-temporal energy arbitrage most effectively and the optimal size of these systems. This method takes a centralized perspective where the objective is to minimize the sum of the expected operating cost and the investment cost of energy storage. It has been tested on a realistic 240-bus 448-line model of the Western Electricity Coordinating Council (WECC) interconnection. The influence on the results of the following parameters is analyzed: Maximum number of storage locations, maximum size of storage systems, capital cost of deploying storage, value assigned to spillage of renewable energy, marginal cost of conventional generation, and renewable generation capacity. These numerical results are used to characterize the benefits that energy storage can provide in prospective large-scale power systems with renewable generation.

Effect of time resolution on unit commitment decisions in systems with high wind penetration

The increasing share of wind power in power systems requires changes in the operating procedures. Day-ahead scheduling no longer has to fit only with slow and easily predictable changes in load, but also with more abrupt changes in wind power. Procedures for dealing with wind uncertainty, such as stochastic, robust, and interval unit commitment algorithms, typically assume a one-hour resolution. Since wind generation can change significantly within an hour, shorter optimization intervals might be required to adequately reflect this uncertainty. This paper compares the stochastic, interval and robust unit commitment formulations with resolutions of 1 hour and 15 minutes. The schedules produced by these various algorithms are compared using a Monte Carlo simulation procedure on a modified version of the 24-bus IEEE-RTS.

Look-Ahead Bidding Strategy for Energy Storage

As the cost of battery energy storage continues to decline, we are likely to see the emergence of merchant energy storage operators. These entities will seek to maximize their operating profits through strategic bidding in the day-ahead electricity market. One important parameter in any storage bidding strategy is the state-of-charge at the end of the trading day. Because this final state-of-charge is the initial state-of-charge for the next trading day, it has a strong impact on the profitability of storage for this next day. This paper proposes a look-ahead technique to optimize a merchant energy storage operators bidding strategy considering both the day-ahead and the following day. Taking into account the discounted profit opportunities that could be achieved during the following day allows us to optimize the state-of-charge at the end of the first day. We formulate this problem as a bilevel optimization. The lower-level problem clears a ramp-constrained multiperiod market and passes the results to the upper-level problem that optimizes the storage bids. Linearization techniques and Karush–Kuhn–Tucker conditions are used to transform the original problem into an equivalent single-level mixed-integer linear program. Numerical results obtained with the IEEE Reliability Test System demonstrate the benefits of the proposed look-ahead bidding strategy and the importance of considering ramping and network constraints.

Scenario Reduction With Submodular Optimization

Stochastic programming methods have been proven to deal effectively with the uncertainty and variability of renewable generation resources. However, the quality of the solution that they provide (as measured by cost and reliability metrics) depends on the accuracy and the number of scenarios used to model this uncertainty and variability. Scenario reduction techniques are used to manage the computational burden by selecting representative scenarios. The common drawback of existing scenario reduction techniques is that the number of representative scenarios is a user-defined parameter. We propose a scenario reduction algorithm based on submodular function optimization to endogenously optimize the number of scenarios as well as rank these scenarios. This algorithm is compared, both qualitatively and quantitatively, with the state-of-the-art fast forward selection algorithm.

Scalable Planning for Energy Storage in Energy and Reserve Markets

Energy storage can facilitate the integration of renewable energy resources by providing arbitrage and ancillary services. Jointly optimizing energy and ancillary services in a centralized electricity market reduces the systems operating cost and enhances the profitability of energy storage systems. However, achieving these objectives requires that storage be located and sized properly. We use a bilevel formulation to optimize the location and size of energy storage systems, which perform energy arbitrage and provide regulation services. Our model also ensures the profitability of investments in energy storage by enforcing a rate of return constraint. Computational tractability is achieved through the implementation of a primal decomposition and a subgradient-based cutting-plane method. We test the proposed approach on a 240-bus model of the Western Electricity Coordinating Council system and analyze the effects of different storage technologies, rate of return requirements, and regulation market policies on energy storage participation on the optimal storage investment decisions. We also demonstrate that the proposed approach outperforms exact methods in terms of solution quality and computational performance.