.png){kind=icon}
返回
A Variable-Dimension Optimization Approach to Unit Commitment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2009.2038921.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a variable-dimension optimization approach to address the high dimensionality issues in solving the unit commitment problem. This method introduces the concept of adaptive search space dimension. The proposed approach is implemented in particle swarm optimization algorithm. The optimization process starts with an arbitrary problem dimension, adapts with respect to the swarm progress and finally selects the optimal dimensional space. The efficiency of this method is tested on a ten-unit test system. The results are compared with binary programming and fixed duty cycle approaches. The simulation results show that the proposed method results in considerable reduction of problem dimension, faster convergence and improved quality of the final solution.
Keyword:
Evolutionary programming
particle swarm optimization
unit commitment
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
分享收藏Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏
查看更多内容