.png){kind=icon}
Return
Unit commitment solution methodology using genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/59.982197.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Solution methodology of unit commitment (UC) using genetic algorithms (GA) is presented. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as minimization of the total objective function while satisfying the associated constraints. Problem specific operators are proposed for the satisfaction of time dependent constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented.
Keywords:
optimization
genetic algorithms (GA)
unit commitment (UC)
economic dispatch (EC)
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
.png){kind=icon}
ShareSaveShareSaveShareSave no more
no more