Growth curves and takeover time in distributed evolutionary algorithms

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

Volumn 3102, Issue , 2004, Pages 864-876

  Alba, Enrique ^a   Luque, Gabriel ^a  

^a ETSI Informatica   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ANALYTICAL APPROACH; DISTRIBUTED EVOLUTIONARY ALGORITHMS; FREQUENCY EFFECT; HYPERGRAPH MODEL; LOGISTIC MODELS; MIGRATION RATES; SELECTION PRESSURES; TAKEOVER TIME;

EVOLUTIONARY ALGORITHMS;

EID: 35048849985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_88     Document Type: Article

References (13)

1. Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6 (2002) 443-462
2. Gordon, V.S., Whitley, D.: Serial and Parallel Genetic Algorithms as Function Optimizers. In Forrest, S., ed.: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann (1993) 177-183
3. Alba, E., Troya, J.M.: Influence of the Migration Policy in Parallel dGAs with Structured and Panmictic Populations. Applied Intelligence 12 (2000) 163-181
4. Sarma, J., De Jong, K.: An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms. In Voigt, H.M., Ebeling, W., Rechenberg, L, Schwefel, H.P., eds.: PPSN IV. Volume 1141 of LNCS., Springer (1996) 236-244
5. Sarma, J., De Jong, K.: An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm. In Bäck, T., ed.: Proceedings of the 7th International Conference on Genetic Algorithms, Morgan Kaufmann (1997) 181-186
6. Gorges-Schleuter, M.: An Analysis of Local Selection in Evolution Strategies. In Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference. Volume 1., Orlando, Florida, USA, Morgan Kaufmann (1999) 847-854
7. Rudolph, G.: Takeover Times in Spatially Structured Populations: Array and Ring. In Lai, K.K., Katai, O., Gen, M., Lin, B., eds.: 2nd Asia-Pacific Conference on Genetic Algorithms and Applications, Global-Link Publishing (2000) 144-151
8. Giacobini, M., Tettamanzi, A., Tomassini, M.: Modelling Selection Intensity for Linear Cellular Evolutionary Algorithms. In Liardet, P., et al., eds.: Artificial Evolution, Sixth International Conference, Springer Verlag (2003)
9. Giacobini, M., Alba, E., Tomassini, M.: Selection Intensity in Asynchronous Cellular Evolutionary Algorithms. In Cantú-Paz, E., ed.: Proceedings of the Genetic and Evolutionary Computation Conference, Chicago, USA (2003) 955-966
10. Sprave, J.: A Unified Model of Non-Panmictic Population Structures in Evolutionary Algorithms. In Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A., eds.: Proceedings of the Congress of Evolutionary Computation. Volume 2., Mayflower Hotel, Washington D.C., USA, IEEE Press (1999) 1384-1391
11. Goldberg, D.E., Deb, K.: A Comparative Analysis of Selection Schemes Used in Genetic Algorithms. In Rawlins, G.J., ed.: Foundations of Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1991) 69-93
12. Chakraborty, U.K., Deb, K., Chakraborty, M.: Analysis of Selection Algorithms: A Markov Chain Approach. Evolutionary Computation 4 (1997) 133-167
13. Cantú-Paz, E.: 7. Migration, Selection Pressure, and Superlinear Speedups. In: Efficient and Accurate Parallel Genetic Algorithms. Kluwer (2000) 97-120