Investigation of Knapsack Problem by Genetic Algorithm Simulator

Abstract

We report a verification result about the knapsack problem using genetic algorithm simulator． Genetic algorithm is one of metaheuristic method that imitates evolution processes of living things. At first, we prepared baggage candidates to put it in a knapsack and investigated how evolutionary performance changed by the selection, crossover, mutation rate and difference of genetic population. In addition, we investigated the evolutionary performance when number of generations increase in expected value of selections and the relations between genetic population and calculation time.