.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Unit commitment
Genetic Algorithms
Monte Carlo sampling
Unit dynamics
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
View more organizations
Cited Papers
ShareSaveIntegrating solar PV (photovoltaics) in utility system operations: Analytical framework and Arizona case study.png)
ENERGY
OAAI
ENERGYIF9.4
OAAIShareSaveA computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
PREAI
ShareSaveShareSaveShareSave no more