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

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems Vol. 19; no. 2; pp. 1165 - 1172
Main Authors: Damousis, I.G., Bakirtzis, A.G., Dokopoulos, P.S.
Format: Journal Article
Language:English
Published: New York IEEE 01.05.2004
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Biological cells
Cost function
Electricity supply industry
Genetic algorithms
Job shop scheduling
Power generation
Power markets
Power systems
Processor scheduling
Robustness
ISSN:0885-8950, 1558-0679
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2003.821625