Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/4181
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bas, Emine | - |
dc.date.accessioned | 2023-05-31T20:09:58Z | - |
dc.date.available | 2023-05-31T20:09:58Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 0952-1976 | - |
dc.identifier.issn | 1873-6769 | - |
dc.identifier.uri | https://doi.org/10.1016/j.engappai.2022.105592 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/4181 | - |
dc.description.abstract | The optimization process entails determining the best values for various system characteristics in order to finish the system design at the lowest possible cost. In general, real-world applications and issues in artificial intelligence and machine learning are discrete, unconstrained, or discrete. Optimization approaches have a high success rate in tackling such situations. As a result, several sophisticated heuristic algorithms based on swarm intelligence have been presented in recent years. Various academics in the literature have worked on such algorithms and have effectively addressed many difficulties. Aquila Optimizer (AO) is one such algorithm. Aquila Optimizer (AO) is a recently suggested heuristic algorithm. It is a novel population-based optimization strategy. It was made by mimicking the natural behavior of the Aquila. It was created by imitating the behavior of the Aquila in nature in the process of catching its prey. The AO algorithm is an algorithm developed to solve continuous optimization problems in their original form. In this study, the AO structure has been updated again to solve binary optimization problems. Problems encountered in the real world do not always have continuous values. It exists in problems with discrete values. Therefore, algorithms that solve continuous problems need to be restructured to solve discrete optimization problems as well. Binary optimization problems constitute a subgroup of discrete optimization problems. In this study, a new algorithm is proposed for binary optimization problems (BAO). The most successful BAO-T algorithm was created by testing the success of BAO in eight different transfer functions. Transfer functions play an active role in converting the continuous search space to the binary search space. BAO has also been developed by adding candidate solution step crossover and mutation methods (BAO-CM). The success of the proposed BAO-T and BAO-CM algorithms has been tested on the knapsack problem, which is widely selected in binary optimization problems in the literature. Knapsack problem examples are divided into three different benchmark groups in this study. A total of sixty-three low, medium, and large scale knapsack problems were determined as test datasets. The performances of BAO-T and BAO-CM algorithms were examined in detail and the results were clearly shown with graphics. In addition, the results of BAO-T and BAO-CM algorithms have been compared with the new heuristic algorithms proposed in the literature in recent years, and their success has been proven. According to the results, BAO-CM performed better than BAO-T and can be suggested as an alternative algorithm for solving binary optimization problems. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Pergamon-Elsevier Science Ltd | en_US |
dc.relation.ispartof | Engineering Applications Of Artificial Intelligence | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Aquila Optimizer (AO) | en_US |
dc.subject | 0-1 knapsack problem | en_US |
dc.subject | Crossover | en_US |
dc.subject | Mutation | en_US |
dc.subject | Algorithm | en_US |
dc.title | Binary Aquila Optimizer for 0-1 knapsack problems | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.engappai.2022.105592 | - |
dc.identifier.scopus | 2-s2.0-85143763462 | en_US |
dc.department | KTÜN | en_US |
dc.authorid | bas, emine/0000-0003-4322-6010 | - |
dc.authorwosid | bas, emine/AEU-0108-2022 | - |
dc.identifier.volume | 118 | en_US |
dc.identifier.wos | WOS:000894966600010 | en_US |
dc.institutionauthor | … | - |
dc.relation.publicationcategory | Makale - Uluslararasi Hakemli Dergi - Kurum Ögretim Elemani | en_US |
dc.authorscopusid | 57213265310 | - |
item.fulltext | With Fulltext | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | embargo_20300101 | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1-s2.0-S0952197622005826-main.pdf Until 2030-01-01 | 2.23 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
1
checked on Aug 31, 2024
WEB OF SCIENCETM
Citations
17
checked on Aug 31, 2024
Page view(s)
68
checked on Aug 26, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.