Migrating birds optimization (MBO) algorithm to solve knapsack problem
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ELSEVIER SCIENCE BV
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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. (C) 2017 The Authors. Published by Elsevier B.V.
Açıklama
8th International Conference on Advances in Information Technology (IAIT) -- DEC 19-22, 2016 -- Macau, PEOPLES R CHINA
Anahtar Kelimeler
Knapsack Problem, Meta-heuristic Optimization, Migrating Birds Optimization
Kaynak
8TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGY
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
111
