A new fusion of salp swarm with sine cosine for optimization of non-linear functions

The foremost objective of this article is to develop a novel hybrid powerful meta-heuristic that integrates the salp swarm algorithm with sine cosine algorithm (called HSSASCA) for improving the convergence performance with the exploration and exploitation being superior to other comparative standar...

Full description

Saved in:
Bibliographic Details
Published inEngineering with computers Vol. 36; no. 1; pp. 185 - 212
Main Authors Singh, Narinder, Son, Le Hoang, Chiclana, Francisco, Magnot, Jean-Pierre
Format Journal Article
LanguageEnglish
Published London Springer London 2020
Springer Nature B.V
Springer Verlag
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The foremost objective of this article is to develop a novel hybrid powerful meta-heuristic that integrates the salp swarm algorithm with sine cosine algorithm (called HSSASCA) for improving the convergence performance with the exploration and exploitation being superior to other comparative standard algorithms. In this method, the position of salp swarm in the search space is updated using the position equations of sine cosine; hence the best and possible optimal solutions are obtained based on the sine or cosine function. During this process, each salp adopts the information sharing strategy of sine and cosine functions to improve their exploration and exploitation ability. The inspiration behind incorporating changes in salp swarm optimizer algorithm is to assist the basic approach to avoid premature convergence and to rapidly guide the search towards the probable search space. The algorithm is validated on 22 standard mathematical optimization functions and 3 applications namely the 3-bar truss, tension/compression spring and cantilever beam design problems. The aim is to examine and confirm the valuable behaviors of HSSASCA in searching the best solutions for optimization functions. The experimental results reveal that HSSASCA algorithm achieves the highest accuracies with least runtime in comparison with the others.
ISSN:0177-0667
1435-5663
DOI:10.1007/s00366-018-00696-8