Abstract: This study addresses the 0-1 Knapsack Problem (KP), a classic variant of knapsack problems, using the Simulated Annealing (SA) algorithm. The 0-1 KP, an NP-hard problem, involves selecting ...
Abstract: This article proposes the integration of machine learning into an Ant Colony Optimization framework to tackle the multi-objective multi-dimensional knapsack problem. Specifically, we employ ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results