A new approach to the Restart Genetic Algorithm to solve zero-one knapsack problem

Genetic Algorithm is one of the popular evolutionary algorithms to solve different problems specially NP problems. Therefore, there are different efforts to improve the speed and performance of genetic algorithm. The main purpose of this paper is to present a new kind of Restart Genetic Algorithm to improve the performance and reduce the run time. The proposed algorithm has been used to solve zero-one knapsack problem. The experimental results show the proposed algorithm has enhanced speed and performance in comparison with other two kinds of genetic algorithm.