• DocumentCode
    2382109
  • Title

    Analytical conditions for determining feasible commitment states of SCUC problems

  • Author

    Zhai, Qiaozhu ; Wu, Hongyu ; Guan, Xiaohong

  • Author_Institution
    SKLMS Lab., Xi´´an Jiaotong Univ., Xi´´an, China
  • fYear
    2010
  • fDate
    25-29 July 2010
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    Security constrained unit commitment (SCUC) is one of the most important daily tasks that independent system operators (ISOs) or regional transmission organizations (RTOs) must accomplish in daily electric power market. Identifying the feasibility of the unit commitment state with security constraints is crucial for solving SCUC problems. If the feasibility of unit commitment state can be identified quickly, the efficiency of SCUC problem-solving methods can be greatly improved. In this paper, a group of analytical conditions for a commitment state to be feasible is established. More importantly, most of the commitment states can be quickly identified as feasible/infeasible by using these conditions. Numerical testing is performed for 2 power grids and the preliminary results shows that over 95% of infeasible commitment states are identified analytically by one of the necessary conditions, and over 74% of feasible commitment states are identified by the analytical sufficient conditions. Also, these conditions provide useful information for obtaining feasible SCUC solutions.
  • Keywords
    power generation dispatch; power generation economics; power generation scheduling; power markets; power system security; daily electric power market; feasible commitment states; independent system operators; power grids; problem-solving methods; regional transmission organizations; security constrained unit commitment; Feasibility Conditions; Mixed Integer Linear Programming; Security Constraints; Unit Commitment;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Power and Energy Society General Meeting, 2010 IEEE
  • Conference_Location
    Minneapolis, MN
  • ISSN
    1944-9925
  • Print_ISBN
    978-1-4244-6549-1
  • Electronic_ISBN
    1944-9925
  • Type

    conf

  • DOI
    10.1109/PES.2010.5589728
  • Filename
    5589728