Title :
Solving 0/1 knapsack problem using ant weight lifting algorithm
Author :
Samanta, Suranjana ; Chakraborty, Shiladri ; Acharjee, Suvojit ; Mukherjee, Arjun ; Dey, Nilanjan
Author_Institution :
Dept. of CSE, Univ. Inst. of Technol., Burdwan, India
Abstract :
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.
Keywords :
combinatorial mathematics; dynamic programming; genetic algorithms; knapsack problems; AWL; ant weight lifting algorithm; bioinspired behavior; combinatorial optimization problem; dynamic programming; genetic algorithm; solving 0/1 knapsack problem; Communities; Conferences; DNA; Educational institutions; Genetic algorithms; Organisms; 0/1 knapsack problem; Ant weight lifting algorithm; Genetic algorithm;
Conference_Titel :
Computational Intelligence and Computing Research (ICCIC), 2013 IEEE International Conference on
Conference_Location :
Enathi
Print_ISBN :
978-1-4799-1594-1
DOI :
10.1109/ICCIC.2013.6724162
