Population sizing for entropy-based model building in genetic algorithms
20 June 2006Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2006). lliGAL report no. 2006020. University of Illinois at Urbana Champaign. [Full paper - PDF] [Full paper - PS] .
Abstract:
This paper presents a population-sizing model for the entropy-based model building in genetic algorithms. Specifically, the population size required for building an accurate model is investigated. The effect of the selection pressure on population sizing is also incorporated. The proposed model indicates that the population size
required for building an accurate model scales as Θ(m log m), where m is the number of substructures and proportional to the problem size. Experiments are conducted to verify the derivations, and the results agree with the proposed model.
Related Posts:
- Population sizing for entropy-based model building in genetic algorithms
- Population sizing for genetic programming based upon decision making
- How well does a single-point crossover mix building blocks with tight linkage?
- Efficiency enhancement of probabilistic model building genetic algorithms
- Scalability of selectorecombinative genetic algorithms for problems with tight linkage
No comments yet
