Recent studies show that the fast growing expansion of wind power generation may lead to extremely high levels of price volatility in wholesale electricity markets. Storage technologies, regardless of their specific forms, e.g., pump-storage hydro, large-scale, or distributed batteries, are capable of alleviating the extreme price volatility levels due to their energy usage time shifting, fast-ramping, and price arbitrage capabilities. In this paper, we propose a stochastic bilevel optimization model to find the optimal nodal storage capacities required to achieve a certain price volatility level in a highly volatile energy-only electricity market. The decision on storage capacities is made in the upper level problem and the operation of strategic regulated generation, storage, and transmission players is modeled in the lower level problem using an extended stochastic (Bayesian) Cournot-based game. The South Australia (SA) electricity market, which has recently experienced high levels of price volatility, and a 30-bus IEEE system are considered as the case studies. Our numerical results indicate that 50 price volatility reduction in the SA electricity market can be achieved by installing either 430-MWh regulated storage or 530-MWh strategic storage. In other words, regulated storage firms are more efficient in reducing the price volatility than strategic storage firms.
The problem of optimal storage operation or storage allocation for facilitating the integration of intermittent renewable energy generators in electricity networks has been studied in @cite_26 @cite_3 @cite_33 @cite_22 @cite_27 @cite_20 @cite_6 @cite_30 , with total cost minimization objective functions, and in @cite_12 @cite_24 @cite_10 @cite_18 @cite_1 , with profit maximization goals. However, the price volatility management problem using optimal storage allocation has not been investigated in the literature.
@cite_30 @cite_18 @cite_26 @cite_22 @cite_33 @cite_1 @cite_3 @cite_6 @cite_24 @cite_27 @cite_10 @cite_12 @cite_20
1987415322 2007853386 2015809171 1976265896 2075914509 1889296357 2762734442 1587228649 1973978183 2580454818 2340337630 2005147352 2045996972
This paper focuses on a scenario where a group of independently-operated investor-owned storage units seek to offer both energy and reserve in the day-ahead as well as the hour-ahead markets. We are particularly interested in the case when a significant portion of the power generated in the grid is from wind and other intermittent renewable energy sources. In this regard, we formulate a stochastic programming framework to choose optimal energy and reserve bids for the storage units. Our design takes into account the fluctuating nature of the market prices due to the randomness in the renewable power generation availability. We show that the formulated stochastic program can be converted into a convex optimization problem and therefore it can be solved efficiently. Our simulation results show that our design can assure profitability of the private investment on storage units. In particular, our design results in much higher profit compared to a similar but deterministic design that simply uses the expected values of the price parameters. In this paper, a new optimization framework is proposed to coordinate the operation of large, price-maker, and geographically dispersed energy storage battery systems in a nodal transmission-constrained energy market. The energy storage units are assumed to be investor-owned and independently-operated, seeking to maximize their total profit. Various design factors are taken into consideration such as the location, size, efficiency, and charge and discharge rates of the energy storage units as well as the joint impact of the energy storage operations on the locational marginal prices. While the formulated optimization problem is originally nonlinear and hard to solve, nonlinearities are tackled both in the objective function and in the constraints and the problem is transformed into a tractable mixed-integer linear program, for which the global optimal solutions are found for the charge and discharge schedules of each energy storage unit. Both deterministic and stochastic design scenarios are addressed. Various case studies are presented. It is observed that transmission line congestion is often, but not always, desirable for the coordinated storage systems. Locational diversity, practice of arbitrage, robust design, self-scheduling versus economic bidding, and the overall power system performance are also investigated. The high variability of renewable energy is a major obstacle toward its increased penetration. Energy storage can help reduce the power imbalance due to the mismatch between the available renewable power and the load. How much can storage reduce this power imbalance? How much storage is needed to achieve this reduction? This paper presents a simple analytic model that leads to some answers to these questions. Considering the multitimescale grid operation, we formulate the power imbalance problem for each timescale as an infinite horizon stochastic control problem and show that a greedy policy minimizes the average magnitude of the residual power imbalance. Observing from the wind power data that in shorter timescales the power imbalance can be modeled as an iid zero-mean Laplace distributed process, we obtain closed form expressions for the minimum cost and the stationary distribution of the stored power. We show that most of the reduction in the power imbalance can be achieved with relatively small storage capacity. In longer timescales, the correlation in the power imbalance cannot be ignored. As such, we relax the iid assumption to a weakly dependent stationary process and quantify the limit on the minimum cost for arbitrarily large storage capacity. In this paper, we study power allocation for secure communication in a multiuser multiple-input single-output (MIS-O) downlink system with simultaneous wireless information and power transfer. The receivers are able to harvest energy from the radio frequency when they are idle. We propose a multi-objective optimization problem for power allocation algorithm design which incorporates two conflicting system objectives: total transmit power minimization and energy harvesting efficiency maximization. The proposed problem formulation takes into account a quality of service (QoS) requirement for the system secrecy capacity. Our designs advocate the dual use of artificial noise in providing secure communication and facilitating efficient energy harvesting. The multi-objective optimization problem is non-convex and is solved by a semidefinite programming (SDP) relaxation approach which results in an approximate of solution. A sufficient condition for the global optimal solution is revealed and the accuracy of the approximation is examined. To strike a balance between computational complexity and system performance, we propose two suboptimal power allocation schemes. Numerical results not only demonstrate the excellent performance of the proposed suboptimal schemes compared to baseline schemes, but also unveil an interesting trade-off between energy harvesting efficiency and total transmit power. This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional waterfilling interpretations. Next, stochastic data arrivals are addressed. Finally, online and or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations. In this paper, we study resource allocation for multiuser multiple-input–single-output secondary communication systems with multiple system design objectives. We consider cognitive radio (CR) networks where the secondary receivers are able to harvest energy from the radio frequency when they are idle. The secondary system provides simultaneous wireless power and secure information transfer to the secondary receivers. We propose a multiobjective optimization framework for the design of a Pareto-optimal resource allocation algorithm based on the weighted Tchebycheff approach. In particular, the algorithm design incorporates three important system design objectives: total transmit power minimization, energy harvesting efficiency maximization, and interference-power-leakage-to-transmit-power ratio minimization. The proposed framework takes into account a quality-of-service (QoS) requirement regarding communication secrecy in the secondary system and the imperfection of the channel state information (CSI) of potential eavesdroppers (idle secondary receivers and primary receivers) at the secondary transmitter. The proposed framework includes total harvested power maximization and interference power leakage minimization as special cases. The adopted multiobjective optimization problem is nonconvex and is recast as a convex optimization problem via semidefinite programming (SDP) relaxation. It is shown that the global optimal solution of the original problem can be constructed by exploiting both the primal and the dual optimal solutions of the SDP-relaxed problem. Moreover, two suboptimal resource allocation schemes for the case when the solution of the dual problem is unavailable for constructing the optimal solution are proposed. Numerical results not only demonstrate the close-to-optimal performance of the proposed suboptimal schemes but unveil an interesting tradeoff among the considered conflicting system design objectives as well. Dynamic energy pricing policy introduces real-time power-consumption-reflective pricing in the smart grid in order to incentivise energy consumers to schedule electricity-consuming applications (tasks) more prudently to minimise electric bills. This has become a particularly interesting problem with the availability of photovoltaic (PV) power generation facilities and controllable energy storage systems. This study addresses the problem of concurrent task scheduling and storage management for residential energy consumers with PV and storage systems, in order to minimise the electric bill. A general type of dynamic pricing scenario is assumed where the energy price is both time-of-use and power dependent. Tasks are allowed to support suspend-now and resume-later operations. A negotiation-based iterative approach has been proposed. In each iteration, all tasks are ripped-up and rescheduled under a fixed storage charging discharging scheme, and then the storage control scheme is derived based on the latest task scheduling. The concept of congestion is introduced to gradually adjust the schedule of each task, whereas dynamic programming is used to find the optimal schedule. A near-optimal storage control algorithm is effectively implemented. Experimental results demonstrate that the proposed algorithm can achieve up to 60.95 in the total energy cost reduction compared with various baseline methods. There is growing interest in the use of grid-level storage to smooth variations in supply that are likely to arise with an increased use of wind and solar energy. Energy arbitrage, the process of buying, storing, and selling electricity to exploit variations in electricity spot prices, is becoming an important way of paying for expensive investments into grid-level storage. Independent system operators such as the New York Independent System Operator NYISO require that battery storage operators place bids into an hour-ahead market although settlements may occur in increments as small as five minutes, which is considered near "real-time". The operator has to place these bids without knowing the energy level in the battery at the beginning of the hour and simultaneously accounting for the value of leftover energy at the end of the hour. The problem is formulated as a dynamic program. We describe and employ a convergent approximate dynamic programming ADP algorithm that exploits monotonicity of the value function to find a revenue-generating bidding policy; using optimal benchmarks, we empirically show the computational benefits of the algorithm. Furthermore, we propose a distribution-free variant of the ADP algorithm that does not require any knowledge of the distribution of the price process and makes no assumptions regarding a specific real-time price model. We demonstrate that a policy trained on historical real-time price data from the NYISO using this distribution-free approach is indeed effective. This paper presents a framework for optimally allocating storage technologies in a power system. This decision support tool helps in quantitatively answering the questions on “where to and how much to install” considering the profits from arbitrage opportunities in a co-optimized electricity market. The developed framework is illustrated on a modified IEEE (Institute of Electrical and Electronics Engineers) 24 bus RTS (Reliability Test System), and the framework finds the optimal allocation solution and the revenues storage earns at each of these locations. Bulk energy storage, CAES (compressed air energy storage) is used as the representative storage technology, and the benefits of optimally allocated storage integration onto the grid are compared with transmission expansion solution. The paper also discusses about system-level indicators to identify candidate locations for economical storage ventures, which are derived based on the optimal storage allocation solution; and applies the market price based storage venture indicators on MISO (Mid-continental Independent System Operator) and PJM (Pennsylvania-New Jersey-Maryland Interconnection) electricity markets. High penetration of renewable generation will increase the requirement for both operating reserve (OR) and frequency response (FR), due to its variability, uncertainty, and limited inertia capability. Although the importance of optimal scheduling of OR has been widely studied, the scheduling of FR has not yet been fully investigated. In this context, this paper proposes a computationally efficient mixed integer linear programming formulation for a full stochastic scheduling model that simultaneously optimizes energy production, OR, FR, and underfrequency load shedding. By using value of lost load (VOLL) as the single security measure, the model optimally balances the cost associated with the provision of various ancillary services against the benefit of reduced cost of load curtailment. The proposed model is applied in a 2030-GB system to demonstrate its effectiveness. The impact of installed capacity of wind generation and setting of VOLL is also analyzed. This paper proposes a model to determine the optimal size of an energy storage facility from a strategic investor's perspective. This investor seeks to maximize its profit through making strategic planning, i.e., storage sizing, and strategic operational, i.e., offering and bidding, decisions. We consider the uncertainties associated with rival generators’ offering strategies and future load levels in the proposed model. The strategic investment decisions include the sizes of charging device, discharging device, and energy reservoir. The proposed model is a stochastic bi-level optimization problem; the planning and operation decisions are made in the upper-level, and market clearing is modeled in the lower-level under different operating scenarios. To make the proposed model computationally tractable, an iterative solution technique based on Benders’ decomposition is implemented. This provides a master problem and a set of subproblems for each scenario. Each subproblem is recast as an mathematical programs with equilibrium constraints. Numerical results based on real-life market data from Alberta's electricity market are provided. One of the most important challenges in smart grid systems is the integration of renewable energy resources into its design. In this paper, two different techniques to mitigate the time-varying and intermittent nature of renewable energy generation are considered. The first one is the use of storage, which smooths out the fluctuations in the renewable energy generation across time. The second technique is the concept of distributed generation combined with cooperation by exchanging energy among the distributed sources. This technique averages out the variation in energy production across space. This paper analyzes the tradeoff between these two techniques. The problem is formulated as a stochastic optimization problem with the objective of minimizing the time average cost of energy exchange within the grid. First, an analytical model of the optimal cost is provided by investigating the steady state of the system for some specific scenarios. Then, an algorithm to solve the cost minimization problem using the technique of Lyapunov optimization is developed, and results for the performance of the algorithm are provided. These results show that in the presence of limited storage devices, the grid can benefit greatly from cooperation, whereas in the presence of large storage capacity, cooperation does not yield much benefit. Further, it is observed that most of the gains from cooperation can be obtained by exchanging energy only among a few energy-harvesting sources. This paper addresses the problem of dynamic resource allocation in a multiservice direct-sequence code-division multiple-access (DS-CDMA) wireless network supporting real-time (RT) and nonreal-time (NRT) communication services. For RT users, a simple transmission power allocation strategy is assumed that maximizes the amount of capacity available to NRT users without violating quality of service requirements of RT users. For NRT users, a joint transmission power and spreading gain (transmission rate) allocation strategy, obtained via the solution of a constrained optimization problem, is provided. The solution maximizes the aggregate NRT throughput, subject to peak transmission power constraints and the capacity constraint imposed by RT users. The optimization problem is solved in a closed form, and the resulting resource allocation strategy is simple to implement as a hybrid CDMA time-division multiple-access strategy. Numerical results are presented showing that the optimal resource allocation strategy can offer substantial performance gains over other conventional resource allocation strategies for DS-CDMA networks.