.png){kind=icon}
Return
Solving the unit commitment problem with a genetic algorithm through a constraint satisfaction technique
.png){kind=icon}
PRE
AI
DOI：10.1016/0378-7796(96)01036-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a genetic algorithm (GA) in conjunction with constraint handling techniques to solve the thermal unit commitment problem. To deal effectively with the constraints of the problem and prune the search space of the GA in advance, the difficult minimum up- and down-time constraints are embedded in the binary strings that are coded to represent the on-off states of the generating units. The other constraints are handled by integrating penalty factors into the cost function within an enhanced economic dispatch program. The proposed GA approach has been tested on a practical Taiwan Power (Taipower) thermal system over a 24-hour period for different utility factors and GA control parameters. Test results reveal that the features of easy implementation, fast convergence, and a highly near-optimal solution in solving the UC problem can be achieved by the proposed GA approach.
Keywords:
unit commitment
genetic algorithms
optimization techniques
Journal
IF:
4.2
Papers:
1.2W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
ShareSaveShareSaveShareSaveShareSave no more
no more