Theory of coevolutionary genetic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2745, Issue , 2003, Pages 285-293

  Schmitt, Lothar M ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Coevolution; Convergence of genetic algorithms; Parallel processing; Simulated annealing

Indexed keywords

GENETIC ALGORITHMS; SIMULATED ANNEALING; STOCHASTIC SYSTEMS;

CO-EVOLUTION; CO-EVOLUTIONARY; COEVOLUTIONARY GENETIC ALGORITHM; FITNESS FUNCTIONS; GLOBALOPTIMUM; PARALLEL PROCESSING;

ALGORITHMS;

EID: 35248830365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37619-4_29     Document Type: Article

References (21)

1. E.H.L. Aarts, P.J.M. van Laarhoven. Simulated Annealing: An Introduction. Statist. Neerlandica 43 (1989) 31-52
2. H.-G. Beyer, et al. How to analyse evolutionary algorithms, Theoret. Comput. Sci. 287 (2002) 101-130
3. A. Bucci, J.B. Pollack: A Mathematical Framework for the Study of Coevolution. IN: C. Cotta, et al. (chairs). Proc. of FOGA VII. Morgan Kaufmann, San Francisco, CA, USA (2003)
4. T.E. Davis, J.C. Principe: A Markov Chain Framework for the Simple Genetic Algorithm. Evol. Comput. 1 (1993) 269-288
5. K. De Jong: Lecture on Coevolution. IN: H.-G. Beyer, et al. (chairs). Seminar "Theory of Evolutionary Computation 2002", Max Planck Inst. for Comput. Sci. Conf. Cent., Schloß Dagstuhl, Saarland, Germany (2002)
6. D.E. Goldberg: Genetic Algorithms, in Search, Optimization & Machine Learning. Addison-Wesley, Boston, MA, USA (1989)
7. D.L. Isaacson, R.W. Madsen. Markov Chains: Theory and Applications Prentice-Hall, Upper Saddle River, NJ, USA (1961)
8. A.E. Nix, M.D. Vose: Modeling Genetic Algorithms with Markov Chains. Ann. Math. Artif. Intell. 5 (1992) 79-88
9. H.H. Schaefer. Banach Lattices and Positive Operators. Springer Verlag, Berlin, Berlin, Germany (1974)
10. L.M. Schmitt, et al.. Linear Analysis of Genetic Algorithms. Theoret. Comput. Sci. 200 (1998) 101-134
11. L.M. Schmitt, C.L. Nehaniv: The Linear Geometry of Genetic Operators with Applications to the Analysis of Genetic Drift and Genetic Algorithms using Tournament Selection. Lect. on Math. in the Life Sci. 26, AMS, Providence, RI, USA (1999) 147-166
12. L.M. Schmitt. Theory of Genetic Algorithms. Theoret. Comput. Sci. 259 (2001) 1-61
13. L.M. Schmitt: Theory of Genetic Algorithms II. - Convergence to optima for arbitrary fitness function - . Tech. Rep. 2002-2-002, Aizu Univ. (2002).
14. To app. in Theoret. Comput. Sci.
15. L.M. Schmitt: Asymptotic Convergence of Scaled Genetic Algorithms to Global Optima - A gentle introduction to the theory. IN: A. Menon (ed.), Computing Horizons: The Hilbert Challenge Essays on the Frontiers of Evolutionary Computation, (to app.). Kluwer Ser. in Evol. Comput. (D.E. Goldberg, ed.), Kluwer, Dordrecht, The Netherlands (2003)
16. L.M. Schmitt: Coevolutionary Convergence to Global Optima. Tech. Rep. 2003-2-002, Aizu Univ. (2003), 1-12.
17. Poster in Proc. GECCO 2003, Lect. Notes in Comput. Sci., Springer Verlag, Berlin, Berlin, Germany (2003)
18. L.M. Schmitt: Optimization with Genetic Algorithms in Multi-Species Environments. To appear: Proc. ICCIMA '03, Int. Conf. on Comput. Intelligence and Multimedia Appl., IEEE Press, New York, NY (2003)
19. K.O. Stanley, R. Miikkulainen: Continual Coevolution Through Complexification. IN: W.B. Langdon, et al. (eds.). Proc. GECCO 2002. Morgan Kaufmann, San Francisco, CA, USA (2003) 113-120
20. M.D. Vose: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA, USA (1999)
21. M.D. Vose, G.E. Liepins: Punctuated Equilibria in Genetic Search. Complex Systems 5 (1991) 31-44