Sine Cosine Algorithm for Elite Individual Collaborative Search and Its Application in Mechanical Optimization Designs

Abstract

To address the shortcomings of the sine cosine algorithm such as the low search accuracy, slow convergence speed, and easily falling into local optimality, a sine cosine algorithm for elite individual collaborative search was proposed. Firstly, tent chaotic mapping was used to initialize the population and the hyperbolic tangent function was applied non-linearly to adjust the parameters of the sine cosine algorithm, which enhanced the uniformity of population distribution and balanced the global exploration and local exploitation ability. Secondly, the search method of the sine cosine algorithm was improved by combining the search strategy of the sine cosine algorithm, the m-neighborhood locally optimal individual-guided search strategy, and the global optimal individual-guided search strategy, and, then, the three search strategies were executed alternately, which achieved collaboration, improved the convergence accuracy, and prevented the algorithm from falling into local optima. Finally, a greedy selection strategy was employed to select the best individuals for the population, which accelerated the convergence speed of the sine cosine algorithm. The simulation results illustrated that the sine cosine algorithm for elite individual collaborative search demonstrated a better optimization performance than the sine cosine algorithm, the other improved sine cosine algorithms, the other chaos-based algorithms, and other intelligent optimization algorithms. In addition, the feasibility and applicability of the sine cosine algorithm for elite individual collaborative search were further demonstrated by two mechanical optimization design experiments.

Keywords

• swarm intelligence
• sine cosine algorithm
• tent chaotic mapping
• nonlinearity
• elite individual
• optimization problem