.png){kind=icon}
Return
A genetic algorithm solution to the unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1109/59.485989.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a Genetic Algorithm (GA) solution to the Unit Commitment problem. GAs are general purpose optimization techniques based on principles inspired from; the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple GA algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the Varying Quality function technique and adding problem specific operators, satisfactory solutions to the Unit Commitment problem were obtained. Test results for systems of up to 100 units and comparisons with results obtained using Lagrangian Relaxation and Dynamic Programming are also reported.
Keywords:
unit commitment
genetic algorithms
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
Development of Knowledge of Unity of Tuberculosis and of the Portals of Entry of Tubercle Bacilli
PREAI
ShareSaveShareSaveShareSaveShareSaveDifferential 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