.png){kind=icon}
返回
An Improved Genetic Algorithm Approach to the Unit Commitment/Economic Dispatch Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2020.2986710.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The deployment of new technologies, the importance of accurately modeling the dynamics of the generating units and the introduction of new policies are making the solution of the Unit Commitment/Economic Dispatch problem more and more complicated.In the present scenario, traditionally followed scheduling criteria might not lead to the optimal fleet configuration any more. In addition, most of the widely used techniques have limited capabilities at modeling the nonlinear dynamics of committed power plants. When realistic power systems comprising of several tens of generating units are modeled, the resulting optimization problem turns to be computationally intensive for the current computing capabilities. In this paper, an improved version of a GA-based optimization algorithm is presented. A detailed methodology aimed at obtaining a more efficient version of the GA, and a more detailed and accurate description of the flexible operation flexibility of the power plants is described.
Keyword:
Unit commitment
Genetic Algorithms
Monte Carlo sampling
Unit dynamics
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
查看更多机构
引用论文
Integrating solar PV (photovoltaics) in utility system operations: Analytical framework and Arizona case study在公用事业系统运营中整合太阳能光伏 (光伏): 分析框架和亚利桑那州案例研究.png)
ENERGY
OAAI
ENERGYIF9.4
OAAI分享收藏A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem用于热单位承诺问题的计算有效的混合整数线性公式
PREAI
分享收藏 没有更多内容