Salp Swarm Optimization: a Critical Review
In the crowded environment of bio-inspired population-based metaheuristics, 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, th...
Gespeichert in:
| Veröffentlicht in: | arXiv.org |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Paper |
| Sprache: | Englisch |
| Veröffentlicht: |
Ithaca
Cornell University Library, arXiv.org
06.11.2021
|
| Schlagworte: | |
| ISSN: | 2331-8422 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In the crowded environment of bio-inspired population-based metaheuristics, 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 an interesting optimization performance. 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 this algorithm. We also propose a mathematically correct version of SSO, named Amended Salp Swarm Optimizer (ASSO) that fixes all the discussed problems. We benchmarked the performance of ASSO on a set of tailored experiments, showing that it is able to achieve better results than the original SSO. Finally, we performed an extensive study aimed at understanding whether SSO and its variants provide advantages compared to other metaheuristics. The experimental results, where SSO cannot outperform simple well-known metaheuristics, suggest that the scientific community can safely abandon SSO. |
|---|---|
| AbstractList | In the crowded environment of bio-inspired population-based metaheuristics, 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 an interesting optimization performance. 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 this algorithm. We also propose a mathematically correct version of SSO, named Amended Salp Swarm Optimizer (ASSO) that fixes all the discussed problems. We benchmarked the performance of ASSO on a set of tailored experiments, showing that it is able to achieve better results than the original SSO. Finally, we performed an extensive study aimed at understanding whether SSO and its variants provide advantages compared to other metaheuristics. The experimental results, where SSO cannot outperform simple well-known metaheuristics, suggest that the scientific community can safely abandon SSO. |
| Author | Manzoni, Luca Nobile, Marco S Mariot, Luca Castelli, Mauro Tangherloni, Andrea |
| Author_xml | – sequence: 1 givenname: Mauro surname: Castelli fullname: Castelli, Mauro – sequence: 2 givenname: Luca surname: Manzoni fullname: Manzoni, Luca – sequence: 3 givenname: Luca surname: Mariot fullname: Mariot, Luca – sequence: 4 givenname: Marco surname: Nobile middlename: S fullname: Nobile, Marco S – sequence: 5 givenname: Andrea surname: Tangherloni fullname: Tangherloni, Andrea |
| BookMark | eNotj01Lw0AUABdRsNb-AG8Bb0Li2337srveJPgFhYLtvbwku7AlTWKStuKvt6Cnuc0wN-Ky7VovxJ2ETFsieOThOx4zJSHPQDqACzFTiDK1WqlrsRjHHQCo3CginImHNTd9sj7xsE9W_RT38Yen2LVPCSfFEKdYcZN8-mP0p1txFbgZ_eKfc7F5fdkU7-ly9fZRPC9TJoUpuhyDJGvI2UC2RsNUKw2mLEFbF2xdVqV3QKZyQQZNQaKvQ8mVZh2kxLm4_9P2Q_d18OO03XWHoT0Xt4rQnJ8sIv4CdLlD8w |
| ContentType | Paper |
| Copyright | 2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2106.01900 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a523-3963f1587598f58d37a5d2407bb0489f8dbcbe9057c9f1f45f13edfbac4a4f113 |
| IEDL.DBID | BENPR |
| IngestDate | Mon Jun 30 09:19:25 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a523-3963f1587598f58d37a5d2407bb0489f8dbcbe9057c9f1f45f13edfbac4a4f113 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2537019833?pq-origsite=%requestingapplication% |
| PQID | 2537019833 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2537019833 |
| PublicationCentury | 2000 |
| PublicationDate | 20211106 |
| PublicationDateYYYYMMDD | 2021-11-06 |
| PublicationDate_xml | – month: 11 year: 2021 text: 20211106 day: 06 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2021 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.7754269 |
| SecondaryResourceType | preprint |
| Snippet | In the crowded environment of bio-inspired population-based metaheuristics, the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Optimization |
| Title | Salp Swarm Optimization: a Critical Review |
| URI | https://www.proquest.com/docview/2537019833 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JSwMxFH7oVMGTOy61zMGTkLaZTCYTL4LSogfrYHuop5IVCnZxplZ_vsl0qgfBi8dHICQk-fL2D-CSGcwpYwJhqy2KjSZI8LZ2YqJMatwdUbokm2C9Xjoc8qxyuBVVWuUaE0ug1jPlfeStiBLfOTwl5Gb-hjxrlI-uVhQam1DzncriAGq3nV72_O1liRLmdGayCmeWzbtaIv8cL5vO0kmavo66_QuEy5-lu_vfNe1BLRNzk-_DhpkewHaZ0amKQ7jqi9d52P8Q-SR8crgwqQour0MRrvkNwlVk4AgG3c7g7h5VxAhIOLsREfdoLKbO0uCppakmTFDtLTMp3XvkNtVSScOdJqa4xTamFhOjrRQqFrHFmBxDMJ1NzQmEFmusBaNGSu4nSEliTeRQQAjGEm1Oob7e-ai63MXoZ9tnfw-fw07kU0C8FzapQ7DI380FbKnlYlzkjeqsGj7dsu-k7OExe_kCgRihjg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LTsJAFL1B0OjKd3ygdqEbkwLTaTsdE-NCJRAQSWDBrpnOIyGRgi2CfpT_6EyhujBxx8Jl02TS3Dlzep9zAC6JRNQjhNlICWW7UmCb0ZrQjz6XgdQY4SITmyCdTjAY0G4BPvNZGNNWmXNiRtRizE2OvOp42NwcHmB8N3m1jWqUqa7mEhoLWLTkx1yHbOlt80Hv75Xj1B_79w17qSpgMx102VgjTiFPu-k0UF4gMGGeMGFNFGkwUxWIiEeSajeGU4WU6ymEpVAR4y5zFUJYL7sGJdeQf9Yp2PtO6Tg-0Q46XtROs5vCqix5H84qOqzyK2Zou_aL8bPfWH37nxlgB0pdNpHJLhRkvAcbWbcqT_fhusdeJlZvzpKR9aw5b7QcJr2xmJVrN1iLqscB9FfxdYdQjMexPAJLIYEEI56MImoWCLCvpKMZjjFCfCGPoZwbOlwe3DT8sfLJ368vYLPRf2qH7WandQpbjml1MdlmvwzFafImz2Cdz6bDNDnPQGJBuOI9-QIe3_me |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Salp+Swarm+Optimization%3A+a+Critical+Review&rft.jtitle=arXiv.org&rft.au=Castelli%2C+Mauro&rft.au=Manzoni%2C+Luca&rft.au=Mariot%2C+Luca&rft.au=Nobile%2C+Marco+S&rft.date=2021-11-06&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2106.01900 |