Solving 0–1 Knapsack problem using Genetic Algorithms

This is a research project on using Genetic Algorithm to solve 0-1 Knapsack Problem. Knapsack problem is a combinational optimization problem. Given a set of items, each with a weight & value, it determine the number of each item to include in a collection so that the total weight is less than a given limit & the total value is as large as possible. The paper consists of three parts. In the first section we give brief description of Genetic Algorithms and some of its basic elements. Next, we describe the Knapsack Problem and Implementation of Knapsack problem using Genetic Algorithm. The main purpose of this paper is to implement Knapsack problem by an algorithm that is based on Genetic Algorithm. In this paper I have used Roulette-Wheel, Tournament Selection and Stochastic selection as a selection function and the succeeding populations are analyzed for the fitness value with hope to achieve the correct solution and expected results were observed.