An Overview of Self-Adaptive Differential Evolution Algorithms with Mutation Strategy

Abstract

Differential Evolution (DE) is a widely used global searching algorithm that solves realworld optimization problems. It is categorized as a stochastic parameter optimization method that has a broad spectrum of applications, notably neural networks, logistics, scheduling, and modeling. In practice, different optimization issues need different parameter settings. Due to DE simplicity, ease of implementation, and dependability, many scientists were interested in examining this algorithm. Nonetheless, the quality of DE and its variations are directly influenced by different mutation techniques and control parameter settings. In this paper, an overview and analogy of some algorithms that employ different mutation techniques will be illustrated. Additionally, a novel strategy that uses different mutation methods is proposed and compared with some existing strategies.