Multi-core sine cosine optimization: Methods and inclusive analysis

Abstract

The Sine Cosine Algorithm (SCA) is a popular population-based optimization method, which has shown competitive results compared to other algorithms, and it has been utilized to tackle optimization cases in various domains. Despite popularity, the initial SCA suffers from minimalistic originality, mediocre performance, and shallow mathematical model. In fact, there is undoubtedly room for improvement in the structure of original SCA because it may face problems of lazy convergence and inertia to local optima. To relieve these drawbacks, this paper develops a new multi-core SCA named SGLSCA, which is combined with three strategies based on the patterns of Salp Swarm Algorithm (SSA), Grey Wolf Optimizer (GWO), and Levy flight (LF). Based on introducing the updating strategy of SSA and GWO, it is proposed to strengthen the exploration aptitude of the conventional SCA. Also, the SSA updating strategy aims to further update the population based on the best solution of SCA, while the GWO updating plan helps using the top three solutions of SCA. Also, the LF strategy is embedded to achieve the random individual walk during the history of the exploration and further augment the competence of SCA to avoid local optimal solutions. To substantiate the structure and results of the proposed multi-core SCA, which is entitled SGLSCA, it is compared against nine state-of-art algorithms, six improved SCA variants, and nine successful advanced algorithms on 34 benchmark functions selected from 23 benchmark functions and 30 IEEE CEC 2014 benchmark problems. Additionally, three practical, real-world engineering problems are considered. The final experimental results expose that the multi-core SGLSCA outperforms other optimizers including LSHADE-cnEpSin and LSHADE methods in terms of both convergence and optimality of solutions. A public repository will support this research at http://aliasgharheidari.com for future works and possible guidance.