Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
Abstract: In this paper, a Directed Bee Colony (DBC) optimization algorithm has been successfully applied for solving a Multidimensional 0-1 Knapsack Problem (MKP). Knapsack problem is a typically NP ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback