A New "Good and Bad Groups-Based Optimizer" for Solving Various Optimization Problems
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F21%3A50018149" target="_blank" >RIV/62690094:18470/21:50018149 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.mdpi.com/2076-3417/11/10/4382" target="_blank" >https://www.mdpi.com/2076-3417/11/10/4382</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/app11104382" target="_blank" >10.3390/app11104382</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
A New "Good and Bad Groups-Based Optimizer" for Solving Various Optimization Problems
Popis výsledku v původním jazyce
Optimization is the science that presents a solution among the available solutions considering an optimization problem's limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching-learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.
Název v anglickém jazyce
A New "Good and Bad Groups-Based Optimizer" for Solving Various Optimization Problems
Popis výsledku anglicky
Optimization is the science that presents a solution among the available solutions considering an optimization problem's limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching-learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Applied Sciences
ISSN
2076-3417
e-ISSN
—
Svazek periodika
11
Číslo periodika v rámci svazku
10
Stát vydavatele periodika
CH - Švýcarská konfederace
Počet stran výsledku
15
Strana od-do
"Article Number: 4382"
Kód UT WoS článku
000662517500001
EID výsledku v databázi Scopus
2-s2.0-85106624515