Mixed-Integer Conic Formulation of Unit Commitment with Stochastic Wind Power

被引:1
|
作者
Zheng, Haiyan [1 ]
Huang, Liying [1 ]
Quan, Ran [2 ]
机构
[1] Guangxi Univ, Coll Math & Informat Sci, Nanning 530004, Peoples R China
[2] Henan Univ Technol, Coll Sci, Zhengzhou 450001, Peoples R China
基金
中国国家自然科学基金;
关键词
unit commitment; stochastic wind power; chance-constrained programming; sample average approximation; mixed-integer second-order conic programming; REFORMULATION; UNCERTAINTY; RELAXATION; SECURITY;
D O I
10.3390/math11020346
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Due to the high randomness and volatility of renewable energy sources such as wind energy, the traditional thermal unit commitment (UC) model is no longer applicable. In this paper, in order to reduce the possible negative effects of an inaccurate wind energy forecast, the chance-constrained programming (CCP) method is used to study the UC problem with uncertainty wind power generation, and chance constraints such as power balance and spinning reserve are satisfied with a predetermined probability. In order to effectively solve the CCP problem, first, we used the sample average approximation (SAA) method to transform the chance constraints into deterministic constraints and to obtain a mixed-integer quadratic programming (MIQP) model. Then, the quadratic terms were incorporated into the constraints by introducing some auxiliary variables, and some second-order cone constraints were formed by combining them with the output characteristics of thermal unit; therefore, a tighter mixed-integer second-order cone programming (MISOCP) formulation was obtained. Finally, we applied this method to some systems including 10 to 100 thermal units and 1 to 2 wind units, and we invoked MOSEK in MATLAB to solve the MISOCP formulation. The numerical results obtained within 24 h confirm that not only is the MISOCP formulation a successful reformulation that can achieve better suboptimal solutions, but it is also a suitable method for solving the large-scale uncertain UC problem. In addition, for systems of up to 40 units within 24 h that do not consider wind power and pollution emissions, the numerical results were compared with those of previously published methods, showing that the MISOCP formulation is very promising, given its excellent performance.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Performance Analysis of Mixed-Integer Conic and Mixed-Integer Linear Unit Commitment Models
    Savasci, Alper
    Inaolaji, Adedoyin
    Paudyal, Sumit
    [J]. 2020 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (PESGM), 2020,
  • [2] Mixed-Integer Linear Programming Formulation of Combined Heat and Power Units for the Unit Commitment Problem
    Koller, Martin
    Hofmann, Rene
    [J]. JOURNAL OF SUSTAINABLE DEVELOPMENT OF ENERGY WATER AND ENVIRONMENT SYSTEMS-JSDEWES, 2018, 6 (04): : 755 - 769
  • [3] A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
    Carrion, Miguel
    Arroyo, Jose M.
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (03) : 1371 - 1378
  • [4] Mixed-Integer Formulation of Unit Commitment problem for power systems: Focus on start-up cost
    Tuffaha, Mutaz
    Gravdahl, Jan Tommy
    [J]. 39TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY (IECON 2013), 2013, : 8160 - 8165
  • [5] On Mixed-Integer Programming Formulations for the Unit Commitment Problem
    Knueven, Bernard
    Ostrowski, James
    Watson, Jean-Paul
    [J]. INFORMS JOURNAL ON COMPUTING, 2020, 32 (04) : 857 - 876
  • [6] A stochastic mixed-integer conic programming model for distribution system expansion planning considering wind generation
    Ortiz J.M.H.
    Pourakbari-Kasmaei M.
    López J.
    Mantovani J.R.S.
    [J]. Energy Systems, 2018, 9 (3) : 551 - 571
  • [7] Lifting for conic mixed-integer programming
    Atamtuerk, Alper
    Narayanan, Vishnu
    [J]. MATHEMATICAL PROGRAMMING, 2011, 126 (02) : 351 - 363
  • [8] Conic mixed-integer rounding cuts
    Alper Atamtürk
    Vishnu Narayanan
    [J]. Mathematical Programming, 2010, 122 : 1 - 20
  • [9] Conic mixed-integer rounding cuts
    Atamtuerk, Alper
    Narayanan, Vishnu
    [J]. MATHEMATICAL PROGRAMMING, 2010, 122 (01) : 1 - 20
  • [10] Lifting for conic mixed-integer programming
    Alper Atamtürk
    Vishnu Narayanan
    [J]. Mathematical Programming, 2011, 126 : 351 - 363