Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/161
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAslan, Murat-
dc.contributor.authorGündüz, Mesut-
dc.contributor.authorKıran, Mustafa Servet-
dc.date.accessioned2021-12-13T10:19:53Z-
dc.date.available2021-12-13T10:19:53Z-
dc.date.issued2019-
dc.identifier.issn1568-4946-
dc.identifier.issn1872-9681-
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2019.105576-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/161-
dc.description.abstractJaya is a population-based heuristic optimization algorithm proposed for solving constrained and unconstrained optimization problems. The peculiar distinct feature of Jaya from the other population-based algorithms is that it updates the positions of artificial agent in the population by considering the best and worst individuals. This is an important property for the algorithm to balance exploration and exploitation on the solution space. However, the basic Jaya cannot be applied to binary optimization problems because the solution space is discretely structured for this type of optimization problems and the decision variables of the binary optimization problems can be element of set [0,1]. In this study, we first focus on discretization of Jaya by using a logic operator, exclusive or - xor. The proposed idea is simple but effective because the solution update rule of Jaya is replaced with the xor operator, and when the obtained results are compared with the state-of-art algorithms, it is seen that the Jaya-based binary optimization algorithm, JayaX for short, produces better quality results for the binary optimization problems dealt with the study. The benchmark problems in this study are uncapacitated facility location problems and CEC2015 numeric functions, and the performance of the algorithms is compared on these problems. In order to improve the performance of the proposed algorithm, a local search module is also integrated with the JayaX. The obtained results show that the proposed algorithm is better than the compared algorithms in terms of solution quality and robustness. (C) 2019 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.subjectJayaen_US
dc.subjectBinary Optimizationen_US
dc.subjectLogic Operatoren_US
dc.subjectExclusive Oren_US
dc.subjectDifferential Evolution Algorithmen_US
dc.subjectParticle Swarm Optimizationen_US
dc.subjectBee Colony Algorithmen_US
dc.subjectArtificial Algae Algorithmen_US
dc.subjectGlobal Harmony Searchen_US
dc.subjectParameter-Estimationen_US
dc.subjectDesign Optimizationen_US
dc.subjectLocation-Problemsen_US
dc.subjectModelen_US
dc.titleJayaX: Jaya algorithm with xor operator for binary optimizationen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asoc.2019.105576-
dc.identifier.scopus2-s2.0-85067985711en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.authoridKıran, Mustafa Servet/0000-0002-5896-7180-
dc.authorwosidKiran, Mustafa Servet/AAF-9793-2019-
dc.identifier.volume82en_US
dc.identifier.wosWOS:000484606800020en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.authorscopusid57196197224-
dc.authorscopusid36168144300-
dc.authorscopusid54403096500-
item.openairetypeArticle-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextembargo_20300101-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept02.03. Department of Computer Engineering-
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-S1568494619303564-main.pdf
  Until 2030-01-01
3.22 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

35
checked on Mar 23, 2024

WEB OF SCIENCETM
Citations

64
checked on Mar 23, 2024

Page view(s)

70
checked on Mar 25, 2024

Download(s)

6
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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