A Multi-strategy Improved Grasshopper Optimization Algorithm for Solving Global Optimization and Engineering Problems

Abstract

Abstract This paper presents a multi-strategy improved grasshopper optimization algorithm (MSIGOA), which aims to address the shortcomings of the grasshopper optimization algorithm (GOA), including its slow convergence, vulnerability to trapping into local optima, and low accuracy. Firstly, to improve the uniformity of the population distribution in the search space, the MSIGOA uses circle mapping for the population initialization. A nonlinear decreasing coefficient is utilized instead of an original linear decreasing coefficient to improve the local exploitation and global exploration capabilities. Then, the modified golden sine mechanism is added during the position update stage to change the single position update mode of GOA and enhance the local exploitation capability. The greedy strategy is added to greedily select the new and old positions of the individual to retain a better position and increase the speed of convergence. Finally, the quasi-reflection-based learning mechanism is utilized to construct new populations to improve population multiplicity and the capability to escape from the local optima. This paper verifies the efficacy of MSIGOA by comparing it with other advanced algorithms on six engineering design problems, CEC2017 test functions, and 12 classical benchmark functions. The experimental results show that MSIGOA performs better than the original GOA and other compared algorithms and has stronger comprehensive optimization capabilities.

Keywords

• Grasshopper optimization algorithm
• Circle mapping
• Nonlinear decreasing coefficient
• Golden sine algorithm
• Quasi-reflection-based learning