In the crowded environment of bio-inspired population-based meta-heuristics, the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately gained a lot of momentum. Inspired by the peculiar spatial arrangement of salp colonies, which are displaced in long chains following a leader, this algorithm seems to provide interesting optimization performances. However, the original work was characterized by some conceptual and mathematical flaws, which influenced all ensuing papers on the subject. In this manuscript, we perform a critical review of SSO, highlighting all the issues present in the literature and their negative effects on the optimization process carried out by the algorithm. We also propose a mathematically correct version of SSO, named Amended Salp Swarm Optimizer (ASSO) that fixes all the discussed problems. Finally, we benchmark the performance of ASSO on a set of tailored experiments, showing it achieves better results than the original SSO.


    Access

    Download


    Export, share and cite



    Title :

    Salp Swarm Optimization:a Critical Review


    Contributors:

    Publication date :

    2021-06-01


    Remarks:

    Castelli , M , Manzoni , L , Mariot , L , Nobile , M S & Tangherloni , A 2021 , ' Salp Swarm Optimization : a Critical Review ' , arXiv , vol. 2021 , 2106.01900 . < https://arxiv.org/abs/2106.01900 >


    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    DDC:    629



    Solving Weapon-Target Assignment Problem with Salp Swarm Algorithm

    Avci, İsa / Yildirim, Mehmet | BASE | 2023

    Free access



    Enhancing Salp Swarm Optimization with Orthogonal Diagonalization Transformation for Damage Detection in Truss Bridge

    Tran, Hung Viet / Nguyen, Thanh Chi / Le, Thang Xuan et al. | Springer Verlag | 2024


    Three Dimensional Route Planning for Multiple Unmanned Aerial Vehicles using Salp Swarm Algorithm

    Saxena, Priyansh / Dewangan, Ram Kishan | ArXiv | 2019

    Free access