The Knapsack problem helps in achieving Local optimized problem, but Genetic Algorithm helps in achieving Global optimized problem. The main motive behind implementing this project is to optimize the feature selection.
Mutation is the part of the GA which is related to the “exploration” of the search space. It has been observed that mutation is essential to the convergence of the GA while crossover is not.
The crossover operator is analogous to reproduction and biological crossover. In this more than one parent is selected and one or more off-springs are produced using the genetic material of the parents. Crossover is usually applied in a GA with a high probability