.png){kind=icon}
.png){kind=icon}
Return
Hybridizing genetic algorithm with grey prediction evolution algorithm for solving unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-023-04527-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The unit commitment problem (UCP), which includes the unit schedule and power dispatch, is a nonlinear high-dimensional and highly constrained mixed-integer combinatorial optimization problem. One challenge herein is to obtain high-quality solutions considering various constraints. Developing a competitive hybrid method is a mainstream study goal in this field, which has focused on the unit schedule optimization but less on power dispatch. Inspired by the advantage of genetic algorithms (GAs) in solving combinational optimization problems and the characteristic of grey prediction evolution algorithm (GPE) with strong exploration ability, this paper proposes a novel hybrid GA and GPE method, termed hGAGPE, to solve the UCP. In hGAGPE, GPE, as a novel real parameter stochastic search algorithm based on the grey prediction theory for data mining, is first employed to solve the power dispatch of the UCP. Meanwhile, the unit schedule is performed by the popular GA. Additionally, some heuristic repair mechanisms based on the priority list and an elite selection mechanism are incorporated to enhance the performance of hGAGPE. The proposed hGAGPE is evaluated on six test systems with generating units in the range of 10 to 100 during a 24-h scheduling period. The numerical results demonstrate the feasibility and effectiveness of hGAGPE in comparison with other existing approaches.
Keywords:
Genetic algorithm
Grey prediction evolution algorithm
Hybrid method
Power dispatch
Unit commitment
Journal
IF:
3.5
Papers:
7.5K
Citations:
1.7W