.png){kind=icon}
返回
Fuzzy based fast dynamic programming solution of unit commitment with ramp constraints
.png){kind=icon}
OA
AI
DOI：10.1111/j.1468-0394.2009.00495.x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A fast dynamic programming technique based on a fuzzy based unit selection procedure is proposed in this paper for the solution of the unit commitment problem with ramp constraints. The curse of dimensionality of the dynamic programming technique is eliminated by minimizing the number of prospective solution paths to be stored at each stage of the search procedure. Heuristics like priority ordering of the units, unit grouping, fast economic dispatch based on priority ordering, and avoidance of repeated economic dispatch through memory action have been employed to make the algorithm fast. The proposed method produced comparable results with the best performing methods found in the literature.
Keyword:
dynamic programming
unit commitment problem
heuristic procedures
fuzzy based unit selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.6K
被引数:
3.8K
机构
引用论文
Differential modulation of synaptic plasticity and local circuit activity in the dentate gyrus and CA1 regions of the rat hippocampus by corticosterone.png)
StressOAAI
StressIF0
OAAI分享收藏
查看更多内容