.png){kind=icon}
返回
Fuzzy and simulated annealing based dynamic programming for the unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2008.06.039.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A dynamic programming technique with a fuzzy and simulated annealing based unit selection procedure has been proposed in this paper for the solution of the UC problem. 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, 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. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Dynamic programming
Unit commitment problem
Heuristic procedures
Fuzzy based unit selection
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Differential modulation of synaptic plasticity and local circuit activity in the dentate gyrus and CA1 regions of the rat hippocampus by corticosterone.png)
Stress
OAAI
StressIF0
OAAI分享收藏
查看更多内容