.png){kind=icon}
Return
Unit commitment by an enhanced simulated annealing algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2005.860922.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new simulated annealing (SA) algorithm combined with a dynamic economic dispatch method has been developed for solving the short-term unit commitment (UC) problem. SA is used for the scheduling of the generating units, while a dynamic economic dispatch method is applied incorporating the ramp rate constraints in the solution of the UC problem. New rules concerning the tuning of the control parameters of the SA algorithm are proposed. Three alternative mechanisms for generating feasible trial solutions in the neighborhood of the current one, contributing to the reduction of the required CPU time, are also presented. The ramp rates are taken into account by performing either a backward or a forward sequence of conventional economic dispatches with modified limits on the generating units. The proposed algorithm is considerably fast and provides feasible near-optimal solutions. Numerical simulations have proved the effectiveness of the proposed algorithm in solving large UC problems within a reasonable execution time.
Keywords:
dynamic economic dispatch (DED)
ramp rate constraints
simulated annealing (SA)
unit commitment (UC)
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
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more