Affinity genetic algorithm

Based on some phenomena from human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals will be ensured to survive for some generations in order for them to have time to show their good genes; new individuals and the old ones are balanced to have the advantages of both. In order to quantitatively analyze the selective pressure, the concept of selection degree and a simple linear control equation are introduced. We can maintain the diversity of the evolutionary population by controlling the value of the selection degree. Performance of aGA is further enhanced by incorporating local search strategies.

[1]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[3]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[4]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .

[5]  G. Williams.  Adaptation and Natural Selection. (Book Reviews: Adaptation and Natural Selection: A Critique of Some Current Evolutionary Thought) , 2018 .

[6]  Andrew Lim,et al.  Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem , 2003, GECCO.

[7]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[8]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[9]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[14]  Surya B. Yadav,et al.  The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[15]  Francisco Herrera,et al.  Gradual distributed real-coded genetic algorithms , 2000, IEEE Trans. Evol. Comput..

[16]  Tapabrata Ray,et al.  Society and civilization: An optimization algorithm based on the simulation of social behavior , 2003, IEEE Trans. Evol. Comput..

[17]  Shu-Yuen Hwang,et al.  A Genetic Algorithm with Disruptive Selection , 1993, ICGA.

[18]  Xinchao Zhao,et al.  Multiple bit encoding-based search algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[19]  Zhao Xinchao.  A GREEDY GENETIC ALGORITHM FOR UNCONSTRAINED GLOBAL OPTIMIZATION , 2005 .

[20]  Yeongho Kim,et al.  Tournament Competition and its Merits for Coevolutionary Algorithms , 2003, J. Heuristics.

[21]  Robert G. Reynolds,et al.  A Cultural Algorithm Framework to Evolve Multi-Agent Cooperation with Evolutionary Programming , 1997, Evolutionary Programming.