<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)

dc.contributor.authorGhasemi, Mojtaba
dc.contributor.authorRahimnejad, Abolfazl
dc.contributor.authorAkbari, Ebrahim
dc.contributor.authorRao, Ravipudi Venkata
dc.contributor.authorTrojovský, Pavel
dc.contributor.authorTrojovská, Eva
dc.contributor.authorGadsden, Stephen Andrew
dc.date.accessioned2025-12-05T13:00:28Z
dc.date.available2025-12-05T13:00:28Z
dc.date.issued2023
dc.description.abstractMany 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.eng
dc.formatp. &quot;Article Number:e1431&quot;
dc.identifier.doi10.7717/peerj-cs.1431
dc.identifier.issn2376-5992
dc.identifier.obd43880217
dc.identifier.urihttp://hdl.handle.net/20.500.12603/1858
dc.language.isoeng
dc.peerreviewedyes
dc.publicationstatuspostprint
dc.publisherPeerJ Inc
dc.relation.ispartofPeerJ Computer Science, volume 9, issue: Augusteng
dc.relation.publisherversionhttps://peerj.com/articles/cs-1431/
dc.rights.accessOpen Access
dc.rights.licenseCC BY
dc.source.urlhttps://peerj.com/articles/cs-1431/
dc.subjectOptimizationeng
dc.subjectRao algorithmseng
dc.subjectFully Informed Search Algorithm (FISA)eng
dc.subjectConstrained engineering optimizationeng
dc.subjectPARTICLE SWARM OPTIMIZATIONeng
dc.subjectENGINEERING OPTIMIZATIONeng
dc.subjectMETAHEURISTIC ALGORITHMeng
dc.titleA new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)eng
dc.typearticle

Soubory

Původní svazek

Nyní se zobrazuje 1 - 1 z 1
Načítá se...
Náhled
Název:
peerj-cs-1431.pdf
Velikost:
751,43 KB
Formát:
Adobe Portable Document Format