GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to prov...

Full description

Bibliographic Details
Main Authors: Mohammad Dehghani, Zeinab Montazeri, Štěpán Hubálovský
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/9/11/1190
id doaj-28f26ab6e2774ff58bfecb78ad1ebb9f
record_format Article
spelling doaj-28f26ab6e2774ff58bfecb78ad1ebb9f2021-06-01T00:59:07ZengMDPI AGMathematics2227-73902021-05-0191190119010.3390/math9111190GMBO: Group Mean-Based Optimizer for Solving Various Optimization ProblemsMohammad Dehghani0Zeinab Montazeri1Štěpán Hubálovský2Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz 71557-13876, IranDepartment of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz 71557-13876, IranDepartment of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech RepublicThere are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.https://www.mdpi.com/2227-7390/9/11/1190optimizationoptimization algorithmspopulation basedexplorationexploitation
collection DOAJ
language English
format Article
sources DOAJ
author Mohammad Dehghani
Zeinab Montazeri
Štěpán Hubálovský
spellingShingle Mohammad Dehghani
Zeinab Montazeri
Štěpán Hubálovský
GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
Mathematics
optimization
optimization algorithms
population based
exploration
exploitation
author_facet Mohammad Dehghani
Zeinab Montazeri
Štěpán Hubálovský
author_sort Mohammad Dehghani
title GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
title_short GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
title_full GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
title_fullStr GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
title_full_unstemmed GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems
title_sort gmbo: group mean-based optimizer for solving various optimization problems
publisher MDPI AG
series Mathematics
issn 2227-7390
publishDate 2021-05-01
description There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.
topic optimization
optimization algorithms
population based
exploration
exploitation
url https://www.mdpi.com/2227-7390/9/11/1190
work_keys_str_mv AT mohammaddehghani gmbogroupmeanbasedoptimizerforsolvingvariousoptimizationproblems
AT zeinabmontazeri gmbogroupmeanbasedoptimizerforsolvingvariousoptimizationproblems
AT stepanhubalovsky gmbogroupmeanbasedoptimizerforsolvingvariousoptimizationproblems
_version_ 1721413382099173376