ABSTRACT
Probabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. PMBGAs are also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs).
Replacing traditional crossover and mutation operators by building and sampling a probabilistic model of promising solutions enables the use of machine learning techniques for automatic discovery of problem regularities and exploitation of these regularities for effective exploration of the search space. Using machine learning in optimization enables the design of optimization techniques that can automatically adapt to the given problem. There are many successful applications of PMBGAs, for example, Ising spin glasses in 2D and 3D, graph partitioning, MAXSAT, feature subset selection, forest management, groundwater remediation design, telecommunication network design, antenna design, and scheduling.
The tutorial Probabilistic Model-Building GAs will provide a gentle introduction to PMBGAs with an overview of major research directions in this area. Strengths and weaknesses of different PMBGAs will be discussed and suggestions will be provided to help practitioners to choose the best PMBGA for their problem.
Index Terms
- Probabilistic model-building genetic algorithms
Recommendations
Probabilistic model-building genetic algorithms
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computationProbabilistic model-building genetic algorithms (PMBGAs), also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs), guide the search for the optimum by building and sampling explicit probabilistic ...
Probabilistic model-building genetic algorithms
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationProbabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. ...
Probabilistic model-building genetic algorithms
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationProbabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. ...
Comments