.png){kind=icon}
返回
A Solution to the Unit Commitment Problem Using Imperialistic Competition Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2011.2158010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new approach via a new evolutionary algorithm known as imperialistic competition algorithm (ICA) to solve the unit commitment (UC) problem. In ICA the initial population individuals (countries) are in two types: imperialists and colonies that all together form some empires. Imperialistic competitions among these empires converge to a state in which there exists only one empire. In the proposed ICA for the UC problem, the scheduling variables are coded as integers; therefore, the minimum up/down-time constraints can be handled directly. A new method for initializing the countries is proposed. To verify the performance of the proposed algorithm, it is applied to systems with number of generating units in range of 10 up to 100 in one-day scheduling period.
Keyword:
Generation scheduling
imperialistic competition algorithm
optimization methods
unit commitment problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏
查看更多内容