A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F23%3A50020607" target="_blank" >RIV/62690094:18470/23:50020607 - isvavai.cz</a>
Výsledek na webu
<a href="https://peerj.com/articles/cs-1431/" target="_blank" >https://peerj.com/articles/cs-1431/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7717/peerj-cs.1431" target="_blank" >10.7717/peerj-cs.1431</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)
Popis výsledku v původním jazyce
Many important engineering optimization problems require a strong and simple optimization algorithm to achieve the best solutions. In 2020, Rao introduced three non-parametric algorithms, known as Rao algorithms, which have garnered significant attention from researchers worldwide due to their simplicity and effectiveness in solving optimization problems. In our simulation studies, we have developed a new version of the Rao algorithm called the Fully Informed Search Algorithm (FISA), which demonstrates acceptable performance in optimizing real-world problems while maintaining the simplicity and non-parametric nature of the original algorithms. We evaluate the effectiveness of the suggested FISA approach by applying it to optimize the shifted benchmark functions, such as those provided in CEC 2005 and CEC 2014, and by using it to design mechanical system components. We compare the results of FISA to those obtained using the original RAO method. The outcomes obtained indicate the efficacy of the proposed new algorithm, FISA, in achieving optimized solutions for the aforementioned problems. The MATLAB Codes of FISA are publicly available at https://github.com/ebrahimakbary/FISA.
Název v anglickém jazyce
A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)
Popis výsledku anglicky
Many important engineering optimization problems require a strong and simple optimization algorithm to achieve the best solutions. In 2020, Rao introduced three non-parametric algorithms, known as Rao algorithms, which have garnered significant attention from researchers worldwide due to their simplicity and effectiveness in solving optimization problems. In our simulation studies, we have developed a new version of the Rao algorithm called the Fully Informed Search Algorithm (FISA), which demonstrates acceptable performance in optimizing real-world problems while maintaining the simplicity and non-parametric nature of the original algorithms. We evaluate the effectiveness of the suggested FISA approach by applying it to optimize the shifted benchmark functions, such as those provided in CEC 2005 and CEC 2014, and by using it to design mechanical system components. We compare the results of FISA to those obtained using the original RAO method. The outcomes obtained indicate the efficacy of the proposed new algorithm, FISA, in achieving optimized solutions for the aforementioned problems. The MATLAB Codes of FISA are publicly available at https://github.com/ebrahimakbary/FISA.
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í
2023
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
PeerJ Computer Science
ISSN
2376-5992
e-ISSN
2376-5992
Svazek periodika
9
Číslo periodika v rámci svazku
August
Stát vydavatele periodika
GB - Spojené království Velké Británie a Severního Irska
Počet stran výsledku
24
Strana od-do
"Article Number:e1431"
Kód UT WoS článku
001048536400001
EID výsledku v databázi Scopus
—