A New Adaptive Crossover Operator for the Preservation of Useful Schemata

  • Fan Li
  • Qi-He Liu
  • Fan Min
  • Guo-Wei Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3930)


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.


Crossover Operator Crossover Point Decision Table Promising Performance Replacement Selection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Holland, J.: Adaptation in Natural and Artificial Systems. Michigan University Press, Ann Arbor (1975)Google Scholar
  2. 2.
    Goldberg, D.E.: Genetic Algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)MATHGoogle Scholar
  3. 3.
    Gabriel, S.B., et al.: The structure of haplotype blocks in the human genome. Science 296(5576), 2225–2229 (2002)CrossRefGoogle Scholar
  4. 4.
    Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
  5. 5.
    Park, J.-m., Park, J.-g., et al.: Robust and Efficient Genetic Crossover Operator: Homologous Recombination. In: Proceedings of 1993 International Joint Conference on Neural Networks, Nagoya, October, pp. 2975–2978 (1993)Google Scholar
  6. 6.
    Zaritsky, A., Sipper, M.: The Preservation of Favored Building Blocks in the Struggle for Fitness: The Puzzle Algorithm. IEEE Transactions on Evolutionary Computation 39(5), 443–455 (2004)CrossRefGoogle Scholar
  7. 7.
    Pawlak, Z., Grzymala-Busse, J., Slowinski, R., Ziarko, W.: Rough sets. Communication of the ACM 38(11), 89–95 (1995)CrossRefGoogle Scholar
  8. 8.
    Pawlak, Z.: Some issues on Rough Sets. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 1–58. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Zhang, W.-X., Wu, W.-Z., Liang, J.-Y., Li, D.-Y.: Rough Set Theory and Approach. Science Press, Beijng (2001)Google Scholar
  10. 10.
    Wong, S.K.M., Ziarko, W.: Optimal decision rules in decision. Bulletin of Polish Academy of Science 33(11-12), 693–696 (1985)MATHMathSciNetGoogle Scholar
  11. 11.
    Kryszkiewicz, M., Cichon, K.: Towards Scalable Algorithms for Discovering Rough Set Reducts. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 120–143. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Shao-Hui, L., Qiu-Jian, S., Bin, W., et al.: Research on Efficient Algorithms for Rough Set Methods. Chinese Journal of Computer 26(5), 524–529 (2003)Google Scholar
  13. 13.
    Bazan, J.: Dynamic reducts and statistical inference. In: Proceedings of the Sixth International Conference, Information Processing and Management of uncertainty in Knowledge-Based Systems, Granada, Spain, July 1996, pp. 1147–1152 (1996)Google Scholar
  14. 14.
    Emmanouilidis, C., Hunter, A., MacIntyre, J.: A Multiobjective Evolutionary Setting for Feature Selection and a Commonality-Based Crossover Operator. In: Proceedings of the 2000 Congress on Evolutionary Computation, La Jolla, pp. 309–316 (2000)Google Scholar
  15. 15.
    Peter, A.N., Bosman, D.T.: The Balance Between Proximity and Diversity in Multiobjective Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 7(2), 443–455 (2003)Google Scholar
  16. 16.
    Li, F., Liu, Q., Yang, G.: A Heuristic Algorithm for Attribute Reduction in Incomplete Information Systems. In: Progress in Intelligence Computation and Applications, Wuhan, April 2005, pp. 574–580 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fan Li
    • 1
  • Qi-He Liu
    • 1
  • Fan Min
    • 1
  • Guo-Wei Yang
    • 1
  1. 1.College of computer science and engineeringUniversity of Electronic Science and Technology of ChinaChengduP.R. China

Personalised recommendations