Abstract

The sine cosine algorithm (SCA) is a recently developed meta-heuristic algorithm for solving global optimization problems. It has shown excellent performance in meta-heuristic algorithms. But this algorithm also has shortcomings such as low accuracy, easy to fall into a local solution, and slow convergence speed. Aiming at these deficiencies of the SCA, a modified sine cosine algorithm with teacher supervision learning (TSL-SCA) for global optimization is proposed. First, the teacher supervision strategy can guide the population convergence and accelerate the convergence speed. Second, individuals perform reflective learning after the standard SCA position is updated, which can effectively prevent individuals from stagnating in the evolutionary process and increase population diversity. In addition, a hybrid inverse learning method is proposed. It can not only enhance the ability of finding global optimal solution and increase population distributivity, but also balance the exploration and exploitation capabilities. Differential evolution algorithm (DE), particle swarm optimization (PSO), cuckoo search (CS) algorithm, moth-flame optimization (MFO), whale optimization algorithm (WOA), Teaching-Learning-Based Optimization (TLBO), SCA and TSL-SCA are selected for simulation experiment to solve 33 benchmark optimization problems. The experimental results show that the TSL-SCA can significantly enhance the optimization accuracy and convergence speed. Furthermore, the effectiveness of the proposed method is examined by solving analog circuit fault diagnosis of filter circuit examples.

Highlights

  • Optimization problems exist widely in all domains of scientific research and engineering application

  • The results show that expect for the function F6 and F7 on which the TSL-sine cosine algorithm (SCA) is second to the cuckoo search (CS) algorithm, the proposed method always has the best performance on the unimodal functions F1-F10

  • A modified sine cosine algorithm based on teacher supervision learning for global optimization problems is proposed in this article

Read more

Summary

INTRODUCTION

Optimization problems exist widely in all domains of scientific research and engineering application. Population-based algorithms use sets of solutions instead of considering the advantages of individual solutions It improves the diversity of solutions in the search space and avoids falling into local optimal solutions. Swarm optimization algorithm, such as PSO [6] is a random search algorithm by simulating the foraging behavior of birds. Experiments show the competitive performance of SCA over other meta-heuristic search algorithms such as PSO, GA, GSA, etc It has problems of low convergence accuracy and easy to fall into local optimal solutions. Gupta et al [48] proposed some improvements to the SCA They used nonlinear transition parameters to enhance exploration capabilities, greedy search to keep the optimal solution, and Gaussian mutation operators to avoid falling into local optimal solutions in the search process. Some researchers combined the SCA with other swarm intelligence algorithms to improve the overall performance

MATHEMATICAL MODEL OF SCA
13: Boundary check and Selection
TEACHER SUPERVISION STRATEGY
REFLECTIVE LEARNING
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call