Table of Contents
Fetching ...

An Efficient Reconstructed Differential Evolution Variant by Some of the Current State-of-the-art Strategies for Solving Single Objective Bound Constrained Problems

Sichen Tao, Ruihan Zhao, Kaiyu Wang, Shangce Gao

TL;DR

RDE addresses bounded single-objective optimization by recombining proven DE components into a unified, adaptive framework. It integrates an external archive, DE/current-to-order-pbest/1 mutation, hybrid mutation strategies with adaptive allocation, extended rank-based selective pressure, success-history parameter adaptation, and linear reductions of p-value and population size, plus Cauchy perturbation. Evaluated on the 2024 CEC benchmark, RDE demonstrates strong performance across unimodal, multimodal, hybrid, and composition functions, often outperforming LSHADE-RSP, iLSHADE-RSP, HSES, EBO with CMAR, and LSHADE, especially on complex compositions. The work highlights how careful recombination of recent DE advances can produce robust, scalable solvers with practical impact on real-world bounded optimization tasks.

Abstract

Complex single-objective bounded problems are often difficult to solve. In evolutionary computation methods, since the proposal of differential evolution algorithm in 1997, it has been widely studied and developed due to its simplicity and efficiency. These developments include various adaptive strategies, operator improvements, and the introduction of other search methods. After 2014, research based on LSHADE has also been widely studied by researchers. However, although recently proposed improvement strategies have shown superiority over their previous generation's first performance, adding all new strategies may not necessarily bring the strongest performance. Therefore, we recombine some effective advances based on advanced differential evolution variants in recent years and finally determine an effective combination scheme to further promote the performance of differential evolution. In this paper, we propose a strategy recombination and reconstruction differential evolution algorithm called reconstructed differential evolution (RDE) to solve single-objective bounded optimization problems. Based on the benchmark suite of the 2024 IEEE Congress on Evolutionary Computation (CEC2024), we tested RDE and several other advanced differential evolution variants. The experimental results show that RDE has superior performance in solving complex optimization problems.

An Efficient Reconstructed Differential Evolution Variant by Some of the Current State-of-the-art Strategies for Solving Single Objective Bound Constrained Problems

TL;DR

RDE addresses bounded single-objective optimization by recombining proven DE components into a unified, adaptive framework. It integrates an external archive, DE/current-to-order-pbest/1 mutation, hybrid mutation strategies with adaptive allocation, extended rank-based selective pressure, success-history parameter adaptation, and linear reductions of p-value and population size, plus Cauchy perturbation. Evaluated on the 2024 CEC benchmark, RDE demonstrates strong performance across unimodal, multimodal, hybrid, and composition functions, often outperforming LSHADE-RSP, iLSHADE-RSP, HSES, EBO with CMAR, and LSHADE, especially on complex compositions. The work highlights how careful recombination of recent DE advances can produce robust, scalable solvers with practical impact on real-world bounded optimization tasks.

Abstract

Complex single-objective bounded problems are often difficult to solve. In evolutionary computation methods, since the proposal of differential evolution algorithm in 1997, it has been widely studied and developed due to its simplicity and efficiency. These developments include various adaptive strategies, operator improvements, and the introduction of other search methods. After 2014, research based on LSHADE has also been widely studied by researchers. However, although recently proposed improvement strategies have shown superiority over their previous generation's first performance, adding all new strategies may not necessarily bring the strongest performance. Therefore, we recombine some effective advances based on advanced differential evolution variants in recent years and finally determine an effective combination scheme to further promote the performance of differential evolution. In this paper, we propose a strategy recombination and reconstruction differential evolution algorithm called reconstructed differential evolution (RDE) to solve single-objective bounded optimization problems. Based on the benchmark suite of the 2024 IEEE Congress on Evolutionary Computation (CEC2024), we tested RDE and several other advanced differential evolution variants. The experimental results show that RDE has superior performance in solving complex optimization problems.
Paper Structure (20 sections, 22 equations, 2 tables, 1 algorithm)