[PDF][PDF] Adaptive binary artificial bee colony for multi-dimensional knapsack problem
… Purpose: The purpose of the study is to investigate how to solve for multi-dimensional
knapsack problems better with higher robustness using binary artificial bee colony algorithms.
… In this study, an adaptive operator selection scheme is studied with multiple binary
operators embedded within artificial bee colony algorithm to solve the multidimensional
knapsack problem (MKP) as a renown NP-Hard combinatorial problem. It is implemented for
modelling and solving many real-world problems, while it is not trivial to offer a good solution …
knapsack problems better with higher robustness using binary artificial bee colony algorithms.
… In this study, an adaptive operator selection scheme is studied with multiple binary
operators embedded within artificial bee colony algorithm to solve the multidimensional
knapsack problem (MKP) as a renown NP-Hard combinatorial problem. It is implemented for
modelling and solving many real-world problems, while it is not trivial to offer a good solution …
Purpose: The purpose of the study is to investigate how to solve for multi-dimensional knapsack problems better with higher robustness using binary artificial bee colony algorithms.
Theory and Methods:
academia.edu
以上显示的是最相近的搜索结果。 查看全部搜索结果