Application and the Conditional Granularity Entropy Operator in the Genetic Algorithms

In order to solve the problem which the heredity genes of the chromosomes are relatively more in the classical genetic algorithms, a new operator is put forward in this paper. The algorithm turns the group´s character information into the information system which is used in the granular computing, and makes use of the conditional granularity entropy to reduce the genes when the value is larger relatively, so that it can reduce the computational complexity. The experiment shows the algorithm rationality when the problems are analyzed.