Sine Cosine Algorithm (SCA) is a recent meta-heuristic algorithm inspired by the proprieties of trigonometric sine and cosine functions. Since its introduction by Mirjalili in 2016, SCA has attracted great attention from researchers and has been widely used to solve different optimization problems in several fields. This attention is due to its reasonable execution time, good convergence acceleration rate, and high efficiency compared to several well-regarded optimization algorithms available in the literature. This paper presents a brief overview of the basic SCA and its variants divided into modified, multi-objective, and hybridized versions. Furthermore, the applications of SCA in several domains such as classification, image processing, robot path planning, scheduling, radial distribution networks, and other engineering problems are described. Finally, the paper recommended some potential future research directions for SCA.

/pdf/a-comprehensive-survey-of-sine-cosine-algorithm-variants-and-3bok576c3n.pdf

A comprehensive survey of sine cosine algorithm: variants and applications

Wave profile analysis of a couple of (3+1)-dimensional nonlinear evolution equations by sine-Gordon expansion approach

Sine cosine algorithm (SCA) is a new meta-heuristic approach suggested in recent years, which repeats some random steps by choosing the sine or cosine functions to find the global optimum. SCA has shown strong patterns of randomness in its searching styles. At the later stage of the algorithm, the drop of diversity of the population leads to locally oriented optimization and lazy convergence when dealing with complex problems. Therefore, this paper proposes an enriched SCA (ASCA) based on the adaptive parameters and chaotic exploitative strategy to alleviate these shortcomings. Two mechanisms are introduced into the original SCA. First, an adaptive transformation parameter is proposed to make transformation more flexible between global search and local exploitation. Then, the chaotic local search is added to augment the local searching patterns of the algorithm. The effectiveness of the ASCA is validated on a set of benchmark functions, including unimodal, multimodal, and composition functions by comparing it with several well-known and advanced meta-heuristics. Simulation results have demonstrated the significant superiority of the ASCA over other peers. Moreover, three engineering design cases are employed to study the advantage of ASCA when solving constrained optimization tasks. The experimental results have shown that the improvement of ASCA is beneficial and performs better than other methods in solving these types of problems.

/pdf/an-adaptive-chaotic-sine-cosine-algorithm-for-constrained-15rhuqco9o.pdf

An Adaptive Chaotic Sine Cosine Algorithm for Constrained and Unconstrained Optimization

Path planning is one of the hotspots in the research of automotive engineering. Aiming at the issue of robot path planning with the goal of finding a collision-free optimal motion path in an environment with barriers, this study proposes an adaptive parallel arithmetic optimization algorithm (APAOA) with a novel parallel communication strategy. Comparisons with other popular algorithms on 18 benchmark functions are committed. Experimental results show that the proposed algorithm performs better in terms of solution accuracy and convergence speed, and the proposed strategy can prevent the algorithm from falling into a local optimal solution. Finally, we apply APAOA to solve the problem of robot path planning.

/pdf/an-adaptive-parallel-arithmetic-optimization-algorithm-for-g94v7wssy2.pdf

An Adaptive Parallel Arithmetic Optimization Algorithm for Robot Path Planning

Proportional Integral Derivative (PID) controller is one of the most classical controllers, which has a good performance in industrial applications. The traditional PID parameter tuning relies on experience, however, the intelligent algorithm is used to optimize the controller, which makes it more convenient. Fish Migration Optimization (FMO) is an excellent algorithm that mimics the swim and migration behaviors of fish biology. Especially, the formulas for optimization were obtained from biologists. However, the optimization effect of FMO for PID control is not prominent, since it is easy to skip the optimal solution with integer-order velocity. In order to improve the optimization performance of FMO, Fractional-Order Fish Migration Optimization (FOFMO) is proposed based on fractional calculus (FC) theory. In FOFMO, the velocity and position are updated in fractional-order forms. In addition, the fishes should migration back to a position which is more conducive to survival. Therefore, a new strategy based on the global best solution to generate new positions of offsprings is proposed. The experiments are performed on benchmark functions and PID controller. The results show that FOFMO is superior to the original FMO, and the PID controller tuned by FOFMO is more robust and has better performance than other contrast algorithms.

/pdf/optimal-design-and-simulation-for-pid-controller-using-428a2gmt8o.pdf

Optimal Design and Simulation for PID Controller Using Fractional-Order Fish Migration Optimization Algorithm

Sine Cosine Algorithm (SCA) has been proved to be superior to some existing traditional optimization algorithms owing to its unique optimization principle. However, there are still disadvantages such as low solution accuracy and poor global search ability. Aiming at the shortcomings of the sine cosine algorithm, a multigroup multistrategy SCA algorithm (MMSCA) is proposed in this paper. The algorithm executes multiple populations in parallel, and each population executes a different optimization strategy. Information is exchanged among populations through intergenerational communication. Using 19 different types of test functions, the optimization performance of the algorithm is tested. Numerical experimental results show that the performance of the MMSCA algorithm is better than that of the original SCA algorithm, and it also has some advantages over other intelligent algorithms. At last, it is applied to solving the capacitated vehicle routing problem (CVRP) in transportation. The algorithm can get better results, and the practicability and feasibility of the algorithm are also proved.

https://downloads.hindawi.com/journals/mpe/2020/8184254.pdf

Sine Cosine Algorithm with Multigroup and Multistrategy for Solving CVRP

This paper studies the problem of intelligence optimization, a fundamental problem in analyzing the optimal solution in a wide spectrum of applications such as transportation and wireless sensor network (WSN). To achieve better optimization capability, we propose a multigroup Multistrategy Compact Sine Cosine Algorithm (MCSCA) by using the compact strategy and grouping strategy, which makes the initialized randomly generated value no longer an individual in the population and avoids falling into the local optimum. New evolution formulas are proposed for the intergroup communication strategy. Performance studies on the CEC2013 benchmark demonstrate the effectiveness of our new approach regarding convergence speed and accuracy. Finally, we apply MCSCA to solve the dispatch system of public transit vehicles. Experimental results show that MCSCA can achieve better optimization.

/pdf/compact-sine-cosine-algorithm-with-multigroup-and-2i46h5upi8.pdf

Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles

The unmanned aerial vehicle (UAV) path planning problem is primarily concerned with avoiding collision with obstacles while determining the best flight path to the target position. This paper first establishes a cost function to transform the UAV route planning issue into an optimization issue that meets the UAV’s feasible path requirements and path safety constraints. Then, this paper introduces a modified Mayfly Algorithm (modMA), which employs an exponent decreasing inertia weight (EDIW) strategy, adaptive Cauchy mutation, and an enhanced crossover operator to effectively search the UAV configuration space and discover the path with the lowest overall cost. Finally, the proposed modMA is evaluated on 26 benchmark functions as well as the UAV route planning problem, and the results demonstrate that it outperforms the other compared algorithms.

/pdf/modified-mayfly-algorithm-for-uav-path-planning-1w77iwx8.pdf

Modified Mayfly Algorithm for UAV Path Planning

All along, people have a high enthusiasm for the research of optimization algorithm. A large number of new algorithms and methods have emerged. The sine cosine algorithm (SCA) is an excellent algorithm that has appeared in recent years. It is a stochastic optimization algorithm based on population. Compared with the existing algorithms, SCA is a suitable solution to different optimization problems, especially the optimization of unimodal functions. It is qualified to optimize real-world problems with unknown and limited search space. But sometimes it does not perform satisfactorily when dealing with some specific problems, such as optimization of multimodal functions or composite functions. This paper presents a parallel version of the sine cosine algorithm (PSCA) with three communication strategies. Different strategies can be selected according to the type of optimization function to achieve better results. We have repeatedly tested different types of functions, and the results show that the proposed PSCA can solve the optimization problem more specifically. In the simulation of wireless sensor network (WSN) dynamic deployment optimization, it is found that using this method can get the ideal sensor node distribution, which makes PSCA’s performance in solving other practical problems worth looking forward to.

/pdf/parallel-sine-cosine-algorithm-for-the-dynamic-deployment-in-3dds4irkt5.pdf

Parallel sine cosine algorithm for the dynamic deployment in wireless sensor networks

The localization problem of nodes in wireless sensor networks is often the focus of many researches. This paper proposes an opposition-based learning and parallel strategies Artificial Gorilla Troop Optimizer (OPGTO) for reducing the localization error. Opposition-based learning can expand the exploration space of the algorithm and significantly improve the global exploration ability of the algorithm. The parallel strategy divides the population into multiple groups for exploration, which effectively increases the diversity of the population. Based on this parallel strategy, we design communication strategies between groups for different types of optimization problems. To verify the optimized effect of the proposed OPGTO algorithm, it is tested on the CEC2013 benchmark function set and compared with Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Whale Optimization Algorithm (WOA) and Artificial Gorilla Troops Optimizer (GTO). Experimental studies show that OPGTO has good optimization ability, especially on complex multimodal functions and combinatorial functions. Finally, we apply OPGTO algorithm to 3D localization of wireless sensor networks in the real terrain. Experimental results proved that OPGTO can effectively reduce the localization error based on Time Difference of Arrival (TDOA).

/pdf/multi-group-gorilla-troops-optimizer-with-multi-strategies-puqp46t2.pdf

Qingyong Yang

Papers

Sine Cosine Algorithm with Multigroup and Multistrategy for Solving CVRP

Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles

Modified Mayfly Algorithm for UAV Path Planning

Parallel sine cosine algorithm for the dynamic deployment in wireless sensor networks

Multi-Group Gorilla Troops Optimizer with Multi-Strategies for 3D Node Localization of Wireless Sensor Networks