arrow
Return

Differential evolution with exponential crossover: A survey

delete2026-04-28
delete0
PRE
AI
J
Jeng‐Shyang Pan
J
Junpeng Chen
J
Juncan Li
Z
Zhenyu Meng *
DOI:10.1016/j.cosrev.2026.100990delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Differential Evolution (DE) employs two primary crossover strategies: binomial crossover and exponential crossover. Most DE researchers consider variants with binomial crossover to be more effective for numerical optimization problems, while those with exponential crossover are better suited for problems with strong correlations between adjacent variables. However, recent studies have shown that, with appropriate tuning of the crossover rate CR and related control parameters, DE variants employing exponential crossover can outperform those using binomial crossover. Despite this promise, exponential crossover remains underexplored relative to binomial crossover in the DE literature. To address this gap, this paper presents a comprehensive review of DE variants employing exponential crossover. First, the behavioral characteristics of exponential crossover and binomial crossover are analyzed to enhance the understanding of these two crossover methods. Second, a classification framework is proposed to guide future research, dividing existing methods into three categories: traditional exponential crossover DE, improved exponential crossover DE, and hybrid crossover DE. Additionally, four advanced DE algorithms with exponential crossover and four advanced DE algorithms with binomial crossover are selected for comparative evaluation. Finally, the study summarizes the applications of exponential crossover DE across various domains and discusses key challenges and potential future directions. This review aims to draw greater attention to exponential crossover within the DE community, promoting further research and practical applications of related algorithms.
Keywords:
Differential Evolution
Exponential Crossover
Binomial Crossover
Numerical Optimization
Metaheuristic Algorithms

Journal

Computer Science Review cover
Computer Science Review
IF:
12.7
Papers:
2.3K
Citations:
5.2K

Organization

Y
Yango University
Scholars:
43
Papers: 34
Citations: 154
F
fujian university of technology
Scholars:
714
Papers: 274
Citations: 0