Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The balance between proximity and diversity in multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
The preservation of favored building blocks in the struggle for fitness: the puzzle algorithm
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
In genetic algorithms, commonly used crossover operators such as one-point, two-point and uniform crossover operator are likely to destroy the information obtained in the evolution because of their random choices of crossover points. To overcome this defect, a new adaptive crossover operator based on the Rough Set theory is proposed in this paper. By using this specialized crossover operator, useful schemata can be found and have a higher probability of surviving recombination regardless of their defining length. We compare the proposed crossover operator’s performance with the two-point crossover operator on several typical function optimization problems. The experiment results show that the proposed crossover operator is more efficient.