Abstract
This paper presents a basic framework that facilitates the development of new multiple-deme parallel estimation of distribution algorithms (PEDAs). The aim is to carry over the migration effect that arises in multiple-deme parallel genetic algorithms (PGAs) into probability distribution of EDAs. The idea is to employ two kinds of probability vector (PV): one each for resident and immigrant candidates. The distribution of crossbred individuals (that virtually exist on both kinds of PV) is then utilized by a new type of crossover, the PV-wise crossover. A multiple-deme parallel population-based incremental learning (P2BIL) scheme is proposed as an application. The P2BIL scheme closely follows the proposed framework that includes a new learning strategy (i.e., PV update rule). Experimental results show that P2BIL generally exhibits solutions that compare favourably with those computed by an existing PGA with multiple demes, thereby supporting the validity of the proposed framework for designing multiple-deme PEDAs.
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
Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)
Ahn, C.W., Ramakrishna, R.S.: Elitism-based Compact Genetic Algorithms. IEEE Transactions on Evolutionary Computation 7(4), 367–385 (2002)
Harik, G., Lobo, F.G., Goldberg, D.E.: The Compact Genetic Algorithm. IEEE Transactions on Evolutionary Computation 3(4), 287–297 (1999)
Harik, G.: Linkage Learning via Probabilistic Modeling in the ECGA. IlliGAL Technical Report No. 99010, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL (1999)
Baluja, S.: Population-based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA (1994)
De Bonet, J.S., Isbel, C.L., Viola, P.: MIMIC: Finding Optima by Estimating Probability Densities. Advances in Neural Information Processing Systems 9, 424 (1997)
Pelikan, M., Goldberg, D.E., Cantǔ-Paz, E.: BOA: The Bayesian Optimization Algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 525–532 (1999)
Lam, W., Segre, A.: A Parallel Learning Algorithm for Bayesian Inference Networks. IEEE Transactions on Knowledge Discovery and Data Engineering 14(1), 93–105 (2002)
Cantŭ-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Dordrecht (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, C.W., Goldberg, D.E., Ramakrishna, R.S. (2004). Multiple-Deme Parallel Estimation of Distribution Algorithms: Basic Framework and Application. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive