Developing Bidding and Offering Curves of a Price-Maker Energy Storage Facility Based on Robust Optimization

This paper presents an algorithm to construct hourly bidding and offering curves to purchase and sell electricity for a price-maker merchant energy storage facility participating in a day-ahead electricity market. Hourly generation and demand price quota curves (GPQCs and DPQCs) are used to model th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on smart grid 2019-01, Vol.10 (1), p.650-660
Main Authors: Shafiee, Soroush, Zareipour, Hamidreza, Knight, Andrew M.
Format: Article
Language:English
Subjects:
Algorithms
bidding and offering strategy
Computational modeling
Computer simulation
Confidence intervals
Electricity consumption
Electricity pricing
Electricity supply industry
Energy storage
Energy storage facility
Indexes
Integer programming
Linear programming
Markets
Mathematical models
Optimization
price quota curves
Risk management
robust optimization
Robustness
Robustness (mathematics)
Strategy
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an algorithm to construct hourly bidding and offering curves to purchase and sell electricity for a price-maker merchant energy storage facility participating in a day-ahead electricity market. Hourly generation and demand price quota curves (GPQCs and DPQCs) are used to model the price impact of storage operation in the participation strategy problem of a price-maker storage facility in the market. This paper introduces a max-min mixed-integer linear programming model to present a participation strategy to manage the risk of uncertainty associated with forecasted GPQCs and DPQCs by robust optimization. The max-min formulation is converted to its equivalent linear maximization formulation based on the worst case scenario during charging and discharging hours. Then, an algorithm is proposed to build hourly bidding and offering curves. To do so, the confidence intervals for GPQCs and DPQCs are divided into subintervals and the robust mixed-integer linear formulation is solved sequentially for each subinterval of GPQCs and DPQCs. Sequential constraints are applied to ensure the decreasing and increasing nature of the bidding and offering curves, respectively. Then, hourly bidding and offering curves are built based on the obtained scheduling and corresponding price results. The proposed bidding and offering strategy is presented and validated using numerical simulations.
ISSN:1949-3053
1949-3061
DOI:10.1109/TSG.2017.2749437