Surrogate Lagrangian Relaxation and Branch-and-cut for Unit Commitment with Combined Cycle Units

被引:0
|
作者
Bragin, Mikhail A. [1 ]
Luh, Peter B. [1 ]
Yan, Joseph H.
Stern, Gary A.
机构
[1] Univ Connecticut, Dept Elect & Comp Engn, Storrs, CT 06269 USA
关键词
Branch-and-cut; Combined cycle units; Surrogate Lagrangian relaxation; Unit commitment and economic dispatch; OPTIMIZATION;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Combined cycle (CC) units are efficient because heat from combustion turbines is not wasted but is used for steam turbines. However, when state transitions are followed, CC units complicate the unit commitment and economic dispatch (UCED) problem. While branch-and-cut has been successful in solving UCED problems without considering CC units, transitions in one such unit affect the entire problem. Therefore, the convex hull is difficult to obtain and the UCED problem with CC units is difficult to solve. To efficiently solve the problem, we exploit linearity as well as separability. To decompose the problem into subproblems associated with conventional and CC units, our recently developed surrogate Lagrangian relaxation will be used to relax coupling system-wide constraints, and each subproblem will then be solved by using branch-and-cut. Constraints as well as transitions within a CC unit are handled locally and no longer affect the entire problem. Moreover, we will demonstrate that branch-and-cut can handle individual subproblems much more efficiently as compared to the original problem. The linear structure of coupling constraints is then exploited to obtain feasible costs. Numerical results demonstrate that the new approach is computationally efficient and generates good feasible solutions.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Novel Exploitation of Convex Hull Invariance for Solving Unit Commitment by Using Surrogate Lagrangian Relaxation and Branch-and-cut
    Bragin, Mikhail A.
    Luh, Peter B.
    Yan, Joseph H.
    Stern, Gary A.
    2015 IEEE POWER & ENERGY SOCIETY GENERAL MEETING, 2015,
  • [2] Internally Induced Branch-and-Cut Acceleration for Unit Commitment Based on Improvement of Upper Bound
    Gao, Qian
    Yang, Zhifang
    Yin, Wotao
    Li, Wenyuan
    Yu, Juan
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2022, 37 (03) : 2455 - 2458
  • [3] Novel Resolution of Unit Commitment Problems Through Quantum Surrogate Lagrangian Relaxation
    Feng, Fei
    Zhang, Peng
    Bragin, Mikhail A.
    Zhou, Yifan
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2023, 38 (03) : 2460 - 2471
  • [4] Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
    Alvarez-Miranda, Eduardo
    Sinnl, Markus
    COMPUTERS & OPERATIONS RESEARCH, 2017, 83 : 13 - 27
  • [5] A solution for unit commitment using Lagrangian relaxation combined with evolutionary programming
    Duo, HZ
    Sasaki, H
    Nagata, T
    Fujita, H
    ELECTRIC POWER SYSTEMS RESEARCH, 1999, 51 (01) : 71 - 77
  • [6] Lagrangian Relaxation Combined with Differential Evolution Algorithm for Unit Commitment Problem
    Sum-Im, Thanathip
    2014 IEEE EMERGING TECHNOLOGY AND FACTORY AUTOMATION (ETFA), 2014,
  • [7] A branch-and-cut algorithm for the maximum covering cycle problem
    Alvarez-Miranda, Eduardo
    Sinnl, Markus
    ANNALS OF OPERATIONS RESEARCH, 2020, 284 (02) : 487 - 499
  • [8] A branch-and-cut algorithm for the maximum covering cycle problem
    Eduardo Álvarez-Miranda
    Markus Sinnl
    Annals of Operations Research, 2020, 284 : 487 - 499
  • [9] Production scheduling under uncertainty of an open-pit mine using Lagrangian relaxation and branch-and-cut algorithm
    Chatterjee, Snehamoy
    Dimitrakopoulos, Roussos
    INTERNATIONAL JOURNAL OF MINING RECLAMATION AND ENVIRONMENT, 2020, 34 (05) : 343 - 361
  • [10] Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
    Pereira, Dilson Lucas
    da Cunha, Alexandre Salles
    NETWORKS, 2018, 71 (01) : 31 - 50