Solving 0/1 knapsack problem using ant weight lifting algorithm

Authors:

1 December 2013

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 1-5
DOI:10.1109/iccic.2013.6724162

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

This publication has 3 references indexed in Scilit:

Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Advances in Bioinformatics, 2013
Solving 0–1 Knapsack problem using Genetic Algorithms
2011
Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm
2006