Solving the Unit Commitment Problem by a Unit Decommitment Method

被引：0
|
作者：
C. L. Tseng
C. A. Li
S. S. Oren
机构：
[1] University of Maryland,Department of Civil Engineering
[2] Pacific Gas and Electric Company,Department of Industrial Engineering and Operations Research
[3] University of California at Berkeley,undefined
来源：
Journal of Optimization Theory and Applications | 2000年 / 105卷
关键词：
power system scheduling; unit commitment; unit decommitment; mixed-integer programming; Lagrangian relaxation; heuristic procedures;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we present a unified decommitment method to solve the unit commitment problem. This method starts with a solution having all available units online at all hours in the planning horizon and determines an optimal strategy for decommitting units one at a time. We show that the proposed method may be viewed as an approximate implementation of the Lagrangian relaxation approach and that the number of iterations is bounded by the number of units. Numerical tests suggest that the proposed method is a reliable, efficient, and robust approach for solving the unit commitment problem.
引用
收藏
页码：707 / 730
页数：23
相关论文
共 50 条
  • [41] Solving unit commitment problem by a binary shuffled frog leaping algorithm
    Barati, Mohammad
    Farsangi, Malihe M.
    [J]. IET GENERATION TRANSMISSION & DISTRIBUTION, 2014, 8 (06) : 1050 - 1060
  • [42] Solving Unit Commitment problem using Hybrid Particle Swarm Optimization
    Ting, TO
    Rao, MVC
    Loo, CK
    Ngu, SS
    [J]. JOURNAL OF HEURISTICS, 2003, 9 (06) : 507 - 520
  • [43] A floating-point genetic algorithm for solving the unit commitment problem
    Dang, Chuangyin
    Li, Minqiang
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) : 1370 - 1395
  • [44] Application of ACO and PSO combinative algorithm in solving unit commitment problem
    Xiao Gang
    Li Shou-zhi
    Wang Xuan-hong
    Xiao Rui
    [J]. Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 588 - 592
  • [45] Solving Security Constrained Unit Commitment Problem Using Inductive Learning
    Iqbal, Talha
    Ul Banna, Hasan
    Feliachi, Ali
    Choudhry, Muhammad
    [J]. 2022 IEEE KANSAS POWER AND ENERGY CONFERENCE (KPEC 2022), 2022,
  • [46] Solving the security constrained unit commitment problem: Three novel approaches
    Francesco Castelli, Alessandro
    Harjunkoski, Iiro
    Poland, Jan
    Giuntoli, Marco
    Martelli, Emanuele
    Grossmann, Ignacio E.
    [J]. International Journal of Electrical Power and Energy Systems, 2024, 162
  • [47] The Parallel Interior Point for Solving the Continuous Optimization Problem of Unit Commitment
    Hu, Guili
    Yang, Linfeng
    [J]. 2016 9TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI 2016), 2016, : 1333 - 1338
  • [48] Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
    Tiew-On Ting
    M.V.C. Rao
    C.K. Loo
    S.S. Ngu
    [J]. Journal of Heuristics, 2003, 9 : 507 - 520
  • [49] Binary real coded firefly algorithm for solving unit commitment problem
    Chandrasekaran, K.
    Simon, Sishaj P.
    Padhy, Narayana Prasad
    [J]. INFORMATION SCIENCES, 2013, 249 : 67 - 84
  • [50] Solving the Unit Commitment Problem with Improving Binary Particle Swarm Optimization
    Liu, Jianhua
    Wang, Zihang
    Chen, Yuxiang
    Zhu, Jian
    [J]. ADVANCES IN SWARM INTELLIGENCE, ICSI 2022, PT I, 2022, : 176 - 189
12345