Ulker, ErkanTongur, Vahit2020-03-262020-03-2620171877-0509https://dx.doi.org/10.1016/j.procs.2017.06.012https://hdl.handle.net/20.500.12395/352938th International Conference on Advances in Information Technology (IAIT) -- DEC 19-22, 2016 -- Macau, PEOPLES R CHINAThis study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of knapsack problem. The knapsack problem which is classified as NP-complete problem is a combinatorial optimization problem. Its aim is to achieve maximum benefit without exceeding the capacity of the knapsack with selected item. The Migrating Birds Algorithm is designed for discrete problems. Therefore, the performance of basic the MBO algorithm is tested on the some knapsack problems and obtained results are demonstrated in detail. (C) 2017 The Authors. Published by Elsevier B.V.en10.1016/j.procs.2017.06.012info:eu-repo/semantics/openAccessKnapsack ProblemMeta-heuristic OptimizationMigrating Birds OptimizationConference Object1117176N/AWOS:000418465800011N/A