• DocumentCode
    3488431
  • Title

    Unit commitment with network constraints

  • Author

    Ayuyev, B.I. ; Yerokhin, P.M. ; Shubin, N.G. ; Neujmin, V.G. ; Alexandrov, A.A.

  • Author_Institution
    United Energy Syst. of Russia, Moscow
  • fYear
    2005
  • fDate
    27-30 June 2005
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    A technique for unit commitment with network constraints (UCNC) is described. The technique makes use of the mixed-integer linear programming (MILP) algorithm. The network model with regard to constraints is formed by coefficients of the influence of the network area on controlled cross-sections. To improve the convergence, the generation units are grouped on their actual operation conditions basis. To illustrate the technique proposed realistic case studies results are presented.
  • Keywords
    integer programming; linear programming; power generation dispatch; power generation scheduling; generation units; mixed-integer linear programming; network constraints; unit commitment; Computer networks; Decision making; Electricity supply industry; Hair; Linear programming; Load flow; Mathematical model; Optimal scheduling; Power generation; Power markets; Secure constrained unit commitment; mixed-integer programming;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Power Tech, 2005 IEEE Russia
  • Conference_Location
    St. Petersburg
  • Print_ISBN
    978-5-93208-034-4
  • Electronic_ISBN
    978-5-93208-034-4
  • Type

    conf

  • DOI
    10.1109/PTC.2005.4524780
  • Filename
    4524780
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3488431