Unit commitment using a new integer coded genetic algorithm

This paper proposes a new Integer‐Coded Genetic Algorithm (ICGA) for the solution of the thermal unit commitment problem. The thermal generating units scheduling consists of the sequence of operation/reservation times of the generating units, which is coded into a sequence of alternating sign intege...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European transactions on electrical power Jg. 19; H. 8; S. 1161 - 1176
Hauptverfasser: Amjady, Nima, Shirzadi, Ali
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 01.11.2009
Wiley
Schlagworte:
Applied sciences
Cost engineering
crossover
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
Genetic algorithms
integer-coded genetic algorithm
Integers
mutation
Mutations
Operation. Load control. Reliability
Operators
Power networks and lines
Robustness
Scheduling
Unit commitment
Performance evaluation
Dispatching problem
mutation
crossover
integer-coded genetic algorithm
unit commitment
Stopping time
Genetic algorithm
Power distribution planning
Effectiveness factor
Comparative study
ISSN:1430-144X, 1546-3109
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper proposes a new Integer‐Coded Genetic Algorithm (ICGA) for the solution of the thermal unit commitment problem. The thermal generating units scheduling consists of the sequence of operation/reservation times of the generating units, which is coded into a sequence of alternating sign integer numbers in the proposed ICGA. The minimum up and down time constraints of the generating units are directly coded in the chromosome structure of the ICGA. The proposed ICGA has a new hybrid crossover composed of modified average bound and swapping operators. In addition, a combination of uniform and non‐uniform mutations is used as the mutation operator. As a result, the algorithm robustness is improved. Test results with systems of up to 300 units and 24 hours scheduling horizon are presented. The comparison of the obtained results with those of other Unit Commitment (UC) methods justifies the effectiveness of the proposed method in light of minimizing the total operation cost. Copyright © 2008 John Wiley & Sons, Ltd.
Bibliographie:ArticleID:ETEP297
istex:F4E9ED121E42BDF5D318C7000A6F6D273C3F0C0F
ark:/67375/WNG-384WR1QX-Q
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1430-144X
1546-3109
DOI:10.1002/etep.297