Summary
This chapter presents a new concept of parallel Bivariate Marginal Distribution Algorithm (BMDA) using the stepping stone communication model with the unidirectional ring topology. The traditional migration of individuals is compared with a newly proposed technique of probability model migration. The idea of the new adaptive BMDA (aBMDA) algorithms is to modify the classic learning of the probability model (applied in the sequential BMDA [24]). In the proposed strategy, the adaptive learning of the resident probability model is used. The evaluation of pair dependency, using Pearson’s chi-square statistics is influenced by the relevant immigrant pair dependency according to the quality of resident and immigrant subpopulation. Experimental results show that the proposed aBMDA significantly outperforms the traditional concept of migration of individuals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahn, C.W., Goldberg, D.E., Ramakrishna, R.S.: Multiple-Deme Parallel Estimation of Distribution Algorithms: Basic Framework and Application (Illigal Report No. 2003016) (2003)
Alba, E., Troya, J.M.: A Survay of Parallel Distributed Genetic Algorithms. Complexity 4, 303–346 (1999)
Baluja, S.: Population-Based Incremental Learning: A method for Integrating Genetic Search Based Function Optimization and Competitive Learning, Technical report CMU-CS-94-163, Carnegie Mellon University (1994)
Bosman, P.A.N., Thierens, D.: An Algorithmic Framework For Density Es-timation Based Evolutionary Algorithms, Technical report UU-CS-1999-46, Utrecht University (1999)
Bosman, P.A.N., Thierens, D.: Linkage information processing in distribution estimation algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, Orlando, Florida, vol. I, pp. 60–67. Morgan Kaufmann Publishers, San Fransisco (1999)
Bosman, P.A.N., Thierens, D.: Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In: Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM workshop. Genetic and Evolutionary Computation Conference GECCO 2000, pp. 197–200 (2000)
Cantu-Paz, E.: Efficient and Accurate Parallel genetic algorithm. Kluwer Academic Publishers, Dordrecht (2000)
delaOssa, L., Gámez, J.A., Puerta, J.M.: Migration of probability models instead of individuals: an alternative when applying the island model to edas. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 242–252. Springer, Heidelberg (2004)
delaOssa, L., Gámez, J.A., Puerta, J.M.: Improving model combination through local search in parallel univariate EDAs. Evolutionary Computation 2, 1426–1433 (2005)
Goldberg, D.E., Sastry, K., Llorà, X.: Toward routine billion-variable optimization using genetic algorithms. Complexity 12, 27–29 (2007)
Heckerman, D., Geiger, D., Chickering, M.: Learning Bayesian networks: The combination of knowledge and statistical data, Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA (1994)
Höhfeld, M., Rudolph, G.: Towards a theory of population-based incremental learning. In: Proceedings of 4th International Conference on Evolutionary Computation, pp. 1–5. IEEE Press, Los Alamitos (1997)
Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. Kluwer Academic Publishers, London (2002)
Lin, S.C., Punch, W.F., Goodman, E.D.: Coarse-grain parallel genetic algorithms: categorization and a new approach. In: Sixth IEEE Conference on Parallel and Distributed Processing, pp. 28–37. IEEE Press, Piscataway (1994)
Lobo, F.G., Lima, C.F., Martires, H.: Massive parallelization of the compact genetic algorithm. In: Ribeiro, R. (ed.) Proceedings of the International Conference on Adaptive and Natural Computing Algorithms (ICANNGA 2005), pp. 530–533. Springer, Heidelberg (2005)
Marin, J.M., Mengersen, K., Robert, C.P.: Bayesian Modelling and Inference on Mixtures of Distribution. In: Dey, D., Rao, C.R. (eds.) Handbook of Statistics, vol. 25, pp. 459–507 (2005)
Mendiburu-Alberro, A.: Parallel implementation of estimation of Distribution Algorithms based on probabilistic graphical models. Application to chemical calibration models, PhD thesis, the University of Bascue Country, Donostia-San Sebastian (2006)
MPI-2 Extension to message-Passing Interface, Message Passing Interface Forum (2003), http://www.mpi-forum.org/docs/mpi2-report.pdf
Mühlenbein, H.: The equation for response to selection and its use for prediction. Evolutionary Computation 5(3), 303–346 (1997)
Ocenasek, J.: Parallel Estimation of Distribution Algorithms, PhD. Thesis, Faculty of Information Technology, Brno University of Technology, Brno, Czech Rep. (2002)
Ocenasek, J., Schwarz, J., Pelikan, M.: Design of Multithreaded Estimation of Distribution Algorithms. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1247–1258. Springer, Heidelberg (2003)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Linkage problem, distribution estimation, and Bayesian networks, IlliGAL Report No. 98013, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, Illinois (1998)
Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models, IlliGAL Report No. 99018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, Illinois (1999)
Pelikan, M., Mühlenbein, H.: The bivariate marginal distribution algorithm. In: Advances in Soft Computing - Engineering Design and Manufacturing, pp. 521–535. Springer, London (1999)
Pelikan, M., Sastry, K., Cantú-Paz, E.: Bayesian Optimization Algorithm, Population Sizing and Time to Convergence, IlliGAL Report No. 2000001, Il-linois Genetic Algorithm Laboratory, University of Illinois at Urbana-Champaing, p. 13 (2000)
Pelikan, M., Sastry, K., Goldberg, D.E.: Evolutionary Algorithms + Graphical Models = Scalable Black-Box Optimization, IlliGAL Report No. 2001029, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, Illinois (2001)
Xiang, Y., Chu, T.: Parallel Learning of Belief Networks in Large and Difficult Domains. In: Data Mining and Knowledge Discovery, vol. 3, pp. 315–339 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schwarz, J., Jaros, J. (2008). Parallel Bivariate Marginal Distribution Algorithm with Probability Model Migration. In: Chen, Yp., Lim, MH. (eds) Linkage in Evolutionary Computation. Studies in Computational Intelligence, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85068-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-85068-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85067-0
Online ISBN: 978-3-540-85068-7
eBook Packages: EngineeringEngineering (R0)