Differential evolution algorithm based on successful history parameters

Differential Evolution (DE) is a straightforward yet powerful method for numerical optimization. The performance of the DE algorithm is greatly affected by its parameter configuration, as a result, a lot of research has been devoted to its adaptive parameter adjustment. In this work, we introduce a novel approach for adapting DE parameters, where the historical success of previous individuals is utilized to inform the generation of the next set of candidates, thereby improving the search for optimal solutions.. Predict and guide the generation of the next generation of individuals through the optimal individuals produced in the previous generation.We compare the proposed algorithms with some classic DE and its improved algorithms on the CEC2013 benchmark set. The experimental results show that the DE algorithm proposed by us based on historical successful individual prediction is highly competitive compared with the advanced DE algorithm..

Authors

Institutions

Publication Details

Published
2025-02-28
DOI
https://doi.org/10.1109/iccece65250.2025.10985485
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

Differential evolution algorithm based on successful history parameters

Kanghua Zhu, Jincheng Xu, Xiaobo Fan
Metaheuristic Optimization Algorithms Research
article

Differential evolution algorithm based on successful history parameters

Kanghua Zhu, Jincheng Xu, Xiaobo Fan
article en

Abstract

Differential Evolution (DE) is a straightforward yet powerful method for numerical optimization. The performance of the DE algorithm is greatly affected by its parameter configuration, as a result, a lot of research has been devoted to its adaptive parameter adjustment. In this work, we introduce a novel approach for adapting DE parameters, where the historical success of previous individuals is utilized to inform the generation of the next set of candidates, thereby improving the search for optimal solutions.. Predict and guide the generation of the next generation of individuals through the optimal individuals produced in the previous generation.We compare the proposed algorithms with some classic DE and its improved algorithms on the CEC2013 benchmark set. The experimental results show that the DE algorithm proposed by us based on historical successful individual prediction is highly competitive compared with the advanced DE algorithm..

Dongguan University of Technology (CN)
Openalex Percentile: Top 95%
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.