Distributionally Robust Optimal Bidding of Controllable Load Aggregators in the Electricity Market
Lists
Only you see this
Abstract
An optimal bidding model of controllable loads is proposed to minimize the worst-case conditional expectation of electricity purchase cost simultaneously in day-ahead and real-time markets. By reformulating the worst-case conditional value-at-risk (CVaR) constraints, a solvable semi-definite program (SDP) is presented to relax the moment uncertainty of electricity price and simultaneously determine the optimal day-ahead bid and real-time increment/decrement bid.
BibTeX
@article{yang2017distributionally,
author = {Hongming Yang and Shiming Zhang and Duo Qiu and Junhua Zhao and Mingyong Lai and Zhao Yang Dong and Zhao Hui Dong},
title = {{Distributionally Robust Optimal Bidding of Controllable Load Aggregators in the Electricity Market}},
journal = {IEEE Transactions on Power Systems},
year = {2017},
doi = {10.1109/tpwrs.2017.2701650},
}Loading related content...