Chaotic gradient based optimizer for solving multidimensional unconstrained and constrained optimization problems

Basit Öğe Kaydı
dc.contributor.authorTurgut, Oguz Emrah
dc.contributor.authorTurgut, Mert Sinan
dc.date.accessioned2024-03-09T18:48:16Z
dc.date.available2024-03-09T18:48:16Z
dc.date.issued2023
dc.departmentİzmir Bakırçay Üniversitesien_US
dc.description.abstractGradient-based optimizer (GRAD) belongs to the recently developed population-based metaheuristic algorithms inspired by the development of Newton-type methods. Despite its new emergence, there are many successful applications of this optimizer in the existing literature; however, chaos integrated version of this algorithm has not been extensively studied yet. In his study, twenty-one different chaotic maps have been incorporated into the standard GRAD algorithm to maintain a reliable balance between exploration and exploitation mechanisms, which is not robustly constructed within the original algorithm. First ninety-nine thirty dimensional artificially generated optimization benchmark problems comprised of sixty-eight multimodal and thirty-one unimodal functions have been solved by these chaotic variants of the GRAD algorithm to determine the five best performing methods between them. Clear dominancy of the chaotic algorithms is clearly observed over the entire range of benchmark cases in terms of solution accuracy and robustness. Then, to validate the optimization capability of the chaos integrated GRAD algorithms, the best method among them is tested on fourteen constrained real world engineering problems, and its respective feasible results are benchmarked against those obtained from cutting edge metaheuristic optimizer. It is seen that the chaotic GRAD algorithm is able to effectively compete with other state-of-art algorithms on both solving unconstrained and constrained engineering problems. Moreover, it is observed that the Chebyshev chaotic map improved GRAD algorithm outperforms its contemporaries in both unconstrained and constrained cases.en_US
dc.identifier.doi10.1007/s12065-023-00876-6
dc.identifier.issn1864-5909
dc.identifier.issn1864-5917
dc.identifier.scopus2-s2.0-85169169691en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://doi.org/10.1007/s12065-023-00876-6
dc.identifier.urihttps://hdl.handle.net/20.500.14034/1267
dc.identifier.wosWOS:001062023100001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer Heidelbergen_US
dc.relation.ispartofEvolutionary Intelligenceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectChaotic Map; Benchmark Functions; Engineering Problems; Gradient-Based Optimizer; Metaheuristicen_US
dc.titleChaotic gradient based optimizer for solving multidimensional unconstrained and constrained optimization problemsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
1267.pdf
Boyut:
16.75 MB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu