A local optimal processing framework for differential evolution

Differential evolution (DE) algorithms often fall into local optimal, severely limiting the performance. Existing solutions fail to accurately detect stagnation and lead to false positives of stagnation, which makes it difficult to obtain diverse solutions. In response to the above challenges, this paper proposes a local optimal processing framework for DE (LOPFDE). LOPFDE intelligently determines the individual's current search status by sensing the individual's position in the search space. When an individual falls into a stagnant state, LOPFDE uses diversity-controlled candidate solutions or the individual's historical optimal values ​​to replace the stagnant individual to help the search get rid of the local optimal. Overall, LOPFDE provides a powerful framework for stagnant individuals to escape from the local optimum and opens up a new way for identifying stagnant individuals in DE. LOPFDE is integrated into six representative DE variants and compared with the original algorithm on the CEC 2019 test set. The results show that LOPFDE can be integrated into various DE algorithms and significantly improve their convergence speed and solution accuracy.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1145/3718491.3718516
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A local optimal processing framework for differential evolution

Ying Huang, Benben Zhou
Metaheuristic Optimization Algorithms Research
article

A local optimal processing framework for differential evolution

Ying Huang, Benben Zhou
article en

Abstract

Differential evolution (DE) algorithms often fall into local optimal, severely limiting the performance. Existing solutions fail to accurately detect stagnation and lead to false positives of stagnation, which makes it difficult to obtain diverse solutions. In response to the above challenges, this paper proposes a local optimal processing framework for DE (LOPFDE). LOPFDE intelligently determines the individual's current search status by sensing the individual's position in the search space. When an individual falls into a stagnant state, LOPFDE uses diversity-controlled candidate solutions or the individual's historical optimal values ​​to replace the stagnant individual to help the search get rid of the local optimal. Overall, LOPFDE provides a powerful framework for stagnant individuals to escape from the local optimum and opens up a new way for identifying stagnant individuals in DE. LOPFDE is integrated into six representative DE variants and compared with the original algorithm on the CEC 2019 test set. The results show that LOPFDE can be integrated into various DE algorithms and significantly improve their convergence speed and solution accuracy.

Gannan Normal University (CN)
Openalex Percentile: Top 74%
Metaheuristic Optimization Algorithms Research
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.