Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems

Shikha Mehta ()
Additional contact information
Shikha Mehta: Jaypee Institute of Information Technology

Journal of Combinatorial Optimization, 2024, vol. 47, issue 2, No 5, 38 pages

Abstract: Abstract Shuffled Frog leaping algorithm (SFLA) is a multi population swarm intelligence algorithm which employs population partitioning techniques during the evolutionary stage. Methods adopted by SFLA for partitioning the population into memeplexes play a critical role in determining its ability to solve complex optimization problems. However, limited research is done in this direction. This work presents supervised machine learning based methods Spectral Partitioning (SCP), Agglomerative Partitioning (AGP) and Ward Hierarchical Partitioning (WHP) for distributing the solutions into memeplexes. The efficacy of variants of SFLA with these methods is assessed over CEC2015 Bound Constrained Single-Objective Computationally Expensive Numerical Optimisation problems. Analysis of results establishes that proposed SCP, AGP and WHP methods outperform Shuffled complex evolution (SCE) partitioning technique; Seed and distance based partitioning technique (SEED), Random partitioning (RAND) and Dynamic sub-swarm partitioning (DNS) for more than 10 functions. Time complexity of all the algorithms is comparable with each other. Statistical analysis using Wilcoxon signed rank sum test indicates that SCP, AGP and WHP perform significantly better than existing approaches for small dimensions.

Keywords: Population partitioning algorithms; Multi population methods; SFLA; Swarm intelligence; Computationally expensive problems; CEC2015 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01102-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-023-01102-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01102-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().