The behaviour of genetic drift in a spatially-structured evolutionary algorithm

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 2, Issue , 2005, Pages 1855-1860

  Dick, Grant ^a   Whigham, Peter ^a  

^a UNIVERSITY OF OTAGO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; SEARCH ENGINES;

ABSTRACT MODELS; GENETIC DRIFT; POPULATION MODELS; SPATIAL STRUCTURES;

EVOLUTIONARY ALGORITHMS;

EID: 27144486396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. E. Cantú-Paz, Efficient and Accurate Parallel Genetic Algorithms. Kulwer Academic Publishers, 2001.
2. Marco Tomassini, "Parallel and Distributed Evolutionary Algorithms: A Review," in Evolutionary Algorithms in Engineering and Computer Science, K. Miettinen, M. M. Mäkelä, P. Neittaanmäki, and J. Periaux, Eds. Chichester, UK: John Wiley & Sons, Ltd, 1999, pp. 113-133.
3. D. E. Goldberg and K. Deb, "A comparative analysis of selection schemes used in genetic algorithms," in Proceedings of the First Workshop on Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo: Morgan Kaufmann, July 15-18 1991, pp. 69-93.
4. K. D. Jong and J. Sarma, "On decentralizing selection algorithms," in Proceedings of the 6th International Conference on Genetic Algorithms, L. J. Eshelman, Ed. San Francisco: Morgan kaufmann Publishers, July 15-19 1995, pp. 17-23.
5. J. Sarma and K. D. Jong, "An analysis of local selection algorithms in a spatially structured evolutionary algorithm," in Proceedings of the 7th International Conference on Genetic Algorithms, T. Bäck, Ed. San Francisco: Morgan Kaufmann, July 19-23 1997, pp. 181-187.
6. T. Blickle and L. Thiele, "A comparison of selection schemes used in evolutionary algorithms," Evolutionary Computation, vol. 4, no. 4, pp. 361-394, 1997.
7. M. Kimura, The Neutral Theory of Molecular Evolution. Cambridge University Press, 1983.
8. J. F. Crow and M. Kimura, Introduction to Population Genetics Theory, 1970.
9. Hideki Asoh and Heinz Mühlenbein, "On the mean convergence time of evolutionary algorithms without selection and mutation," in Parallel problem solving from nature: PPSN III, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds. Berlin: Springer-Verlag, 1994, pp. 88-97.
10. G. G. Robertson, "Parallel implementation of genetic algorithms in a classifier system," in Proceedings of the 2nd International Conference on Genetic Algorithms (ICGA87), J. J. Grefenstette, Ed. Cambridge, MA: Lawrence Erlbaum Associates, 7 1987, pp. 140-147
11. also Technical Report TR-159 RL87-5 Thinking Machines Corporation.
12. B. Manderick and P. Spiessens, "Fine-grained parallel genetic algorithms," in Proceedings of the 3rd International Conference on Genetic Algorithms, J. D. Schaffer, Ed. George Mason University: Morgan Kaufmann, June 1989, pp. 428-433.
13. M. Schwehm, 22Implementation of genetic algorithms on various interconnection networks," in Parallel Computing and Transputer Applications, M. Valero, E. Onate, M. Jane, J. L. Larriba, and B. Suarez, Eds. Amsterdam: IOS Press, 1992, pp. 195-203.
14. G. Rudolph, "On takeover times in spatially structured populations: Array and ring," in Proceedings of the Second Asia-Pacific Conference on Genetic Algorithms and Applications (APGA '00), K. K. Lai, O. Katai, M. Gen, and B. Lin, Eds. Hong Kong, PR China: Global-Link Publishing Company, 2000, pp. 144-151. [Online]. Available: http://ls11-www.cs.unidortmund.de/rudolph/papers/ apga2000.ps.gz
15. M. Giacobini, E. Alba, and M. Tomassini, "Selection intensity in asynchronous cellular evolutionary algorithms," in Genetic and Evolutionary Computation GECCO-2003, ser. LNCS, E. Cantú-Paz, J. A. Foster, K. Deb, D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M. A. Potter, A. C. Schultz, K. Dowsland, N. Jonoska, and J. Miller, Eds., vol. 2723. Chicago: Springer-Verlag, 12-16 July 2003, pp. 955-966.
16. H. C. Berg, Random Walks in Biology. Princeton University Press, 1983.
17. G. R. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller, "The gambler's ruin problem, genetic algorithms, and the sizing of populations." Evolutionary Computation, vol. 7, no. 3, pp. 231-253, 1999.