Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (7): 1743-1745.

Previous Articles     Next Articles

Study on crossover probability based on information entropy in genetic algorithms

LI Hui-xian1, PANG Liao-jun2, CAI Wan-dong1   

  1. 1. Coll. of Computer Science and Engineering, Northwestern Polytechnical Univ., Xi’an 710072, China;
    2. Key Lab. of Computer Networks and Information Security of the Ministry of Education, Xidian Univ., Xi’an 710071, China
  • Received:2008-04-02 Revised:2008-09-10 Online:2009-07-20 Published:2010-01-03

Abstract: To overcome the shortcomings of complex computation and easily falling into local optimums for the existing approaches to compute crossover probability,a novel method based on information entropy is presented.The entropy of the population shows the individuals’ evolving potential,and the variance of the population reflects the whole population distribution.The role of the crossover operator in the procedure of population evolving through the entropy of the population and the variance of the population is analyzed.Then,a new computing method is designed for crossover probability so as to get the better control of the evolving process of genetic algorithms.Numerical examples show the method of computing crossover probability can not only be used conveniently but also enhance the robustness,global optimization ability and the convergence speed of the genetic algorithm.The genetic algorithm with the new crossover probability can escape local optimums easily.

CLC Number: 

[an error occurred while processing this directive]