.png){kind=icon}
返回
Emerging solution of large-scale unit commitment problem by Stochastic Priority List
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2005.07.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new approach for unit commitment problem using Stochastic Priority List method. In this method, rapidly some initial unit commitment schedules are generated by Priority List method and priority based stochastic window system. Excess units are added with system dependent probability distribution to avoid overlooking a desired solution during repeated search. Constraints are not considered in this stage. Then schedules are modified gradually using the problem specific heuristics to fulfill constraints. To reduce calculations, heuristics are applied only to the solutions, which can be expected to improve. Besides, sign vector is introduced to reduce economic load dispatch (ELD) overhead recalculations. This process is repeated for optimal solution. The proposed method is tested using the reported problem data set. Simulation results for the systems up to 100-unit are compared to previous reported results. Numerical results show an improvement in solution cost and time compared to the results obtained from Genetic Algorithm and others. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
gray zone
heuristic
probability distribution
Stochastic Priority
unit commitment
window system
期刊
IF:
4.2
论文数:
1.2W
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容