A Simple Real-Coded ECGA Luca Fossati, Pier Luca Lanzi, Kumara Sastry, David E. Goldberg, Osvaldo Gomez Politecnico di Milano, Italy Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, USA CEC 2007, Singapore, September 25th, 2007
Real-coded EDAs are complex and difficult to analyze What is our goal? The simplest real-coded EDA possible Elementary discretization + χECGA
ECGA Population MPM Model Selection New Population
Simple Real Coded ECGA Real-Valued Population Selection X-ary Population χECGA … New X-ary Population New Real-Valued Population Intervals I i,j Restrict Tournament Replacement (RTR)
Class of additively separable problems The population size scales sub-quadratically with problem size The number of function evaluations scales sub-cubically with problem size Simple, amenable for further empirical and theoretical analysis First step towards a systematic analysis of real-coded ECGA
What next? More experiments Scalability analysis Relation between discretization and performance … virtual alphabets?