Migrating birds optimization (MBO) algorithm to solve 0-1 multidimensional knapsack problem [0-1 Çok Boyutlu Sirt Çantasi Probleminin Göçmen Kuşlar Optimizasyon Algoritmasi ile Çözümü]

dc.contributor.authorTongur V.
dc.contributor.authorÜlker E.
dc.date.accessioned2020-03-26T19:43:38Z
dc.date.available2020-03-26T19:43:38Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description2nd International Conference on Computer Science and Engineering, UBMK 2017 -- 5 October 2017 through 8 October 2017 -- 132116en_US
dc.description.abstractThis study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of 0-1 multidimensional knapsack problem. In the study, the basic migrating birds optimization algorithm is used and change is made to the only neighborhood structure of this algorithm for adapting to the addressed problem. The performance of the algorithm is examined on the test problems that selected from OR-library. The obtained results show that the migrating birds optimization algorithm has achieved successful results in 0-1 multidimensional backpack problems. © 2017 IEEE.en_US
dc.identifier.doi10.1109/UBMK.2017.8093530en_US
dc.identifier.endpage789en_US
dc.identifier.isbn9.78154E+12
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage786en_US
dc.identifier.urihttps://dx.doi.org/10.1109/UBMK.2017.8093530
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35721
dc.indekslendigikaynakScopusen_US
dc.language.isotren_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartof2nd International Conference on Computer Science and Engineering, UBMK 2017en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subject0-1 multidimensional problemen_US
dc.subjectMetaheuristic optimizationen_US
dc.subjectMigrating Birds Optimizationen_US
dc.titleMigrating birds optimization (MBO) algorithm to solve 0-1 multidimensional knapsack problem [0-1 Çok Boyutlu Sirt Çantasi Probleminin Göçmen Kuşlar Optimizasyon Algoritmasi ile Çözümü]en_US
dc.typeConference Objecten_US

Dosyalar