describes a reseach project on using Genetic Algorithms (GAs) to solve the

0-1 Knapsack Prblem (KP). The Knasack Problem is an example of a combinatorial

optimization problem, Problem, and implementation of the 0-1 Knapsack
Problem using GAs. The
and group selection. Th results from both of them differed
depending on whether -heel function. Moreover, we tested the program with
different crossover ratio and single and double