Migrating birds optimization (MBO) algorithm to solve knapsack problem
dc.contributor.author | Ulker, Erkan | |
dc.contributor.author | Tongur, Vahit | |
dc.date.accessioned | 2024-02-23T14:13:37Z | |
dc.date.available | 2024-02-23T14:13:37Z | |
dc.date.issued | 2017 | |
dc.department | NEÜ | en_US |
dc.description | 8th International Conference on Advances in Information Technology (IAIT) -- DEC 19-22, 2016 -- Macau, PEOPLES R CHINA | en_US |
dc.description.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. (C) 2017 The Authors. Published by Elsevier B.V. | en_US |
dc.description.sponsorship | Scientific Research Projects of Selcuk University (in Turkey) | en_US |
dc.description.sponsorship | This study has been supported by the Scientific Research Projects of Selcuk University (in Turkey). | en_US |
dc.identifier.doi | 10.1016/j.procs.2017.06.012 | |
dc.identifier.endpage | 76 | en_US |
dc.identifier.issn | 1877-0509 | |
dc.identifier.scopus | 2-s2.0-85029375799 | en_US |
dc.identifier.startpage | 71 | en_US |
dc.identifier.uri | https://doi.org/10.1016/j.procs.2017.06.012 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12452/12505 | |
dc.identifier.volume | 111 | en_US |
dc.identifier.wos | WOS:000418465800011 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Science Bv | en_US |
dc.relation.ispartof | 8th International Conference On Advances In Information Technology | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Knapsack Problem | en_US |
dc.subject | Meta-Heuristic Optimization | en_US |
dc.subject | Migrating Birds Optimization | en_US |
dc.title | Migrating birds optimization (MBO) algorithm to solve knapsack problem | en_US |
dc.type | Conference Object | en_US |