Hybrid differential evolution and Cuckoo search algorithm for solving economic dispatch problems

Economic dispatch (ED) is an important measure for energy conservation and consumption reduction in power systems, and is a typical multi constraint nonlinear optimization problem in mathematics. To address the limitations of traditional ED solving methods, a hybrid differential evolution (DE) and cuckoo search (CS) algorithm (HCS) is proposed. The HCS algorithm integrates the mutation and crossover operations of DE into the CS framework, enhancing population diversity and global search capability. Further refine the mutation parameters and operations to improve search efficiency and avoid premature convergence. Extensive simulations were conducted on three different ED scenarios, including 13, 40, and 15 unit systems, considering valve point effects, prohibited operating zones, and ramp rate limitations. The comparison results show that the HCS algorithm outperforms several recently published optimization techniques in terms of optimization accuracy, achieving a minimum cost of 17963.83 for 13 units and 121414.19 for 40 units. The HCS algorithm also demonstrates excellent convergence speed and stability, reflected in faster convergence curves and lower variance values. The proposed HCS algorithm combines the advantages of DE and CS, effectively solving the ED problem. Compared with other algorithms, it has advantages in optimization accuracy, convergence speed, and robustness.

Authors

Institutions

Publication Details

Published
2024-09-13
DOI
https://doi.org/10.1109/itme63426.2024.00059
Citations
2
Primary Topic
Electric Power System Optimization
Type
article
Field-Weighted Citation Impact
0.42
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hybrid differential evolution and Cuckoo search algorithm for solving economic dispatch problems

Zeng Jian, Xie Yongsheng, R. Shen, Feng Bo-Xiang et al.
2 citations
Electric Power System Optimization
0.42
article

Hybrid differential evolution and Cuckoo search algorithm for solving economic dispatch problems

Zeng Jian, Xie Yongsheng, R. Shen, Feng Bo-Xiang, Feng Ming-Jian, Rao Wan-Xian
article en
2 citations

Abstract

Economic dispatch (ED) is an important measure for energy conservation and consumption reduction in power systems, and is a typical multi constraint nonlinear optimization problem in mathematics. To address the limitations of traditional ED solving methods, a hybrid differential evolution (DE) and cuckoo search (CS) algorithm (HCS) is proposed. The HCS algorithm integrates the mutation and crossover operations of DE into the CS framework, enhancing population diversity and global search capability. Further refine the mutation parameters and operations to improve search efficiency and avoid premature convergence. Extensive simulations were conducted on three different ED scenarios, including 13, 40, and 15 unit systems, considering valve point effects, prohibited operating zones, and ramp rate limitations. The comparison results show that the HCS algorithm outperforms several recently published optimization techniques in terms of optimization accuracy, achieving a minimum cost of 17963.83 for 13 units and 121414.19 for 40 units. The HCS algorithm also demonstrates excellent convergence speed and stability, reflected in faster convergence curves and lower variance values. The proposed HCS algorithm combines the advantages of DE and CS, effectively solving the ED problem. Compared with other algorithms, it has advantages in optimization accuracy, convergence speed, and robustness.

Jiangxi Science and Technology Normal University (CN)
Openalex Percentile: Top 35%
Electric Power System Optimization
0.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.