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ü]
No Thumbnail Available
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers Inc.
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
This 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.
Description
2nd International Conference on Computer Science and Engineering, UBMK 2017 -- 5 October 2017 through 8 October 2017 -- 132116
Keywords
0-1 multidimensional problem, Metaheuristic optimization, Migrating Birds Optimization
Journal or Series
2nd International Conference on Computer Science and Engineering, UBMK 2017
WoS Q Value
Scopus Q Value
N/A
