In this paper, an algorithm based on the concepts of genetic algorithms that uses an estimation of a probability distribution of promising solutions in order to generate new candidate solutions is proposed. To estimate the distribution, techniques for modeling multivariate data by Bayesian networks are used. The proposed algorithm identifies, reproduces and mixes building blocks up to a specified order. It is independent of the ordering of the variables in the strings representing the solutions. Moreover, prior information about the problem can be incorporated into the algorithm. However, prior information is not essential. Preliminary experiments show that the BOA outperforms the simple genetic algorithm even on decomposable functions with tight building blocks as a problem size grows. 1 INTRODUCTION Recently, there has been a growing interest in optimization methods that explicitly model the good solutions found so far and use the constructed model to guide the fu...
|
4757
|
Probabilistic Reasoning in Intelligent Systems
– Pearl
- 1988
|
|
1182
|
Genetic algorithms in search, optimization and machine learning
– Goldberg
- 1989
|
|
666
|
An analysis of the behavior of a class of genetic adaptive systems
– Jong
- 1975
|
|
621
|
Learning Bayesian networks: The combination of knowledge and statistical data
– Heckerman, Geiger, et al.
- 1995
|
|
389
|
Genetic algorithms with sharing for multimodal function optimization
– Goldberg, Richardson
- 1987
|
|
262
|
Messy genetic algorithms: Motivation, analysis, and first results
– Goldberg, Korb, et al.
- 1989
|
|
251
|
Influence diagrams
– Howard, Matheson
- 2005
|
|
198
|
Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
– Baluja
- 1994
|
|
184
|
Learning Bayesian Networks with Local Structure. Learning and Inference in Graphical Models
– Friedman, Goldszmidt
- 1998
|
|
164
|
From recombination of genes to the estimation of distributions I. binary parameters
– Mühlenbein, Paaß
- 1996
|
|
136
|
The compact genetic algorithm
– Harik, Lobo, et al.
- 1998
|
|
125
|
A Bayesian approach to learning Bayesian networks with local structure
– Chickering, Heckerman, et al.
- 1997
|
|
100
|
Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space
– Baluja, Davies
- 1997
|
|
100
|
MIMIC: Finding optima by estimating probability densities
– Bonet, Isbell, et al.
- 1997
|
|
95
|
Optimum branchings
– Edmonds
- 1967
|
|
76
|
Schemata, distributions and graphical models in evolutionary optimization
– Mühlenbein, Mahnig, et al.
- 1998
|
|
74
|
The equation for the response to selection and its use for prediction
– Mühlenbein
- 1998
|
|
72
|
The bivariate marginal distribution algorithm
– Pelikan, Mühlenbein
- 1999
|
|
71
|
Linkage problem, distribution estimation, and Bayesian networks
– Pelikan, Goldberg, et al.
|
|
55
|
Escaping hierarchical traps with competent genetic algorithms
– Pelikan, Goldberg
- 2001
|
|
49
|
Learning linkage
– Harik, Goldberg
- 1997
|
|
33
|
Bayesian optimization algorithm, population sizing, and time to convergence
– Pelikan, Goldberg, et al.
- 2000
|
|
25
|
Bayesian optimization algorithm, decision graphs, and Occam’s razor
– Pelikan, Goldberg, et al.
- 2000
|
|
21
|
Hierarchical problem solving by the Bayesian optimization algorithm
– Pelikan, Goldberg
- 2000
|
|
17
|
Analysis of recombinative algorithms on a non-separable building-block problem. 5. Workshop Foundations of Genetic Algorithms (FOGA
– Watson
- 2000
|
|
15
|
The design of innovation: Lessons from genetic algorithms, lessons for the real world. Technological Forecasting and Social Change
– Goldberg
- 2000
|
|
15
|
Hill climbing with learning (An abstraction of genetic algorithm
– Kvasnicka, Pelikan
- 1996
|
|
14
|
Genetic Algorithms, Clustering, and the Breaking of Symmetry
– Pelikan, Goldberg
- 2000
|
|
9
|
Finding Multiple Solutions In Problems of Bounded Difficulty
– Harik
- 1994
|
|
7
|
Adaptive search using simulated evolution. Doctoral dissertation
– Cavicchio
- 1970
|
|
6
|
Designing a Genetic Algorithm Using the Linkage Identification by Nonlinearity Check
– Goldberg, Munetomo
- 1998
|
|
4
|
15). Four keys to understanding building-block diculty
– Goldberg
- 1998
|
|
4
|
Revisiting the GEMGA: Scalable evolutonary optimization through linkage learning
– Kargupta
- 1998
|
|
