.png){kind=icon}
Return
A matrix real-coded genetic algorithm to the unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2005.10.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An approach to solving the unit commitment (UC) problem is presented based on a matrix real-coded genetic algorithm (MRCGA) with new repairing mechanism and window mutation. The MRCGA chromosome consists of a real number matrix representing the generation schedule. Using the proposed coding, the MRCGA can solve the UC problem through genetic operations and avoid coping with a suboptimal economic dispatch (ED) problem. The new repairing mechanism guarantees that the generation schedule satisfies system and unit constraints. The window mutation improves the MRCGA searching performance. Numerical results show an improvement in the solution cost compared with the results obtained from other algorithms. (C) 2005 Elsevier B.V. All rights reserved.
Keywords:
matrix real-coded
genetic algorithm
unit commitment
generation schedule
economic dispatch
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
1.1W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more