Solving 0/1 knapsack problem using ant weight lifting algorithm

0/1 knapsack problem is a combinatorial optimization problem. Different approaches like dynamic programming, GA, PSO, ACO etc. have been taken by researchers to solve this problem. In this proposed paper, Ant Weight Lifting algorithm (AWL) is used to solve this problem. An ant can carry food heavier than their own weight. This bio-inspired behavior is taken into consideration and is applied to solve 0/1 Knapsack problem. Obtained results clearly show an improvement in performance and time complexity with respect to popular genetic algorithm based approach.