publisher_address = "New York, NY, 10286-1405, USA",
month = "8-12 " # jul,
organisation = "ACM SIGEVO (formerly ISGEC)",
keywords = "genetic algorithms, genetic programming, binomial-3,
MAX binary tree problem, optimal, population sizing,
problem difficulty, sizing, Automatic Programming,
program synthesis, Algorithms, Performance,
Experimentation: Poster",
size = "2 pages",
abstract = "The population size in evolutionary computation is a
significant parameter affecting computational effort
and the ability to successfully evolve solutions. We
find that population size sensitivity - how much a
genetic program's efficiency varies with population
size - is correlated with problem complexity. An
analysis of population sizes was conducted using a
unimodal, bimodal and a multi-modal problem with
varying levels of difficulty. Specifically we show that
a unimodal and bimodal and multimodal problems exhibit
an increased sensitivity to population size with
increasing levels of difficulty. We demonstrate that as
problem complexity increases, determination of the
optimal population size becomes more difficult.
Conversely, the less complex a problem is the more
sensitive the genetic program's efficiency is to
population size.",
notes = "GECCO-2006 A joint meeting of the fifteenth
international conference on genetic algorithms
(ICGA-2006) and the eleventh annual genetic programming
conference (GP-2006).