Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/2373
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYıldızdan, Gülnur-
dc.contributor.authorBaykan, Ömer Kaan-
dc.date.accessioned2022-05-23T20:07:30Z-
dc.date.available2022-05-23T20:07:30Z-
dc.date.issued2021-
dc.identifier.isbn9781665429085-
dc.identifier.urihttps://doi.org/10.1109/UBMK52708.2021.9559009-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/2373-
dc.description6th International Conference on Computer Science and Engineering, UBMK 2021 -- 15 September 2021 through 17 September 2021 -- -- 176826en_US
dc.description.abstractMetaheuristic algorithms are frequently preferred algorithms for optimization problems in many different fields. The number of these algorithms inspired by natural phenomena is increasing day by day. Artificial Jellyfish Search Algorithm, inspired by the behavior of jellyfish in the ocean, is one of the new metaheuristic algorithms that have been proposed recently. In this study, two different search strategies were used together with a modification made in the active motion of the Artificial Jellyfish Search Algorithm, in the local search section, and the local search capability of the algorithm was thus developed. With this modification, it is aimed to preserve population diversity for a longer time. The proposed algorithm has been tested for 10, 30, and 50 dimensions on single-objective CEC2017 benchmark functions. The results obtained were compared with the standard algorithm and algorithms selected from the literature and interpreted with the help of statistical tests. It has been determined that the proposed algorithm outperforms the standard algorithm and becomes competitive with other algorithms in the literature thanks to the modification made. © 2021 IEEEen_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartofProceedings - 6th International Conference on Computer Science and Engineering, UBMK 2021en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectArtificial jellyfish search algorithmen_US
dc.subjectCEC2017 benchmarkfunctionsen_US
dc.subjectContinuous optimizationen_US
dc.subjectGlobal optimizationen_US
dc.subjectMetaheuristic algorithmen_US
dc.subjectLearning algorithmsen_US
dc.subjectLocal search (optimization)en_US
dc.subjectArtificial jellyfish search algorithmen_US
dc.subjectCec2017 benchmarkfunctionen_US
dc.subjectContinuous optimizationen_US
dc.subjectGlobal optimisationen_US
dc.subjectLocal searchen_US
dc.subjectLocal search strategyen_US
dc.subjectMeta-heuristics algorithmsen_US
dc.subjectOptimization problemsen_US
dc.subjectSearch Algorithmsen_US
dc.subjectStandard algorithmsen_US
dc.subjectGlobal optimizationen_US
dc.titleA Novel Artificial Jellyfish Search Algorithm Improved with Detailed Local Search Strategyen_US
dc.title.alternativeAyrmtili Lokal Arama Stratejisi ile Geliçtirilmiç Yeni Bir Yapay Denizanasi Arama Algoritmasien_US
dc.typeConference Objecten_US
dc.identifier.doi10.1109/UBMK52708.2021.9559009-
dc.identifier.scopus2-s2.0-85125874137en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.identifier.startpage180en_US
dc.identifier.endpage185en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.authorscopusid55780173300-
dc.authorscopusid23090480800-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Object-
item.grantfulltextembargo_20300101-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
crisitem.author.dept02.03. Department of Computer Engineering-
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
Show simple item record



CORE Recommender

Page view(s)

66
checked on Apr 15, 2024

Download(s)

6
checked on Apr 15, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.