This paper proposed an improved grasshopper algorithm. It is successfully applied to global optimization problems. GOA is recently proposed metaheuristic algorithm inspired by the swarming behavior of the grasshoppers. However, the original GOA has some drawbacks, such as slow convergence speed, easy to fall into local local optimum and other problems. To overcome these shortcomings, this paper proposes a grasshopper algorithm (CCGOA) based on logistic chaos opposition-based learning strategy and inertia weight of cloud model. CCGOA is divided into three stages. In the first stage, the cha-os reverse learning initialization strategy is used to initialize the population, so that the population can be evenly distrib-uted in the feasible solution space as much as possible, so as to improve the uniformity and diversity of the initial popula-tion distribution of locust algorithm. In the second stage, inertia weight of cloud model is introduced into locust algo-rithm, and different inertia weight strategies are used to adjust the convergence speed of algorithm. In the third stage, based on the principle of Logistic chaotic mapping, local depth search is carried out to reduce the probability of falling into local optimum. 14 benchmark functions and an engineering example are used for simulation verification. Experi-mental results show that the proposed CCGOA algorithm has superior performance in determining the optimal solution of the test function problem.
This paper proposed an improved grasshopper algorithm. It is successfully applied to global optimization problems. GOA is recently proposed metaheuristic algorithm inspired by the swarming behavior of the grasshoppers. However, the original GOA has some drawbacks, such as slow convergence speed, easy to fall into local local optimum and other problems. To overcome these shortcomings, this paper proposes a grasshopper algorithm (CCGOA) based on logistic chaos opposition-based learning strategy and inertia weight of cloud model. CCGOA is divided into three stages. In the first stage, the cha-os reverse learning initialization strategy is used to initialize the population, so that the population can be evenly distrib-uted in the feasible solution space as much as possible, so as to improve the uniformity and diversity of the initial popula-tion distribution of locust algorithm. In the second stage, inertia weight of cloud model is introduced into locust algo-rithm, and different inertia weight strategies are used to adjust the convergence speed of algorithm. In the third stage, based on the principle of Logistic chaotic mapping, local depth search is carried out to reduce the probability of falling into local optimum. 14 benchmark functions and an engineering example are used for simulation verification. Experi-mental results show that the proposed CCGOA algorithm has superior performance in determining the optimal solution of the test function problem.
正在翻译中..
This paper proposed an improved grasshopper algorithm. It is successfully applied to global optimization problems. GOA is recently proposed metaheuristic algorithm inspired by the swarming behavior of the grasshoppers. However, the original GOA has some drawbacks, such as slow convergence speed, easy to fall into local local optimum and other problems. To overcome these shortcomings, this paper proposes a grasshopper algorithm (CCGOA) based on logistic chaos opposition-based learning strategy and inertia weight of cloud model. CCGOA is divided into three stages. In the first stage, the cha-os reverse learning initialization strategy is used to initialize the population, so that the population can be evenly distrib-uted in the feasible solution space as much as possible, so as to improve the uniformity and diversity of the initial popula-tion distribution of locust algorithm. In the second stage, inertia weight of cloud model is introduced into locust algo-rithm, and different inertia weight strategies are used to adjust the convergence speed of algorithm. In the third stage, based on the principle of Logistic chaotic mapping, local depth search is carried out to reduce the probability of falling into local optimum. 14 benchmark functions and an engineering example are used for simulation verification. Experi-mental results show that the proposed CCGOA algorithm has superior performance in determining the optimal solution of the test function problem.
正在翻译中..