Chaotic populations in genetic algorithms

We set two objectives for this study: one is to emulate chaotic natural populations in GA (Genetic Algorithms) populations by utilizing the Logistic Chaos map model, and the other is to analyze the population fitness distribution by utilizing insect spatial distribution theory. Natural populations are so dynamic that one of the first experimental evidences of Chaos in nature was discovered by a theoretical ecologist, May (1976, Nature, 261,459-467)[30], in his analysis of insect population dynamics. In evolutionary computing, perhaps influenced by the stable or infinite population concepts in population genetics, the status quo of population settings has dominantly been the fixed-size populations. In this paper, we propose to introduce dynamic populations controlled by the Logistic Chaos map model to Genetic Algorithms (GA), and test the hypothesis - whether or not the dynamic populations that emulate chaotic populations in nature will have an advantage over traditional fixed-size populations. The Logistic Chaos map model, arguably the simplest nonlinear dynamics model, has surprisingly rich dynamic behaviors, ranging from exponential, sigmoid growth, periodic oscillations, and aperiodic oscillations, to complete Chaos. What is even more favorable is that, unlike many other population dynamics models, this model can be expressed as a single parameter recursion equation, which makes it very convenient to control the dynamic behaviors and therefore easy to apply to evolutionary computing. The experiments show result values in terms of the fitness evaluations and memory storage requirements. We further conjecture that Chaos may be helpful in breaking neutral space in the fitness landscape, similar to the argument in ecology that Chaos may help the exploration and/or exploitation of environment heterogeneity and therefore enhance a species' survival or fitness.

[1]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[2]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[3]  Mark Kot,et al.  Elements of Mathematical Ecology , 2001 .

[4]  Jerzy Neyman,et al.  On a New Class of "Contagious" Distributions, Applicable in Entomology and Bacteriology , 1939 .

[5]  Kay Chen Tan,et al.  Evolutionary algorithm with dynamic population size for multi-objective optimization , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.

[6]  Robert M. May,et al.  Simple mathematical models with very complicated dynamics , 1976, Nature.

[7]  James A. Foster,et al.  Using chaos in genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[8]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[10]  E. F. Khor,et al.  Evolutionary algorithms with goal and priority information for multi-objective optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[11]  G. Yen,et al.  Dynamic population size in multiobjective evolutionary algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[12]  W. Schaffer,et al.  Chaos reduces species extinction by amplifying local population noise , 1993, Nature.

[13]  L. Taylor.  Assessing and Interpreting the Spatial Distributions of Insect Populations , 1984 .

[14]  Joos Vandewalle,et al.  Computer Systems and Software Engineering , 1992, Springer US.

[15]  Gary G. Yen,et al.  Rank-density-based multiobjective genetic algorithm and benchmark test function study , 2003, IEEE Trans. Evol. Comput..

[16]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

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

[18]  T. White,et al.  Opposing paradigms: regulation or limitation of populations? , 2001 .

[19]  M. O. Odetayo.  Optimal population size for genetic algorithms: an investigation , 1993 .

[20]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[21]  Shiu Yin Yuen,et al.  Genetic algorithm with competitive image labelling and least square , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[22]  Zhanshan Ma,et al.  Ecological 'theatre' for evolutionary computing 'play': some insights from population ecology and evolutionary ecology , 2011, Int. J. Bio Inspired Comput..

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

[24]  Axel W. Krings,et al.  Dynamic populations in genetic algorithms , 2008, SAC '08.

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

[26]  Bradford A. Hawkins,et al.  Population regulation, emergent properties, and a requiem for density dependence , 2002 .

[27]  Xin Yao,et al.  Making use of population information in evolutionary artificial neural networks , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[28]  Zbigniew Michalewicz,et al.  GAVaPS-a genetic algorithm with varying population size , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[29]  G. Lamont,et al.  Simple genetic algorithm parameter selection for protein structure prediction , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[30]  Zhanshan Ma,et al.  Did we miss some evidence of chaos in laboratory insect populations? , 2011, Population Ecology.

[31]  Zhanshan Ma,et al.  Towards a Population Dynamics Theory for Evolutionary Computing: Learning from Biological Population Dynamics in Nature , 2009, AICI.

[32]  James A. Foster,et al.  Computational complexity and the genetic algorithm , 2001 .

[33]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[34]  L. R. Taylor,et al.  Aggregation, Variance and the Mean , 1961, Nature.

[35]  J.T. Alander,et al.  On optimal population size of genetic algorithms , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.

[36]  A. Rosa,et al.  An experimental study on dynamic random variation of population size , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[37]  Tong Heng Lee,et al.  Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization , 2001, IEEE Trans. Evol. Comput..

[38]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[39]  S. Iwao,et al.  A new regression method for analyzing the aggregation pattern of animal populations , 1968, Researches on Population Ecology.