Takeover time in parallel populations with migration

Bioinspired Optimization Methods and their Applications - Proceedings of the 2nd International Conference on Bioinspired Optimization Methods and their Applications, BIOMA 2006

Volumn , Issue , 2006, Pages 63-72

  Rudolph, Günter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Migration model; Spatially structured population; Takeover time

Indexed keywords

BI-DIRECTIONAL RINGS; CONNECTED GRAPH; INITIAL POPULATION; MIGRATION MODEL; MIGRATION PATH; NUMBER OF ITERATIONS; SELECTION METHODS; STRUCTURED POPULATION; TAKEOVER TIME; UPPER BOUND;

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

References (11)

1. E. Alba and A. Luque. Growth curves and takeover time in distributed evolutionary algorithms. In Proc. Genetic and Evolutionary Computation Conference (GECCO 2004), pages 864-876, Seattle, WA, USA, 2004.
2. U. Chakraborty, K. Deb, and M. Chakraborty. Analysis of selection algorithms: A Markov chain approach. Evol. Comput., 4(2):133-167, 1996.
3. H.A. David. Order Statistics. 2nd edition, Wiley, New York, 1981.
4. M. Giacobini, M. Tomassini, and A. Tettamanzi. Modeling selection intensity for linear cellular evolutionary algorithms. In Proc. 6th International Conference on Artificial Evolution (EA'03), Marseille, France, 2003.
5. M. Giacobini, E. Alba, M. Tomassini, and A. Tettamanzi. Modeling selection intensity for toroidal cellular evolutionary algorithms. In Proc. Genetic and Evolutionary Computation Conference (GECCO 2004), pages 1138-1149, Seattle, WA, USA, 2004.
6. M. Giacobini, M. Tomassini, and A. Tettamanzi. Takeover time curves in random and small-world structured populations. In Proc. Genetic and Evolutionary Computation Conference (GECCO 2005), pages 1333-1340, Washington, DC, USA, 2005.
7. D.E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, 1991, pp. 66-93.
8. G. Rudolph. On takeover times in spatially structured populations: Array and ring. In Proc. 2nd Asia-Pacific Conference on Genetic Algorithms and Applications, pages 144-151, Hong Kong, 2000.
9. G. Rudolph. Takeover times and probabilities of non-generational selection rules. In Proc. Genetic and Evolutionary Computation Conference (GECCO 2000), pages 903-910, Las Vegas, NV, USA, 2000.
10. G. Rudolph. Takeover times of noisy non-generational selection rules that undo extinction. In Proc. 5th International Conference on Artificial Neural Nets and Genetic Algorithms (ICANNGA 2001), pages 268-271, Prague, Czech Republic, 2001.
11. J. Smith and F. Vavak. Replacement strategies in steady state genetic algorithms: Static environments. In W. Banzhaf and C. Reeves, editors, Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, USA, 1999, pp. 219-233.