Solving Knapsack Problem with Genetic Algorithm

Knapsack problem is a traditional combinatorial optimization problem which aims to maximize the payload without exceeding the capacity of the bag. When one of the problem variables which are “the capacity of the bag” or “the types/numbers of materials” is increased, the complexity of the problem size increases significantly. Because of the complexity of this problem, it has been become an area of interest for researchers and is intended to be solved with different approaches. Among these different solution approaches without checking in all search space, Evolutionary algorithms reveals approaches which are acceptable compliance solutions with producing an acceptable period of time. In this paper, it is shown how to solve 0–1 Knapsack Problem by using Genetic Algorithms (GAs) which is one of the Evolutionary algorithms, explained details of proposed algorithm and shared the test results to show that proposed approach has produced acceptable solutions.