Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/786
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarakoyun, Murat-
dc.contributor.authorÖzkış, Ahmet-
dc.contributor.authorKodaz, Halife-
dc.date.accessioned2021-12-13T10:29:59Z-
dc.date.available2021-12-13T10:29:59Z-
dc.date.issued2020-
dc.identifier.issn1568-4946-
dc.identifier.issn1872-9681-
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2020.106560-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/786-
dc.description.abstractMulti-objective optimization is many important since most of the real world problems are in multiobjective category. Looking at the literature, the algorithms proposed for the solution of multi-objective problems have increased in recent years, but there is no a convenient approach for all kind of problems. Therefore, researchers aim to contribute to the literature by offering new approaches. In this study, an algorithm based on gray wolf optimizer (GWO) with memeplex structure of the shuffled frog leaping algorithm (SFLA), which is named as multi-objective shuffled GWO (MOSG), is proposed to solve the multi-objective optimization problems. Additionally, some modifications are applied on the proposed algorithm to improve the performance from different angles. The performance of the proposed algorithm is compared with the performance of six multi-objective algorithms on a benchmark set consist of 36 problems. The experimental results are presented with four different comparison metrics and statistical tests. According to the results, it can easily be said that the proposed algorithm is generally successful to solve the multi-objective problems and has better or competitive results. (C) 2020 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherELSEVIERen_US
dc.relation.ispartofAPPLIED SOFT COMPUTINGen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGray Wolf Optimizeren_US
dc.subjectLevy Flighten_US
dc.subjectMulti-Objective Optimizationen_US
dc.subjectFast-Non-Dominated-Sortingen_US
dc.subjectPareto Theoremen_US
dc.subjectParticle Swarm Optimizationen_US
dc.subjectShop Scheduling Problemen_US
dc.subjectEvolutionary Algorithmsen_US
dc.subjectGenetic Algorithmen_US
dc.subjectLevy Flighten_US
dc.subjectSearchen_US
dc.subjectSelectionen_US
dc.subjectMutationen_US
dc.subjectOperatoren_US
dc.subjectFlowen_US
dc.titleA new algorithm based on gray wolf optimizer and shuffled frog leaping algorithm to solve the multi-objective optimization problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asoc.2020.106560-
dc.identifier.scopus2-s2.0-85089064029en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.authoridKODAZ, Halife/0000-0001-8602-4262-
dc.authorwosidKODAZ, Halife/ABG-2951-2020-
dc.identifier.volume96en_US
dc.identifier.wosWOS:000582762000004en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.authorscopusid57218393257-
dc.authorscopusid57193771340-
dc.authorscopusid8945093700-
item.cerifentitytypePublications-
item.grantfulltextembargo_20300101-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
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
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Files in This Item:
File SizeFormat 
1-s2.0-S1568494620304993-main.pdf
  Until 2030-01-01
9.5 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

18
checked on Apr 13, 2024

WEB OF SCIENCETM
Citations

36
checked on Apr 13, 2024

Page view(s)

98
checked on Apr 15, 2024

Download(s)

4
checked on Apr 15, 2024

Google ScholarTM

Check




Altmetric


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