Abstract :
Quantum Genetic Algorithm (QGA) is a promising area in the field of computational intelligence nowadays. Although some genetic algorithms to find minimal reduct of attributes have been proposed, most of them have some defects. On the other hand, quantum genetic algorithm has some advantages, such as strong parallelism, rapid good search capability, and small population size. In this paper, we propose a QGA to find minimal reduct based on distinction table. The algorithm can obtain the best solution with one chromosome in a short time. It is testified by two experiments that our algorithm improves the GA from four points of view: population size, parallelism, computing time and search capability.
