Hybrid genetic algorithm for solving Knapsack problem

摘要

In clustering, clustering techniques are applied to get the best solution. The traditional clustering algorithms lead to local optimum. Hybrid genetic algorithm which includes multi clustering genetic algorithm with rough set theory is to be proposed to improve the efficiency and to get the optimal solution. The selection procedure of genetic algorithm has lower efficiency. So rough set theory can be used for selecting chromosomes for further process which is applied in 0–1 Knapsack problem.