Two-Stage Minimax Regret Robust Unit Commitment

被引:198
作者
Jiang, Ruiwei [1 ]
Wang, Jianhui [2 ]
Zhang, Muhong [3 ]
Guan, Yongpei [1 ]
机构
[1] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
[2] Argonne Natl Lab, Lemont, IL 60439 USA
[3] Arizona State Univ, Sch Comp Informat & Decis Syst Engn, Tempe, AZ 85281 USA
基金
美国国家科学基金会;
关键词
Benders' decomposition; minimax regret; uncertainty; unit commitment; STOCHASTIC SECURITY; WIND POWER; DISCRETE OPTIMIZATION; LAGRANGIAN-RELAXATION; RISK ANALYSIS; MIN-MAX; SYSTEM; TRANSMISSION; UNCERTAINTY; GENERATION;
D O I
10.1109/TPWRS.2013.2250530
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
In addition to long-existing load uncertainty on power systems, continuously increasing renewable energy injections (such as wind and solar) have further made the power grid more volatile and uncertain. Stochastic and recently introduced robust optimization approaches have been studied to provide the day-ahead unit commitment decision with the consideration of real-time load and supply uncertainties. In this paper, we introduce an innovative minimax regret unit commitment model aiming to minimize the maximum regret of the day-ahead decision from the actual realization of the uncertain real-time wind power generation. Our approach will ensure the robustness of the unit commitment decision considering the inherent uncertainty in wind generation. Meanwhile, our approach will provide a system operator a clear picture in terms of the maximum regret value among all possible scenarios. A Benders' decomposition algorithm is developed to solve the problem. Finally, our extensive case studies compare the performances of three different approaches (robust optimization, minimax regret, and stochastic optimization) and verify the effectiveness of our proposed algorithm.
引用
收藏
页码:2271 / 2282
页数:12
相关论文
共 49 条
[1]
Min-max and min-max regret versions of combinatorial optimization problems: A survey [J].
Aissi, Hassene ;
Bazgan, Cristina ;
Vanderpooten, Daniel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) :427-438
[2]
Coordinated Trading of Wind and Thermal Energy [J].
Al-Awami, Ali T. ;
El-Sharkawi, Mohamed A. .
IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2011, 2 (03) :277-287
[3]
Offering Strategy Via Robust Optimization [J].
Baringo, Luis ;
Conejo, Antonio J. .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2011, 26 (03) :1418-1425
[4]
Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[5]
Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[6]
Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem [J].
Bertsimas, Dimitris ;
Litvinov, Eugene ;
Sun, Xu Andy ;
Zhao, Jinye ;
Zheng, Tongxin .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2013, 28 (01) :52-63
[7]
Wind Power Trading Under Uncertainty in LMP Markets [J].
Botterud, Audun ;
Zhou, Zhi ;
Wang, Jianhui ;
Bessa, Ricardo J. ;
Keko, Hrvoje ;
Sumaili, Jean ;
Miranda, Vladimiro .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2012, 27 (02) :894-903
[8]
Market-clearing with stochastic security - Part II: Case studies [J].
Bouffard, F ;
Galiana, FD ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (04) :1827-1835
[9]
Market-clearing with stochastic security - Part I: Formulation [J].
Bouffard, F ;
Galiana, FD ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (04) :1818-1826
[10]
Bouffard F., 2008, P IEEE POW EN SOC GE