An Improved Grasshopper Optimization Algorithm for Global Optimization

• 作者: YAN Yan MA Hongzhong LI Zhendong
• 来源期刊: 电子学报（英文版）
• 年，卷（期）: 2021,（3）
• 所属期刊栏目: COMPUTERS AND MICROELECTRONICS
• 页码范围: 451-459
• 页数: 9页
• 语种: 英文
• DOI: 10.1049/cje.2021.03.008

摘要

We proposes an improved grasshopper algorithm for global optimization problems. Grasshopper optimization algorithm (GOA) is a recently proposed meta-heuristic algorithm inspired by the swarming behav-ior of grasshoppers. The original GOA has some drawbacks, such as slow convergence speed, easily falling into local optimum, and so on. To overcome these shortcomings, we proposes a grasshopper optimization algorithm based on a logistic Chaos maps opposition-based learning strategy and cloud model inertia weight (CCGOA). CCGOA is divided into three stages. The chaos opposition learning initialization strategy is used to initialize the population, so that the population can be evenly distributed in the feasible solution space as much as possible, so as to improve the uniformity and diversity of the initial population distribution of the grasshopper algorithm. The inertia weight cloud model is introduced into the grasshopper algorithm, and different inertia weight strategies are used to adjust the convergence speed of the algorithm. Based on the principle of chaotic logistic maps, local depth search is carried out to reduce the probability of falling into local optimum. Fourteen benchmark functions and an engineering example are used for simulation verification. Experimental results show that the proposed CCGOA algorithm has superior performance in determining the optimal solution of the test function problem.