Optimization by learning and simulation of Bayesian and Gaussian networks (1999)
| Citations: | 34 - 6 self |
BibTeX
@MISC{Larrañaga99optimizationby,
author = {P. Larrañaga and R. Etxeberria and J. A. Lozano and J.M. Peña and J. M. Pe~na},
title = {Optimization by learning and simulation of Bayesian and Gaussian networks},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Estimation of Distribution Algorithms (EDA) constitute an example of stochastics heuristics based on populations of individuals every of which encode the possible solutions to the optimization problem. These populations of individuals evolve in succesive generations as the search progresses -- organized in the same way as most evolutionary computation heuristics. In opposition to most evolutionary computation paradigms which consider the crossing and mutation operators as essential tools to generate new populations, EDA replaces those operators by the estimation and simulation of the joint probability distribution of the selected individuals. In this work, after making a review of the different approaches based on EDA for problems of combinatorial optimization as well as for problems of optimization in continuous domains, we propose new approaches based on the theory of probabilistic graphical models to solve problems in both domains. More precisely, we propose to adapt algorit...
