An Implementation of an Initial Scale in Solving Binary Knapsack Problem Using a Genetic Algorithm

Abstract

In this paper, we used a new operation in a Genetic Algorithm for solving the binary Knapsack problem depending on it’s LP Relaxation solution after eliminating the fractional part of the non-binary values. The benefit is to make a filter to the initial random population from the farness of the optimal solution and unsuitable chromosomes. This good property will be fixed automatically in all generations in the Genetic Algorithm until reaching the optimal binary solution.

Keywords

• genetic algorithm
• binary knapsack problem
• lp relaxation solution