.png){kind=icon}
返回
Genetic-based unit commitment algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/59.536120.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new unit commitment scheduling algorithm. The proposed algorithm consist of using a genetic algorithm with domain specific mutation operators. The proposed algorithm can easily accommodate any constraint that can be true costed. Robustness of the proposed algorithm is demonstrated by comparison to a Lagrangian relaxation unit commitment algorithm on three different utilities. Results show the proposed algorithm finds good unit commitment schedules in a reasonable amount of computation time. Included in the appendix is an explanation of the true costing approach.
Keyword:
LAGRANGIAN-RELAXATION
CONSTRAINTS
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏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分享收藏
查看更多内容