Date of Publication :16th August 2017

Abstract: Genetic Algorithms (GA) provide a simple method to solve complex optimization problems. The performance of a Genetic Algorithm mainly depends on the genetic parameters, operators and the fitness function used. This paper proposed an improved Genetic Algorithm to solve a NP-hard problem i.e. Knapsack problem. The Improved GA is implemented using C programming language. It gives better results when compared against an existing GA to solve the Knapsack Problem. This paper also proposes an optimal parameter setting for Knapsack Problem using GA.

Reference :