A more realistic genetic algorithm

Genetic Algorithms (GAs) are loosely based on the concept of the natural cycle of reproduction with selective pressures favouring the individuals which are best suited to their environment (i.e. fitness function). However, there are many features of natural reproduction which are not replicated in GAs, such as population members taking some time to reach puberty. This thesis describes a programme of research which set out to investigate what would be the impact on the performance of a GA of introducing additional features which more closely replicate real life processes. The motivation for the work was curiosity. The approach has been tested using various standard test functions. The results are interesting and show that when compared with a Canonical GA, introducing various features such as the need to reach puberty before reproduction can occur and risk of illness can enhance the effectiveness of GAs in terms of the overall effort needed to find a solution. As the method simulating the nature rules, Cardiff Genetic Algorithm (CGA) introduces several features to each individual in programming modelling the real world. Each individual of the population is given a life-span and an age, the population size is allowed to vary; and rather than generations, the concept of time steps is introduced with each individual living for a number of time steps. An additional feature is also discussed involving multiple populations which have to compete for a limited resource which can be thought of as “water”. This together with an illness parameter and accidental death are used to study the behaviour of these populations

[1]  Colin R. Reeves,et al.  Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.

[2]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

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

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

[5]  I. C. Parmee,et al.  Multi-objective analysis of a component-based representation within an interactive evolutionary design system , 2007 .

[6]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[7]  N. Schraudolph,et al.  Dynamic Parameter Encoding for Genetic Algorithms , 1992, Machine Learning.

[8]  C. Fonseca.  Evolutionary multi-criterion optimization : Second International Conference, EMO 2003, Faro, Portugal, April 8-11, 2003 : proceedings , 2003 .

[9]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[10]  Emanuel Falkenauer,et al.  Genetic Algorithms and Grouping Problems , 1998 .

[11]  Alice B. Kehoe.  Humans: An Introduction to Four-Field Anthropology , 1998 .

[12]  Ian F. C. Smith,et al.  Fundamentals of Computer-Aided Engineering , 2003 .

[13]  John J. Grefenstette,et al.  Competition-Based Learning , 1993 .

[14]  Richard Balling,et al.  The Maximin Fitness Function; Multi-objective City and Regional Planning , 2003, EMO.

[15]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[16]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[17]  Greg Perry.  Sams Teach Yourself Beginning Programming in 24 Hours , 1998 .

[18]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

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

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

[21]  Michael C. Fu,et al.  A Model Reference Adaptive Search Method for Global Optimization , 2007, Oper. Res..

[22]  Herbert Schildt,et al.  C++ from the ground up , 1998 .

[23]  Peter J. Fleming,et al.  Genetic Algorithms in Engineering Systems , 1997 .

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

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

[26]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[27]  Scott Robert Ladd,et al.  Genetic algorithms in C , 1995 .

[28]  Scott Meyers,et al.  Effective C++: 55 Specific Ways to Improve Your Programs and Designs (3rd Edition) , 1991 .