Expanding from discrete to continuous estimation of distribution algorithms: The IDEA

Abstract

The direct application of statistics to stochastic optimization based on iterated density estimation has become more important and present in evolutionary computation over the Last few years. The estimation of densities over selected samples and the sampling from the resulting distributions, is a combination of the recombination and mutation steps used in evolutionary algorithms. We introduce the framework named IDEA to formalize this notion. By combining continuous probability theory with techniques from existing algorithms, this framework allows us to define new continuous evolutionary optimization algorithms.