.png){kind=icon}
Return
A solution to the unit-commitment problem using integer-coded genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2003.821625.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 opera-tion/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:
generation scheduling
genetic algorithm
unit commitment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveDifferential modulation of synaptic plasticity and local circuit activity in the dentate gyrus and CA1 regions of the rat hippocampus by corticosterone.png)
Stress
OAAI
StressIF0
OAAIShareSave
View more