IMPLEMENTASI TWO POINT CROSSOVER PADA KNAPSACK PROBLEM

Abstract

Genetic algorithm is heuristic searching algorithm which based on nature selection of mechanism and nature genetic. The basic
concept that inspires the genetic algorithm is that evolution theory. One of crossover operator in genetic algorithm is two-point
crossover. This operator can make better improvement in solving combinatorial problem. Previous research has done with onepoint crossover and it is compared with tow-point crossover in this research. Knapsack is a combinatorial problem which is to
find good solution with constraint. Evaluation is done 10 times execution on genetic algorithm (GA), and experimental results
show that two-point crossover can gives a quite good result in solving optimization problem.