An estimation of distribution algorithm based on maximum entropy

Abstract

Estimation of distribution algorithms (EDA) are similar to genetic algorithms except that they replace crossover and mutation with sampling from an estimated probability distribution. We develop a framework for estimation of distribution algorithms based on the principle of maximum entropy and the conservation of schema frequencies. An algorithm of this type gives better performance than a standard genetic algorithm (GA) on a number of standard test problems involving deception and epistosis (i.e. Trap and NK). © Springer-Verlag Berlin Heidelberg 2004.