• DocumentCode
    976257
  • Title

    A solution to the unit-commitment problem using integer-coded genetic algorithm

  • Author

    Damousis, Ioannis G. ; Bakirtzis, Anastasios G. ; Dokopoulos, Petros S.

  • Author_Institution
    Electr. Power Syst. Lab., Aristotle Univ. of Thessaloniki, Hellas, Greece
  • Volume
    19
  • Issue
    2
  • fYear
    2004
  • fDate
    5/1/2004 12:00:00 AM
  • Firstpage
    1165
  • Lastpage
    1172
  • Abstract
    This paper presents a new solution to the thermal unit-commitment (UC) problem based on an integer-coded genetic algorithm (GA). The GA chromosome consists of a sequence of alternating sign integer numbers representing the sequence of operation/reservation times of the generating units. The proposed coding achieves significant chromosome size reduction compared to the usual binary coding. As a result, algorithm robustness and execution time are improved. In addition, generating unit minimum up and minimum downtime constraints are directly coded in the chromosome, thus avoiding the use of many penalty functions that usually distort the search space. Test results with systems of up to 100 units and 24-h scheduling horizon are presented.
  • Keywords
    genetic algorithms; power generation scheduling; alternating sign integer numbers; binary coding; integer-coded genetic algorithm; penalty functions; robustness; scheduling horizon; search space; thermal unit-commitment; unit commitment; unit-commitment problem; Biological cells; Cost function; Electricity supply industry; Genetic algorithms; Job shop scheduling; Power generation; Power markets; Power systems; Processor scheduling; Robustness;
  • fLanguage
    English
  • Journal_Title
    Power Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0885-8950
  • Type

    jour

  • DOI
    10.1109/TPWRS.2003.821625
  • Filename
    1295029