Analysis of scalable parallel evolutionary algorithms

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 120-127

  He, Jun ^a,b   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; POPULATION STATISTICS; PROBLEM SOLVING; SCALABILITY;

PARALLEL EVOLUTIONARY ALGORITHMS; POPULATION DIVERSITY; SUPERLINEAR SPEEDUP;

EVOLUTIONARY ALGORITHMS;

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

References (9)

1. H. Mühlenbein, "Evolution in time and space-the parallel genetic algorithm." in Proc. o f the 1st Workshop on Foundations of Genetic Algorithms., G. J. E. Rawlins, Ed. Mor gan Kaufmann, 1991, pp. 316-337.
2. E. Cantú-Paz, "Markov chain models of parallel genetic algorithms," IEEE Trans. on Evolution ary Computation, vol. 4, no. 3, pp. 216-226, 2000.
3. E. Alba and M. Tomassini, "Parallelism and evolutionary algorithms." IEEE Trans. Evolutionary Computation, vol. 6, no. 5, pp. 443-462, 2002.
4. E. Alba, "Parallel evolutionary algorithms can achieve super-linear performance." Inf. Process. Lett., vol. 82, no. 1, pp. 7-13, 2002.
5. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of populati on-based evolutionary algorithms," IEEE Trans. on Evolutionary Computation, vol. 6, no. 5, pp. 495-511, 2002.
6. R. Shonkwiler, "Parallel genetic algorithms." in Proc. of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann, 1993, pp. 199-205.
7. W. Rivera, "Scalable parallel genetic algorithms." Artif. Intell. Rev., vol. 16, no. 2, pp. 153-168, 2001.
8. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artificial Intelligence, vol. 127, no. 1, pp. 57-85, 2001.
9. mphArtificial Intelligence, vol. 145, no. 1-2, pp. 59-97, 2003.