Maximum a Posteriori Based Evolutionary Algorithm

This work is dedicated to the presentation and the analysis of the performance of Maximum a posteriori based Evolutionary Algorithm (MEA). MEA allows a hybridization of set of operators to preserve the diversity during the search. This approach is based on a set of search strategies which are composed of one crossover with one mutation method, respectively. The algorithm uses the Maximum a Posteriori Principle (MAP) to select the most probable strategy from those available in the search set. Experiments were performed on well-known continuous optimization problems to observe the impact of population size and operators rates on MEA’s behaviour, robustness and performance.