Enhancing Differential Evolution Algorithm: Adaptation for CEC 2017 and CEC 2021 Test Suites

No Thumbnail Available
File version
Author(s)
Salgotra, R
Mirjalili, S
Gandomi, AH
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2022
Size
File type(s)
Location

Toronto, Canada

License
Abstract

Differential evolution (DE) has proved its significance for optimizing various real-world applications and standard benchmarks. In this work, a self-adaptive version of DE is proposed namely LSHADESPA by employing three major modifications, i) proportional shrinking population mechanism for reducing computational burden, ii) simulated annealing-based scaling factor (F) for improving the exploration properties, and iii) oscillating inertia weight-based crossover rate (CR) for a balancing exploitation and exploration. The proposed algorithm has been experimentally tested on IEEE CEC 2017 and IEEE CEC 2021 benchmarks. For performance evaluation, a comparison with respect to JADE, SaDE, SHADE, LSHADE, MVMO, and others has been performed. Experimental and statistical results affirm the superior performance of the proposed LSHADESPA algorithms with respect to other algorithms.

Journal Title
Conference Title

2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Machine learning

Evolutionary computation

Persistent link to this record
Citation

Salgotra, R; Mirjalili, S; Gandomi, AH, Enhancing Differential Evolution Algorithm: Adaptation for CEC 2017 and CEC 2021 Test Suites, 2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI), 2022, pp. 235-240