Rationalized Sine Cosine Optimization With Efficient Searching Patterns

Abstract

Even with the advantages of the sine cosine algorithm (SCA) in solving multimodal problems, there are some shortcomings for this method. We observe that the random patterns utilized in SCA cause an increasing attraction toward local optima. This study developed a rationalized version of this technique to deal with several representative benchmark cases with different dimensions. The improved algorithm combines the chaotic local search mechanism and Lévy flight operator with the core trends of SCA. The new variant is named as CLSCA. The Lévy flight with long jumps is adopted to boost the exploratory tendencies of the algorithm, while the chaotic local search mechanism is used as a local search for the destination point, which helps to further enhance the exploitation capability of SCA. Therefore, a suitable equilibrium between the exploration and exploitation can be kept in the CLSCA by two embedded patterns. To investigate the effectiveness and strength of the developed method, the CLSCA was tested on many benchmark functions, including different types of tasks such as single modal, multi-modal, hybrid, and composition functions. We compare the CLSCA with well-known optimizers, like particle swarm optimization (PSO) algorithm, grey wolf optimizer (GWO), SCA with differential evolution (SCADE), opposition-based SCA (OBSCA), fuzzy self-tuning PSO (FST_PSO), chaotic salp swarm algorithm (CSSA), and Chaotic whale optimizer (CWOA). Numerical experimental results demonstrate that the exploratory and exploitative properties of the classical SCA are clearly improved. The experimental results also show that our improved CLSCA is a better technique for different kinds of optimization tasks. INDEX TERMS Sine cosine algorithm, optimization, chaotic local search, Lévy flight.

Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts

“…One point is so critical in the verification of computational intelligence methods, and it is the detailed report of the used parameters for a fair, justifiable comparative analysis and the same conditions of test (Hao Chen, Ali Asghar Heidari, Huiling Shi, et al, 2018;Shi, Wang, Zhong, Tang, & Cheng, 2020). This matter is to ensure the results of any kind of algorithm are gathered in the same condition and with no bias toward any specific method that used a better testing condition, as it followed by reference literature as well (Fan, et al, 2020;Huang, et al, 2020;Ni, et al, 2020;Silu Zhang, et al, 2018).…”

An Adaptive Chaotic Sine Cosine Algorithm for Constrained and Unconstrained Optimization

“…e MSCA is dependent upon LF distribution and adaptive operators for enhancing the searching capabilities of the basic SCA. Huang et al [68] proposed a new, improved SCA called CLSCA. e improved algorithm combines a chaotic local search (CLS) mechanism and an LF operator.…”

Hybrid Sine Cosine and Fitness Dependent Optimizer for Global Optimization

“…Nature-inspired algorithms include particle swarm optimization (PSO) [1], differential evaluation (DE) [2] and genetic algorithm (GA) [3]. Some of the recent nature-inspired algorithms are sine cosine algorithm (SCA) [4] [5], fitness dependent optimizer (FDO) [6], wingsuit flying search (WFS) [7], whale optimization algorithm (WOA) [8] [9], butterfly optimization algorithm (BOA) [10] [11], dragonfly algorithm (DA) [12] [13], grey wolf optimizer (GWO) [14], moth-flame optimization algorithm (MFO) [15]- [18], root-based VOLUME XX, 2017 1 optimization algorithm [19], coot algorithm [20] and colony predation algorithm [21]. This paper focuses on the fitness-dependent optimizer (FDO) proposed by Abdullah and Rashid [6].…”