Skip to content
Review Open access

Population size reduction methods in differential evolution: a comprehensive review and experimental analysis

Oct 2026 · Artificial Intelligence Review · 0 citations

TL;DR

An overview of the population size reduction methods is offered, but also a comparative analysis of selected methods by integrating them into the state-of-the-art algorithm and performing experimental work on the CEC 2024 benchmark functions and two real-world problems are offered.

Abstract

Optimization plays a crucial role in modern engineering and science. Evolutionary computing techniques are a branch of artificial intelligence (AI) and have attracted a lot of attention recently. Scientists, engineers, and practitioners need to understand how evolutionary computing techniques work and be fluent in using AI-based optimization techniques to solve engineering optimization problems. The Differential Evolution (DE) algorithm, which is classified as a population-based evolutionary algorithm, is primarily intended for solving complex optimization problems. The original DE algorithm uses a fixed population size, whereas modern DE variants adopt advanced strategies for reducing the population size over the evolution process. In this review article, 204 studies are included and we offer not only an overview of the population size reduction methods, but also a comparative analysis of selected methods by integrating them into the state-of-the-art algorithm and performing experimental work on the CEC 2024 benchmark functions and two real-world problems. Benchmarking demonstrates that the choice of population size adjustment strategy affects optimization performance, with its effectiveness depending on the problem characteristics and dimensionality. According to the Friedman test applied to 15 methods, 10 non-linear population size reduction methods were ranked higher than the linear population size reduction method on 100-dimensional problems. Moreover, a non-linear population size reduction method achieved the top rank on both real-world optimization problems. However, no single population size adjustment strategy consistently dominates across all problem dimensions and function families.

Read PDF

Similar papers

Open access Oct 2026

Comparative Analysis among Evolutionary Optimization Methods: Genetic Algorithms, Particle Swarm Optimization and Differential Evolution

Since the emergence of Genetic Algorithms to solve optimization problems, a wide variety of evolutionary methods have been proposed and their applications have diversified across virtually all fields of knowledge. This paper presents a comparative analysis among three of the most widely applied evolutionary methods: Ge...

N. A. Rodriguez-Guzman, Aurelio Dominguez-Gonzalez, I. A. Espinoza-Vizcaino et al. · 0 citations
Review Open access Oct 2026

The Evolution of Metaheuristic Optimization Algorithms: Structures, Inspirations, and Research Trends

This systematic review presents a comprehensive analysis of metaheuristic optimization algorithms based on 515 distinct metaheuristic optimization algorithms and analyzes the historical evolution, inspiration diversity, search structures, symmetry-oriented search balance, and development trends of modern metaheuristics...

Ebubekir Kaya, Harun Akbulut, Ceren Baştemur Kaya et al. · 0 citations
#generative ai Open access Sep 2026

An adaptive multi-objective differential evolution algorithm to fine-tune the constructive cost model constants for software effort estimation

This paper includes new mutation techniques with a Pareto-based differential evolution algorithm, leveraging Generative AI to increase candidate solution diversity and a non-dominated sorting technique to lower the computational complexity involved in Pareto dominance.

Sunil Kumar Gouda, S. Ramasubbareddy, Kumar Surjeet Chaudhury et al. · 0 citations
Open access Sep 2026

A Bio-Inspired Flea Optimization Framework: Performance Analysis on Benchmark Functions and Medical Diagnostic Datasets

The experimental results show that FOA possesses competitive convergence characteristics and significantly outperforms most comparable algorithms in addressing the concerned optimization problems, and in the feature optimization and classification problems, the FOA-LASSO scheme consistently obtained higher classificati...

Muhammad Yasir, J. Khan · 0 citations
Open access Oct 2026

Region-Focused Evolutionary Search for Dynamic Multi-Objective Optimization

The growing requirements of solving dynamic multi-objective optimization problems (DMOPs) have increased the need to design dynamic multi-objective evolutionary algorithms (DMOEAs). As a powerful tool for solving DMOPs, DMOEAs based on prediction mechanisms have attracted more and more attention. However, limited effor...

Ying-Bo Xie, Jun-Fei Qiao, Ding Wang et al. · 0 citations
Nov 2026

Generation of software test cases using hybridization of grey wolf optimizer and artificial bee colony algorithm

Automated test case generation (ATCG) is a crucial task in the process of software testing. It aims to reduce the overall time required for manual testing and minimize total overhead. Evolutionary algorithms (EAs) in software testing are problem-specific applications explored by a few researchers but remain underutiliz...

Ruchika Malhotra, Shivani Pandey · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.