A Comparative Analysis for Binary Search Operators used in Artificial Bee Colony

Basit Öğe Kaydı
dc.contributor.authorAtli, Ibrahim
dc.contributor.authorDurgut, Rafet
dc.contributor.authorAydin, Mehmet Emin
dc.date.accessioned2024-09-29T16:04:29Z
dc.date.available2024-09-29T16:04:29Z
dc.date.issued2021
dc.departmentKarabük Üniversitesien_US
dc.description29th IEEE Conference on Signal Processing and Communications Applications (SIU) -- JUN 09-11, 2021 -- ELECTR NETWORKen_US
dc.description.abstractMetaheuristic optimization algorithms are developed to find the best or near-best solutions within a reasonable time frame utilizing various neighbourhood functions (i.e., operators). Variety of studies have been proposed for structural modifications on metaheuristic approaches or utilization of various operators. Some of these operators help fast convergence at the beginning but lose efficiency relatively or completely towards the end or vice versa. The individual and collective behaviors of operators in the search space plays crucial role in producing fruitful solutions to approximate the optimum and to devise useful adaptive selection schemes in the cases of using multiple operators. To the best of our knowledge, collective behaviour of binary operators has not been analysed comprehensively. In this study, the characteristics and collective behaviour of operators that can work on discrete decision variables within an artificial bee colony are investigated over solving OneMax and SUKP problems utilizing 9 different operators. The results conclude that disABC, GBABC and twoOptABC operators are more effective in solving OneMax problems, while GBABC and twoOptABC are more effective (especially towards end) in the SUKP problems.en_US
dc.description.sponsorshipIEEE,IEEE Turkey Secten_US
dc.identifier.doi10.1109/SIU53274.2021.9477907
dc.identifier.isbn978-1-6654-3649-6
dc.identifier.scopus2-s2.0-85111452906en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1109/SIU53274.2021.9477907
dc.identifier.urihttps://hdl.handle.net/20.500.14619/6158
dc.identifier.wosWOS:000808100700149en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isotren_US
dc.publisherIeeeen_US
dc.relation.ispartof29th Ieee Conference On Signal Processing and Communications Applications (Siu 2021)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBinary Operatorsen_US
dc.subjectsearch spaceen_US
dc.subjectmetaheuristicsen_US
dc.subjectoperator characteristicen_US
dc.subjectoptimizationen_US
dc.titleA Comparative Analysis for Binary Search Operators used in Artificial Bee Colonyen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

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