Modelling genetic algorithms: From Markov chains to dependence with complete connections

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

Volumn 1498 LNCS, Issue , 1998, Pages 3-12

  Agapie, Alexandru ^a  

^a NATIONAL INSTITUTE FOR RESEARCH AND DEVELOPMENT IN MICROTECHNOLOGIES   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COMPLETE CONNECTION; CONVERGENCE CONDITIONS; FINITE POPULATION; GLOBALLY CONVERGENT; MARKOV CHAIN ANALYSIS; RANDOM SYSTEMS;

MARKOV PROCESSES;

EID: 0004002570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056844     Document Type: Conference Paper

References (25)

1. Aarts, E.H.L., Eiben, A.E., Van Hee, K.M.: A General Theory of Genetic Algorithms. Computing Science Notes, Eindhoven University of Technology, (1989)
2. Agapie, A.: Genetic Algorithms: Minimal Conditions for Convergence. LNCS series 1363, Artificial Evolution, Springer (1998) 183-193.
3. Bäck, T.: The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. PPSN 2, Amsterdam: North Holland (1992) 85-94
4. Davis, T.E., Principe, J.C.: A Markov Chain Framework for the Simple Genetic Algorithm. Evol. Comp. 1, Vol. 3 (1993) 269-288
5. Eiben, A.E., Aarts, E.H.L, Van Hee, K.M.: Global Convergence of Genetic Algorithms: a Markov Chain Analysis. PPSN 1, Springer, Berlin (1990) 4-12
6. Fogel, D.B.: Evolutionary Computation - Toward a New Philosophy of Machine Intelligence. IEEE Press (1995) 121-143
7. Goldberg, D.E., Segrest, P.: Finite Markov chain analysis of genetic algortihms. Proc. ICGA '87 (1987) 1-8
8. Holland, J.H.: Adaptation in natural and artificial systems. Ann. Arbor, The Univ. of Michigan Press (1975)
9. Horn, J.: Finite Markov Chain Analysis of Genetic Algorithms with Niching. Proc. ICGA '93 (1993) 110-117
10. Iosifescu, M.: Finite Markov chains and applications. Techn. Publ., Bucharest, (1977)
11. Iosifescu, M.: Finite Markov Processes and Their Applications. Chichester: Wiley (1980)
12. Iosifescu, M., Grigorescu, S.: Dependence with complete connections and its applications. Cambridge Univ. Press (1990)
13. nd ed., Springer-Verlag (1994) 64-69
14. Muehlenbein, H.: How genetic algorithms really work I: Mutation and hillclimbing. PPSN 2, Amsterdam: North Holland (1992) 15-25
15. Nix, A.E., Vose, M.D.: Modelling genetic algorithms with Markov chains. Ann. Math, and AI 5 (1992) 79-88
16. Rudolph, G.: Convergence Analysis of Canonical Genetic Algorithms. IEEE Tr. on NN. 1, Vol. 5 (1994) 98-101
17. Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Kovac, Hamburg (1997)
18. Qi, X., Palmieri, F.: Theoretical Analysis of Evolutionary Algorithms, I-II. IEEE Tr. on NN. 1, Vol. 5 (1994) 102-129
19. nd ed. Springer, New York (1981)
20. Salomon, R.: Raising Theoretical Questions about the Utility of Genetic Algorithms. Proc. EP '97, LNCS Series, Springer (1997) 275-284
21. Suzuki, J.: A Markov Chain Analysis of a Genetic Algorithm. Proc. ICGA'93, Urbana Illinois, Morgan Kaufmann (1993) 46-153
22. Uesaka, Y.: Convergence of algorithm and the schema theorem in genetic algorithms Proc. ICANGA (1995) 210-213
23. Vose, M.D.: Modelling Simple Genetic Algorithms. Foundations of Genetic Algorithms II, San Mateo, CA: Morgan Kaufmann (1993) 63-73
24. Whitley, D.: Modelling Hybrid Genetic Algorithms. Genetic Algorithms in Engineering and Computer Science, Wiley (1995) 191-201
25. Wolpert D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Tr. on EC. 1, Vol. 1 (1997) 67-82