.png){kind=icon}
返回
Implementation of clustering based unit commitment employing imperialistic competition algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2016.04.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Saving of fuel cost can be done through proper commitment of available generating units. This paper presents a novel technique to solve the problem of unit commitment through sorting of units into different clusters based on Imperialistic Competition Algorithm (ICA). This sorting is implemented in order to decrease the overall operating cost and to assure the various constraints that involve minimum up/down. The technique of unit commitment is a significant assignment in the normal working of power systems which can actually be represented as a large scale minimization problem that involves non linear mixed integers. A new technique employing the concept of cluster algorithm called as additive and divisive hierarchical clustering has been used based on a new technique called as Imperialistic Competition Algorithm in order to carry out the technique of unit commitment. Proposed methodology involves two individual algorithms. Additive cluster algorithm has been employed while the load is increasing while divisive cluster algorithm has been used when the load is decreasing. The technique that has been developed has been tested on system with generating units in range of 10-100 and the superior performance of the technique has been reported through simulation results. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Unit commitment
Additive clustering
Divisive clustering
Imperialistic Competition Algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.1W
机构
引用论文
.png){kind=icon}
Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏
查看更多内容