Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem

Abstract

In this paper we solve the non fractional knapsack problem also known as 0-1 knapsack using genetic algorithm. The usual approaches are greedy method and dynamic programming. Its an optimization problem where we try to maximize the values that can be put into a knapsack under the constraint of its weight. We solve the problem using genetic algorithm in matlab using gatool. In this research work different selection schemes have been used like roulette wheel, tournament selection, Stochastic selection etc. Following the introduction of genetic algorithm and knapsack problem, formulation of 0-1 knapsack problem in genetic algorithm is presented. Experimental results using various selection schemes have been analyzed and comparison of genetic algorithm technique is done with greedy method and dynamic programming optimizing techniques.

Computer Science & Information Technology (CS & IT)

“…The experiments that followed, two point crossover showed the best results. In [11] and [12] the authors have evaluated the performance of various selection techniques. In [15] the authors evaluated various algorithmic techniques used in optimization of 0/1 knapsack.…”