.png){kind=icon}
返回
Unit commitment using Lagrangian relaxation and particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2014.03.061.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Unit commitment (UC) is a NP-hard nonlinear mixed-integer optimization problem. This paper proposes ELRPSO, an algorithm to solve the UC problem using Lagrangian relaxation (LR) and particle swarm optimization (PSO). ELRPSO employs a state-of-the-art powerful PSO variant called comprehensive learning PSO to find a feasible near-optimal UC schedule. Each particle represents Lagrangian multipliers. The PSO uses a low level LR procedure, a reserve repairing heuristic, a unit decommitment heuristic, and an economic dispatch heuristic to obtain a feasible UC schedule for each particle. The reserve repairing heuristic addresses the spinning reserve and minimum up/down time constraints simultaneously. Moreover, the reserve repairing and unit decommitment heuristics consider committing/decommitting a unit for a consecutive period of hours at a time in order to reduce the total startup cost. Each particle is initialized using the Lagrangian multipliers obtained from a LR that iteratively updates the multipliers through an adaptive subgradient heuristic, because the multipliers obtained from the LR tend to be close to the optimal multipliers and have a high potential to lead to a feasible near-optimal UC schedule. Numerical results on test thermal power systems of 10, 20, 40, 60, 80, and 100 units demonstrate that ELRPSO is able to find a low-cost UC schedule in a short time and is robust in performance. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Unit commitment
Lagrangian relaxation
Particle swarm optimization
Comprehensive learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
分享收藏
查看更多内容