An Enhanced Symbiotic Organism Search Algorithm (ESOS) for the Sizing Design of Pin Connected Structures
The symbiotic organism search (SOS) algorithm is a strong metaheuristic search engine with a great explorative capability which enables it to search for global optima efficiently. Nevertheless, its exploitive ability is less profound leading to a relatively low rate of convergence. In the current pa...
Gespeichert in:
Veröffentlicht in: | Iranian journal of science and technology. Transactions of civil engineering 2021-09, Vol.45 (3), p.1371-1396 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The symbiotic organism search (SOS) algorithm is a strong metaheuristic search engine with a great explorative capability which enables it to search for global optima efficiently. Nevertheless, its exploitive ability is less profound leading to a relatively low rate of convergence. In the current paper, an enhanced symbiotic organism search (ESOS) algorithm with the aim of improving the exploitive capability of the SOS algorithm is presented. The enhancements are done in the commensalism and mutualism phases of the algorithm. In the current study, a multi-ecosystem mechanism is also employed. The presented ESOS algorithm is used along with two different constraint handling methods, namely mapping strategy (MS) and penalty function (PF). This leads to two variants of the ESOS, termed as ESOS-MS and ESOS-PF. The two presented ESOS variants are utilized to optimize the weight of four benchmark truss structures. The results are compared with the optimal designs reported in the literature. The results demonstrate that the proposed ESOS variants not only can find better solutions compared to the other algorithms, but also are faster in doing so. Moreover, of the two presented ESOS variants, the ESOS-MS variant performs much better than the ESOS-PF variant. |
---|---|
ISSN: | 2228-6160 2364-1843 |
DOI: | 10.1007/s40996-020-00471-0 |