| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4960871 | Procedia Computer Science | 2017 | 6 Pages |
Abstract
This 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Erkan Ulker, Vahit Tongur,