2003
008
Optimal Sampling for Genetic Algorithms on the Sampled OneMax Problem
Yu, T.-L., Goldberg, D. E., Sastry, K. (2003)
TR No.: 2003008 | Download PDF | Download PS
TR No.: 2003008 | Download PDF | Download PS
Abstract:
This paper investigates the optimal sampling and the speed-up obtained through sampling for the sampled OneMax problem. Theoretical and experimental analyses are given for three different population-sizing models: the decision-making model, the gambler’s ruin model, and the fixed
population-sizing model. The results suggest that, when the desired solution
quality is fixed to a high value, the decision-making model prefers a large
sampling size, the fixed population-sizing model prefers a small sampling
size, and the sampling makes no difference for the gambler’s ruin model. The speed-up obtained by sampling is then empirically verified.
Posted: February 8th, 2003 under Genetic algorithms.
Comments: none
Write a comment