EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2878. ILSHADE-SPACMA: Improved version of LSHADE-SPACMA
Invited abstract in session WC-52: Heuristic Algorithms for Combinatorial Optimization Problems I (Contributed), stream Combinatorial Optimization.
Wednesday, 12:30-14:00Room: 8003 (building: 202)
Authors (first author is the speaker)
| 1. | Abdelazim Hussien
|
| 2. | Adrian Pop
|
| Linkoping University | |
| 3. | Fatma Hashim
|
| Helwan university |
Abstract
LSHADE-SPACMA stands out as a highly potent algorithm, amalgamating a refined version of LSHADE with a modified version of CMA-ES. In this study, we endeavor to augment the exploratory capability of LSHADE by incorporating a transfer operator. Additionally, an alternative mutation strategy is introduced to enhance overall diversity. The proposed optimizer, dubbed ILSHADE-SPACMA, undergoes a rigorous comparison with both the original LSHADE-SPACMA algorithm and LSHADE across 12 functions sourced from CEC2022. These experiments are conducted with varying numbers of evaluations—50,000 and 100,1000—while dimensions are set to 10 and 20. The results underscore the robustness of ILSHADE-SPACMA in swiftly converging towards near-optimal solutions within acceptable timeframes.
Keywords
- Algorithms
- Continuous Optimization
Status: accepted
Back to the list of papers