By Topic

Analysis of Scalable Parallel Evolutionary Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun He ; School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, U.K. and Scho ol of Computer Science, Beijing Jiaotong University, China. (Email: ; Xin Yao

Inherent parallelism is regarded as one of the most important advantages of evolutionary algorithms. This paper aims at making an initial study on the speedup of scalable parallel evolutionary algorithms. First the scalable parallel evo lutionary algo rithms are described; then the speedup of such scalable algorithms is defined based on the first hitting time; Using the new definition, the relationship between population diversity and superlinear speedup is analyzed; finally a case study demonstra tes how population diversity plays a crucial role in generating the superlinear speedup.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

16-21 July 2006