ALSHADE-jSO Algorithm Solving the GNBG-II Test Suite
This paper presents an extended abstract describing an entry into the GNBG-II benchmarking competition. We propose a hybrid variant of the differential evolution (DE) algorithm based on the added properties of ALSHADE and jSO, named ALSHADE-jSO. This algorithm uses the current-to-Amean/1 mutation strategy inspired by ALSHADE and the weighted mean strategy inspired by jSO to generate new solutions. A selection strategy inspired by ALSHADE, SHADE-based parameter adjustments, and linear population size reduction (LPSR) mechanism of LSHADE are added for better exploration and exploitation operations. The results show that for 9 out of 24 problem instances, ALSHADE-jSO gives a success rate of 100% and is capable of achieving a global solution for 15 problems.
Authors
- Amanjot Kaur Lamba (ORCID: https://orcid.org/0000-0003-1978-8283)
- Reshu Chaudhary (ORCID: https://orcid.org/0000-0002-6006-4706)
- Rohit Salgotra (ORCID: https://orcid.org/0000-0002-3282-1810)
- Pooja Verma
Institutions
- University of Technology Sydney (AU)
- University of Jammu (IN)
- Bennett University (IN)
- AGH University of Krakow (PL)
- Punjab Engineering College (IN)
Publication Details
- Journal
- Proceedings of the Genetic and Evolutionary Computation Conference Companion
- Published
- 2025-07-14
- DOI
- https://doi.org/10.1145/3712255.3735094
- Primary Topic
- Numerical Methods and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00