Study of Solving Knapsack Problem Using Genetic Algorithm

Abstract

This is a research paper on the use of genetic algorithm to solve the concern 0 - 1 Knapsack. The problem with Knapsack is a Problem of combinational optimization. In view of the set of items, each with a value and weight, the quantity of each element shall be calculated. Include in the set in such a manner that the overall weight is less than one of the defined limits and that the total amount is as high as practicable, the article is made up of three parts. In the first section, a brief description of the genetic algorithms and some of its basic elements is provided. Next, we 're describing the Knapsack problem and implementation of the Knapsack problem with the Genetic Algorithm. The main goal of this paper is to solve the Knapsack problem using a Genetic Algorithm.