A reduced markov model of GAs without the exact transition matrix

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

Volumn 3242, Issue , 2004, Pages 72-80

  Moey, Cheah C J ^a   Rowe, Jonathan E ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; GENETIC ALGORITHMS; MARKOV PROCESSES; POPULATION STATISTICS; PROBLEM SOLVING;

FINITE POPULATION; LUMPED MODELING; MARKOV MODEL; POPULATION SIZES; PROBABILITY TRANSITION MATRIX; SEARCH SPACE SIZE; SELECTION MUTATIONS; TRANSITION MATRICES;

ALGORITHMS;

EID: 31744447972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_8     Document Type: Article

References (15)

1. Spears, W.M., De Jong, K.A.: Analyzing GAs using Markov Chains with Semantically Ordered and Lumped States. In: Proceedings of Foundations of Genetic Algorithms, Morgan Kaufmann Publishers (1996)
2. Davis, T.E., Principe, J.C.: A markov chain framework for the simple genetic algorithm. Evolutionary Computation 1 (1993) 269-288
3. De Jong, K.A., Spears, W.M., Gordon, D.F.: Using Markov Chains to Analyze GAFOs. In Whitley, L.D., Vose, M.D., eds.: Proceedings of Foundations of Genetic Algorithms 3. Morgan Kaufmann, San Francisco, CA (1995) 115-137
4. He, J., Yao, X.: From an Individual to a Population: An Analysis of the First Hitting Time of Population-Based Evolutionary Algorithm. IEEE Transactions on Evolutionary Computation 6 (2003) 495-511
5. Nijssen, S., Bäck, T.: An Analysis of the Behaviour of Simplified Evolutionary Algorithms on Trap Functions. IEEE Transactions on Evolutionary Computation 7 (2003) 11-22
6. Rees, J., Koehler, G.J.: An Investigation of GA Performance Results for Different Cardinality Alphabets. In Davis, L.D., De Jong, K., Vose, M.D., Whitley, L.D., eds.: Evolutionary Algorithms. Springer, New York (1999) 191-206
7. Wright, A.H., Zhao, Y.: Markov chain models of genetic algorithms. In: GECCO-99 (Genetic and Evolutionary Computation Conference). Volume 1., Morgan Kaufmann Publishers (1999) 734-741
8. Spears, W.M.: A Compression Algorithm for Probability Transition Matrices. SIAM Journal on Matrix Analysis and Applications 20 (1998) 60-77
9. Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. The MIT Press, Cambridge, MA (1999)
10. Nix, A.E., Vose, M.D.: Modelling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5 (1992) 79-88
11. Wright, S.: Evolution in Mandelian populations. Genetics 16 (1931) 97-159
12. Fisher, R.A.: The genetical theory of natural selection. Oxford: Clarendon Press (1930)
13. Moey, C.C.J., Rowe, J.E.: Population Aggregation Based on Fitness. Natural Computing 3 (2004) 5-19
14. Rowe, J.E.: Population fixed-points for functions of unitation. In Reeves, C., Banzhaf, W., eds.: In Foundations of Genetic Algorithms. Volume 5. Morgan Kaufmann Publishers (1998)
15. Spears, W.M.: Aggregating Models of Evolutionary Algorithms. In Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A., eds.: Proceedings of the Congress on Evolutionary Computation. Volume 1., IEEE Press (1999) 631-638