Hybridization strategies in swarm intelligence: the case of ABC–FA and ABC–RUN algorithms
| dc.authorid | 0000-0002-3645-3445 | |
| dc.contributor.author | Yelmenoğlu, Elif Deniz | en_US |
| dc.contributor.editor | Pajenado, Rex S. | en_US |
| dc.contributor.editor | Dilli, Şirin | en_US |
| dc.date.accessioned | 2026-02-19T10:10:16Z | |
| dc.date.available | 2026-02-19T10:10:16Z | |
| dc.date.issued | 2025-10-08 | |
| dc.department | Işık Üniversitesi, İktisadi, İdari ve Sosyal Bilimler Fakültesi, Enformasyon Teknolojileri Bölümü | en_US |
| dc.department | Işık University, Faculty of Economics, Administrative and Social Sciences, Department of Information Technologies | en_US |
| dc.description.abstract | Metaheuristic optimization algorithms have become a very popular field of study in recent years due to their ability to effectively solve complex, multidimensional problems. In this study, the Artificial Bee Colony (ABC), Firefly Algorithm (FA), and Runge–Kutta (RUN) optimization algorithms, known for their good performance among metaheuristic methods, are compared with their hybrid variants ABC_RUN and ABC_FA. Five widely used benchmark functions were selected for performance evaluation, and the performance results of the algorithms were statistically evaluated using the Wilcoxon signed-rank test. Furthermore, convergence curves were generated to show the average performance of the algorithms, and average running times were calculated to examine the balance between accuracy and computational cost. The findings show that hybrid methods provide higher accuracy compared to classical methods, while the RUN algorithm has an advantage in terms of running time. This comparative analysis demonstrates that hybrid approaches can more effectively balance exploration and exploitation, increase global optimization performance, and are applicable to real-world problems. | en_US |
| dc.description.version | Publisher's Version | en_US |
| dc.identifier.citation | Yelmenoğlu, E. D. (2025). Hybridization strategies in swarm intelligence: the case of ABC–FA and ABC–RUN algorithms. Paper presented at the 17th International Istanbul Scientific Research Congress, 1038-1038. doi:https://doi.org/10.30546/19023.978-9952-8596-8-3.2025.0031 | en_US |
| dc.identifier.endpage | 1038 | |
| dc.identifier.isbn | 9789952859683 | |
| dc.identifier.startpage | 1038 | |
| dc.identifier.uri | https://hdl.handle.net/11729/7028 | |
| dc.identifier.uri | https://doi.org/10.30546/19023.978-9952-8596-8-3.2025.0031 | |
| dc.institutionauthor | Yelmenoğlu, Elif Deniz | en_US |
| dc.institutionauthorid | 0000-0002-3645-3445 | |
| dc.language.iso | en | en_US |
| dc.peerreviewed | Yes | en_US |
| dc.publicationstatus | Published | en_US |
| dc.publisher | BZT Turan Publishing House | en_US |
| dc.relation.ispartof | 17th International Istanbul Scientific Research Congress | en_US |
| dc.relation.publicationcategory | Konferans Öğesi - Ulusal - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Metaheuristic optimization | en_US |
| dc.subject | Hybrid algorithms | en_US |
| dc.subject | Artificial bee colony | en_US |
| dc.subject | Firefly algorithm | en_US |
| dc.subject | Runge kutta optimization | en_US |
| dc.title | Hybridization strategies in swarm intelligence: the case of ABC–FA and ABC–RUN algorithms | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- Hybridization_strategies_in_swarm_intelligence_the_case_of_ABC_FA_and_ABC_RUN_algorithms.pdf
- Boyut:
- 265.96 KB
- Biçim:
- Adobe Portable Document Format
Lisans paketi
1 - 1 / 1
Küçük Resim Yok
- İsim:
- license.txt
- Boyut:
- 1.17 KB
- Biçim:
- Item-specific license agreed upon to submission
- Açıklama:












