A New Approach for Solving 0/1 Knapsack Problem

In this paper, we reported our study on solving 0/1 knapsack problem effectively by using ant colony optimization. The 0/1 knapsack problem is to maximize the total profit under the constraint that the total weight of all chosen objects is at the most weight limit. In our study, we viewed the search in ant colonies as a mechanism providing a better performance and it has the ability to escape from local optima. In this paper, several examples are tested to demonstrate the superiority of the proposed algorithm. From simulation results, the proposed algorithm indeed has remarkable performance.