Estimation of distribution algorithms (EDAs) are stochastic optimization techniques that
explore the space of potential solutions by building and sampling explicit probabilistic models of promising candidate solutions.
This explicit use of probablistic models in optimization offers some significant advantages over other types of metaheuristics.
This paper discusses these advantages and outlines many of the different types of EDAs.
In addition, some of the most powerful efficiency enhancement techniques applied to EDAs are discussed and some of the key theoretical results relevant to EDAs are outlined.
Keywords: stochastic optimization , estimation of distribution algorithms, probabilistic models, model building, decomposable problems, evolutionary computation, problem solving