Control of the number of random imigrants in genetic algorithms for protein structure prediction

In the Genetic Algorithm with the standard random immigrants approach, a fixed number of individuals of the current population are replaced by random individuals in every generation. The rate of replaced individuals is defined a priori, and has a great impact on the performance of the algorithm. In this paper we present a new strategy to control the number of random immigrants in Genetic Algorithms applied to the protein structure prediction problem. Instead of using a fixed number of new individuals per generation, the proposed approach increases or decreases the number of new individuals to be inserted in the generation according to a self-organizing process. Results show that with the algorithm can determine the number of replaced individuals per generation in a self-organized way.

[1]  F. Collins,et al.  Principles of Biochemistry , 1937, The Indian Medical Gazette.

[2]  Shengxiang Yang,et al.  A self-organizing random immigrants genetic algorithm for dynamic optimization problems , 2007, Genetic Programming and Evolvable Machines.

[3]  R. Lavery,et al.  A new approach to the rapid determination of protein side chain conformations. , 1991, Journal of biomolecular structure & dynamics.

[4]  P. Ananthalakshmi,et al.  CADB: Conformation Angles DataBase of proteins , 2003, Nucleic Acids Res..

[5]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.