.png){kind=icon}
返回
Unit commitment solution methodology using genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/59.982197.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solution methodology of unit commitment (UC) using genetic algorithms (GA) is presented. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as minimization of the total objective function while satisfying the associated constraints. Problem specific operators are proposed for the satisfaction of time dependent constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented.
Keyword:
optimization
genetic algorithms (GA)
unit commitment (UC)
economic dispatch (EC)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容