.png){kind=icon}
返回
Unit commitment by an enhanced simulated annealing algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2005.860922.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
dynamic economic dispatch (DED)
ramp rate constraints
simulated annealing (SA)
unit commitment (UC)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
.png){kind=icon}
PREAI
分享收藏
查看更多内容