Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms

Details Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms

2011-02-02

arxiv.org/abs/1102.0588v2

Computer Science

Data Structures and Algorithms

26 pages, 1 table

Scientific paper

We present two adaptive schemes for dynamically choosing the number of parallel instances in parallel evolutionary algorithms. This includes the choice of the offspring population size in a (1+$\lambda$) EA as a special case. Our schemes are parameterless and they work in a black-box setting where no knowledge on the problem is available. Both schemes double the number of instances in case a generation ends without finding an improvement. In a successful generation, the first scheme resets the system to one instance, while the second scheme halves the number of instances. Both schemes provide near-optimal speed-ups in terms of the parallel time. We give upper bounds for the asymptotic sequential time (i.e., the total number of function evaluations) that are not larger than upper bounds for a corresponding non-parallel algorithm derived by the fitness-level method.

Affiliated with

Also associated with

No associations

Rating

Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427105