A Lamarckian Evolution Strategy for Genetic Algorithms

A Prolog implementation of a simple Lamarckian evolution module for genetic algorithms is discussed. Lamarckian evolution posits that characteristics acquired during a phenotype's lifetime may be inherited by offspring. Although largely dismissed as a viable evolutionary theory for natural systems, Lamarckian evolution has proven effective within computer applications. The strengths of the implementation discussed here are its speed and simplicity -the latter promoting extensibility and specialization to particular applications.

[1]  John J. Grefenstette,et al.  Lamarckian Learning in Multi-Agent Environments , 1991, ICGA.

[2]  Yun Li,et al.  Model reduction in control systems by means of global structure evolution and local parameter learning , 1997 .

[3]  Hajime Kita,et al.  A comparison study of genetic codings for the traveling salesman problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[4]  Thomas Bck,et al.  Self-adaptation in genetic algorithms , 1991 .

[5]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[6]  William E. Hart,et al.  Optimization with genetic algorithm hybrids that use local searches , 1996 .

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

[8]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms in Engineering Applications , 1997, Springer Berlin Heidelberg.

[9]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[10]  Clive Richards,et al.  The Blind Watchmaker , 1987, Bristol Medico-Chirurgical Journal.

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