Adaptive binary artificial bee colony for multi-dimensional knapsack problem

Basit Öğe Kaydı
dc.authoridAydin, Mehmet/0000-0002-4890-5648
dc.contributor.authorDurgut, Rafet
dc.contributor.authorAydin, Mehmet
dc.date.accessioned2024-09-29T16:06:30Z
dc.date.available2024-09-29T16:06:30Z
dc.date.issued2021
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe efficiency and effectiveness of metaheuristic optimization algorithms is managed with diverse search and fast approximation in the solution space. A balanced exploration and exploitation capability is required to achieve by the neighborhood operators towards the aimed efficiency. The majority of metaheuristic algorithms use either single operator or limited to genetic operators, which impose serious boundaries upon performance. In order to avoid this limitation, multiple neighborhood operators can be used within the search process orchestrated by a selection scheme. In this study, an adaptive operator selection scheme is studied with multiple binary operators embedded within artificial bee colony algorithm to solve the multidimensional knapsack problem (MKP) as a renown NP-Hard combinatorial problem. It is implemented for modelling and solving many real-world problems, while it is not trivial to offer a good solution within a reasonable timeframe. A parametric study has been conducted for the approach proposed in this study. The success of the proposed approach has been demonstrated and discussed with comparative analysis using three different classes of benchmark problem sets.en_US
dc.identifier.doi10.17341/gazimmfd.804858
dc.identifier.endpage2348en_US
dc.identifier.issn1300-1884
dc.identifier.issn1304-4915
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-85117850937en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage2333en_US
dc.identifier.trdizinid494863en_US
dc.identifier.urihttps://doi.org/10.17341/gazimmfd.804858
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/494863
dc.identifier.urihttps://hdl.handle.net/20.500.14619/6872
dc.identifier.volume36en_US
dc.identifier.wosWOS:000692521900040en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isotren_US
dc.publisherGazi Univ, Fac Engineering Architectureen_US
dc.relation.ispartofJournal of the Faculty of Engineering and Architecture of Gazi Universityen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMulti-dimensional knapsack problemen_US
dc.subjectartificial bee colonyen_US
dc.subjectbinary abcen_US
dc.subjectadaptive abcen_US
dc.titleAdaptive binary artificial bee colony for multi-dimensional knapsack problemen_US
dc.title.alternativeÇok boyutlu sırt çantası problemi için adaptif ikili yapay arı kolonisi algoritması (AİYAK)en_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu