Abstract
In the last few years there has been a growing interest in the field of Estimation of Distribution Algorithms (EDAs), where crossover and mutation genetic operators are replaced by probability estimation and sampling techniques. The Bayesian Optimization Algorithm incorporates methods for learning Bayesian networks and uses these to model the promising solutions and generate new ones. The aim of this paper is to propose the parallel version of this algorithm, where the optimization time decreases linearly with the number of processors. During the parallel construction of network, the explicit topological ordering of variables is used to keep the model acyclic. The performance of the optimization process seems to be not affected by this constraint and our version of algorithm was successfully tested for the discrete combinatorial problem represented by graph partitioning as well as for deceptive functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Muehlenbein, H., Rodriguez, A. O.: Schemata Distributions and Graphical Models in Evolutionary Optimization. GMD Forschungs Zentrum Informationstechnik, 53754-St. Augustin, 1998, pp. 1–21.
Pelikan, M., Goldberg, D. E., Cantú-Paz, E.: Linkage Problem, Distribution Estimation, and Bayesian Networks. IlliGal Report No. 98013, November 1998, pp. 1–25.
Heckerman, D., Geiger, D., Chickering, M.: Learning Bayesian networks: The combination of knowledge and statistical data, Technical Report MSR-TR-94–09, Redmond, Microsoft Research, 1994, pp. 1–53.
Pelikan, M.: A Simple Implementation of Bayesian Optimization Algorithm in C++(Versionl.0). Illigal Report 99011, February 1999, pp. 1–16.
Schwarz,J.,Očenášek,J.: Experimental study: Hypergraph partitioning based on the simple and advanced genetic algorithms BMDA and BOA, 5th International Mendel Conference, 1999, FME VUT Brno, Czech Republic, pp. 124–130.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Očenášek, J., Schwarz, J. (2000). The Parallel Bayesian Optimization Algorithm. In: Sinčák, P., Vaščák, J., Kvasnička, V., Mesiar, R. (eds) The State of the Art in Computational Intelligence. Advances in Soft Computing, vol 5. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1844-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1844-4_11
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1322-7
Online ISBN: 978-3-7908-1844-4
eBook Packages: Springer Book Archive