scholarly journals Modified Grasshopper Optimization Algorithm Based Genetic Algorithm for Global Optimization Problems: The System of Nonlinear Equations Case Study

2021 ◽  
Author(s):  
Hala A. Omar ◽  
Mohammed El-Shorbagy
Keyword(s):  
Genetic Algorithm ◽  
Optimization Algorithm ◽  
Local Minimum ◽  
Optimization Problems ◽  
Search Space ◽  
System Of Nonlinear Equations ◽  
Grasshopper Optimization Algorithm ◽  
Speed Up ◽  
Grasshopper Optimization

Abstract Grasshopper optimization algorithm (GOA) is one of the promising optimization algorithms for optimization problems. But, it has the main drawback of trapping into a local minimum, which causes slow convergence or inability to detect a solution. Several modifications and combinations have been proposed to overcome this problem. In this paper, a modified grasshopper optimization algorithm (MGOA) based genetic algorithm (GA) is proposed to overcome this problem. Modifications rely on certain mathematical assumptions and varying the domain of the Cmax control parameter to escape from the local minimum and move the search process to a new improved point. Parameter C is one of the most important parameters in GOA where it balances the exploration and exploitation of the search space. These modifications aim to lead to speed up the convergence rate by reducing the repeated solutions and the number of iterations. The proposed algorithm will be tested on the 19 main test functions to verify and investigate the influence of the proposed modifications. In addition, the algorithm will be applied to solve 5 different cases of nonlinear systems with different types of dimensions and regularity to show the reliability and efficiency of the proposed algorithm. Good results were achieved compared to the original GOA.

scholarly journals Binary Spring Search Algorithm for Solving Various Optimization Problems

2021 ◽  
Vol 11 (3) ◽  
pp. 1286 ◽  
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Ali Dehghani ◽  
Om P. Malik ◽  
Ruben Morales-Menendez ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Bat Algorithm ◽  
Search Space ◽  
Binary Particle Swarm Optimization ◽  
Dragonfly Algorithm ◽  
Grasshopper Optimization Algorithm

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.

scholarly journals The improved grasshopper optimization algorithm and its applications

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Peng Qin ◽  
Hongping Hu ◽  
Zhengmin Yang
Keyword(s):  
Neural Network ◽  
Optimization Algorithm ◽  
Bp Neural Network ◽  
Optimization Problems ◽  
Stock Exchange ◽  
Gravity Force ◽  
Shanxi Province ◽  
Grasshopper Optimization Algorithm ◽  
Predicted Model ◽  
Grasshopper Optimization

AbstractGrasshopper optimization algorithm (GOA) proposed in 2017 mimics the behavior of grasshopper swarms in nature for solving optimization problems. In the basic GOA, the influence of the gravity force on the updated position of every grasshopper is not considered, which possibly causes GOA to have the slower convergence speed. Based on this, the improved GOA (IGOA) is obtained by the two updated ways of the position of every grasshopper in this paper. One is that the gravity force is introduced into the updated position of every grasshopper in the basic GOA. And the other is that the velocity is introduced into the updated position of every grasshopper and the new position are obtained from the sum of the current position and the velocity. Then every grasshopper adopts its suitable way of the updated position on the basis of the probability. Finally, IGOA is firstly performed on the 23 classical benchmark functions and then is combined with BP neural network to establish the predicted model IGOA-BPNN by optimizing the parameters of BP neural network for predicting the closing prices of the Shanghai Stock Exchange Index and the air quality index (AQI) of Taiyuan, Shanxi Province. The experimental results show that IGOA is superior to the compared algorithms in term of the average values and the predicted model IGOA-BPNN has the minimal predicted errors. Therefore, the proposed IGOA is an effective and efficient algorithm for optimization.

scholarly journals A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Yi Feng ◽  
Mengru Liu ◽  
Yuqian Zhang ◽  
Jinglin Wang
Keyword(s):  
Optimization Algorithm ◽  
Manufacturing Industry ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimization Problems ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization

Job shop scheduling problem (JSP) is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem (FJSP) is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each process from a given set, which introduces another decision element within the job path, making FJSP be more difficult than traditional JSP. In this paper, a variant of grasshopper optimization algorithm (GOA) named dynamic opposite learning assisted GOA (DOLGOA) is proposed to solve FJSP. The recently proposed dynamic opposite learning (DOL) strategy adopts the asymmetric search space to improve the exploitation ability of the algorithm and increase the possibility of finding the global optimum. Various popular benchmarks from CEC 2014 and FJSP are used to evaluate the performance of DOLGOA. Numerical results with comparisons of other classic algorithms show that DOLGOA gets obvious improvement for solving global optimization problems and is well-performed when solving FJSP.

A novel grasshopper optimization algorithm based on swarm state difference and its application

2021 ◽  
pp. 1-14
Author(s):  
Zhaoming Lv ◽  
Rong Peng
Keyword(s):  
Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Matching Problem ◽  
Local Optima ◽  
Grasshopper Optimization Algorithm ◽  
Third Stage ◽  
Population Learning ◽  
Grasshopper Optimization ◽  
Scale Optimization

The grasshopper optimization algorithm (GOA) has received extensive attention from scholars in various real applications in recent years because it has a high local optima avoidance mechanism compared to other meta-heuristic algorithms. However, the small step moves of grasshopper lead to slow convergence. When solving larger-scale optimization problems, this shortcoming needs to be solved. In this paper, an enhanced grasshopper optimization algorithm based on solitarious and gregarious states difference is proposed. The algorithm consists of three stages: the first stage simulates the behavior of solitarious population learning from gregarious population; the second stage merges the learned population into the gregarious population and updates each grasshopper; and the third stage introduces a local operator to the best position of the current generation. Experiments on the benchmark function show that the proposed algorithm is better than the four representative GOAs and other metaheuristic algorithms in more cases. Experiments on the ontology matching problem show that the proposed algorithm outperforms all metaheuristic-based method and beats more the state-of-the-art systems.

Sign in / Sign up

Export Citation Format

Share Document