Solving 0-1Knapsack Problem Based on Rough Set Theory

摘要

A kind of algorithm is proposed in this paper to improve the searching efficiency, which combinates Rough Set Theory (RST) and Genetic Algorithm (GA) for 0-1 knapsack problem???The study is to utilize the knowledge discovery function of RST to find the important genes in GA. Then directed evolution is carried out according to the important genes. Finally,an example of four knapsack problem is used to test. The searching space is reduced and the important genes ensure the effective information will not be lost. The algorithm is able to improve the searching efficiency and the quality of GA .