.png){kind=icon}
返回
An improved binary particle swarm optimization for unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2008.10.047.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a new improved binary PSO (IBPSO) method to solve the unit commitment (UC) problem, which is integrated binary particle swarm optimization (BPSO) with lambda-iteration method. The IBPSO is improved by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. To verify the advantages of the IBPSO method, the IBPSO is tested and compared to the other methods on the systems with the number of units in the range of 10-100. Numerical results demonstrate that the IBPSO is Superior to other methods reported in the literature in terms of lower production cost and shorter computational time. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Unit commitment
Priority list
Particle swarm optimization
Heuristic search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
PREAI
分享收藏Propiedades de la Utrecht Work Engagement Scale (UWES-S 9): análisis exploratorio con estudiantes en Ecuador.png)
Innovar
OAAI
InnovarIF0
OAAI分享收藏
查看更多内容