Skip to main content
SpringerLink
Log in

A Review on Estimation of Distribution Algorithms

3

  • Chapter
Estimation of Distribution Algorithms

Part of the book series: Genetic Algorithms and Evolutionary Computation ((GENA,volume 2))

Abstract

In this chapter, we review the Estimation of Distribution Algorithms proposed for the solution of combinatorial optimization problems and optimization in continuous domains. Different approaches for Estimation of Distribution Algorithms have been ordered by the complexity of the interrelations that they are able to express. These will be introduced using one unified notation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Alba, E., Santana, R., Ochoa, A., and Lazo, M. (2000). Finding typical testors by using an evolutionary strategy. In Proceedings of the Fifth Ibero American Symposium on Pattern Recognition, pages 267–278.

    Google Scholar 

  • Baluja, S. (1994). 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.

    Google Scholar 

  • Baluja, S. (1995). An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95–193, Carnegie Mellon University.

    Google Scholar 

  • Baluja, S. (1997). Genetic algorithms and explicit search statistics. Advances in Neural Information Processing Systems, 9:319–325.

    Google Scholar 

  • Baluja, S. and Caruana, R. (1995). Removing the genetics from standard genetic algorithm. In Prieditis, A. and Russell, S., editors, Proceedings of the International Conference on Machine Learning, pages 38–46. Morgan Kaufmann.

    Google Scholar 

  • Baluja, S. and Davies, S. (1997a). Combining multiple optimization runs with optimal dependency trees. Technical Report CMU-CS-97–157, Carnegie Mellon University.

    Google Scholar 

  • Baluja, S. and Davies, S. (1997b). Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Technical Report CMU-CS-97–107, Carnegie Mellon University.

    Google Scholar 

  • Baluja, S. and Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In AAAI-98.

    Google Scholar 

  • Bandyopadhyay, S., Kargupta, H., and Wang, G. (1998). Revisiting the gemga: Scalable evolutionary optimization through linkage learning. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pages 603–608. IEEE Press.

    Google Scholar 

  • Bengoetxea, E., Larrañaga, P., Bloch, I., and Perchant, A. (2001a). Solving graph matching with EDAs using a permutation—based representation. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Bengoetxea, E., Larrañaga, P., Bloch, I., Perchant, A., and Boeres, C. (2000). Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data. In Workshop Notes of CaNew2000: Workshop on Bayesian and Causal Networks: From Inference to Data Mining. Fourteenth European Conference on Artificial Intelligence, ECAI2000. Berlin.

    Google Scholar 

  • Bengoetxea, E., Mikelez, T., Lozano, J. A., and Larrañaga, P. (2001b). Empirical comparison of Estimation of Distributions Algorithms in continuous

    Google Scholar 

  • Estimation of Distribution Algorithmsoptimization. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Lion of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Berny, A. (2000). An adaptive scheme for real function optimization acting as a selection operator. In Yao, X., editor, First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks.

    Google Scholar 

  • Berny, A. (2000). Selection and reinforcement learning for combinatorial optimization. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 601–610.

    Chapter  Google Scholar 

  • Blanco, R. and Lozano, J. A. (2001). Empirical comparison of Estimation of Distribution Algorithms in combinatorial optimization. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (1999a). An algorithmic framework for density estimation based evolutionary algorithms. Technical Report UU-CS1999–46, Utrech University.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (1999b). Linkage information processing in distribution estimation algorithms. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume 1, pages 60–67. Morgan Kaufmann Publishers. San Francisco, LA.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (2000a). Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 197–200.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (2000b). Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 767–776.

    Chapter  Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (2000c). IDEAs bases on the normal kernels probability density function. Technical Report UU-CS-2000–11, Utrech University.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (2000d). Negative log-likelihood and statistical hypothesis testing as the basis of model selection in IDEAs. In Genetic and Evolutionary Computation Conference GECCO-00. Late Breaking Papers, pages 51–58.

    Google Scholar 

  • Bosman, P. A. N. and Thierens, D. (2000e). Mixed IDEAs. Technical Report UU-CS-2000–45, Utrech University.

    Google Scholar 

  • Buntine, W. (1991). Theory refinement in Bayesian networks. In Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, pages 52–60. Morgan Kaufmann.

    Google Scholar 

  • Chow, C. and Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory,14:462467.

    Google Scholar 

  • Cotta, C., Alba, E., Sagarna, R., and Larrañaga, P. (2001). Adjusting weights in artificial neural networks using evolutionary algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • De Bonet, J. S., Isbell, C. L., and Viola, P. (1997). MIMIC: Finding optima by estimating probability densities. Advances in Neural Information Processing Systems, Vol. 9.

    Google Scholar 

  • de Campos, L. M., Gámez, J. A., Larrañaga, P., Moral, S., and Romero, T. (2001). Partial abductive inference in Bayesian networks: an empirical comparison between GAs and EDAs. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Eshelman, L. J. and Schaffer, J. D. (1993). Productive recombination and propagating and preserving schemata. Foundations of Genetic Algorithms,3:299314.

    Google Scholar 

  • Etxeberria, R. and Larrañaga, P. (1999). Global optimization with Bayesian networks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 332–339.

    Google Scholar 

  • Forgy, E. (1965). Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21:768.

    Google Scholar 

  • Fyfe, C. (1999). Structured population-based incremental learning. Soft Computing, 2(4):191–198.

    Article  MathSciNet  Google Scholar 

  • Galic, E. and Höhfeld, M. (1996). Improving the generalization performance of multi-layer-perceptrons with population-based incremental learning. In Parallel Problem Solving from Nature. PPSN-IV, pages 740–750.

    Google Scholar 

  • Gallagher, M. R. (2000). Multi-layer perceptron error surfaces: Visualization, structure and modelling. Technical Report Doctoral Thesis, Department of Computer Science and Electrical Engineering, University of Queensland.

    Google Scholar 

  • Gallagher, M. R., Frean, M., and Downs, T. (1999). Real-valued evolutionary optimization using a flexible probability density estimator. In Proceedings of Genetic and Evolutionary Computation Conference, pages 840–846. Morgan Kaufmann.

    Google Scholar 

  • Goldberg, D. E., Deb, K., Kargupta, H., and Harik, G. (1993). Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 56–64. Morgan Kauffman.

    Google Scholar 

  • Goldberg, D. E., Korb, B., and Deb, K. (1989). Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, 3(5):493–530.

    MathSciNet  MATH  Google Scholar 

  • González, C., Lozano, J. A., and Larrañaga, P. (2001). Analyzing the PBIL algorithm by means of discrete dynamical systems. Complex Systems, In press.

    Google Scholar 

  • González, C., Lozano, J. A., and Larrañaga, P. (2001). The converge behavior of PBIL algorithm: a preliminary approach. In Kurková, V., Steel, N. C., Neruda, R., and Kárnÿ, M., editors, International Conference on Artificial Neural Networks and Genetic Algorithms. ICANNGA-2001, pages 228–231. Springer.

    Google Scholar 

  • González, C., Lozano, J. A., and Larrañaga, P. (2001). Mathematical modeling of discrete Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Grefenstette, J. J. (1986). Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1):122128.

    Google Scholar 

  • Harik, G. (1999). Linkage learning in via probabilistic modeling in the ECGA. Technical Report 99010, I11iGAL Technical Report.

    Google Scholar 

  • Harik, G., Lobo, F. G., and Golberg, D. E. (1998). The compact genetic algorithm. In Proceedings of the IEEE Conference on Evolutionary Computation, pages 523–528.

    Google Scholar 

  • Höhfeld, M. and Rudolph, G. (1997). Towards a theory of population-based incremental learning. In Proceedings of the 4th International Conference on Evolutionary Computation, pages 1–5. IEEE Press.

    Google Scholar 

  • Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press.

    Google Scholar 

  • Inza, I., Larrañaga, P., and R. Etxeberria, B. S. (2000). Feature subset selection by Bayesian networks based optimization. Artificial Intelligence, 123(12):157–184.

    Article  MATH  Google Scholar 

  • Inza, I., Larrañaga, P., and Sierra, B. (2001a). Feature subset selection by Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Inza, I., Larrañaga, P., and Sierra, B. (2001). Feature weighting in K-NN by means of Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Inza, I., Merino, M., Larrañaga, P., Quiroga, J., Sierra, B., and Girala, M. (2001c). Feature subset selection by population-based incremental learning. A case study in the survival of cirrhotic patients with TIPS. Artificial Intelligence in Medicine, In press.

    Google Scholar 

  • Juels, A. (1997). Topics in black-box combinatorial optimization. Technical Report Doctoral Thesis, University of California—Berkeley.

    Google Scholar 

  • Kargupta, H. (1996). The gene expression messy genetic algorithm. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 631–636. IEEE Press.

    Google Scholar 

  • Kargupta, H. and Goldberg, D. E. (1997). Search, blackbox optimization, and sample complexity. In Belew, R. W. and Vose, M., editors, Foundations of Genetic Algorithms 4. Morgan Kaufmann. San Mateo, CA.

    Google Scholar 

  • Kvasnicka, V., Pelikan, M., and Pospichal, J. (1996). Hill climbing with learning (an abstraction of genetic algorithms). Neural Network World, 6:773–796.

    Google Scholar 

  • Larrañaga, P., Etxeberria, R., Lozano, J. A., and Peña, J. M. (1999a). Optimization by learning and simulation of Bayesian and Gaussian networks. Technical Report KZZA-IK-4–99, Department of Computer Science and Artificial Intelligence, University of the Basque Country.

    Google Scholar 

  • Larrañaga, P., Etxeberria, R., Lozano, J. A., and Peña, J. M. (2000). Combinatorial optimization by learning and simulation of Bayesian networks. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, pages 343–352. Stanford.

    Google Scholar 

  • Larrañaga, P., Etxeberria, R., Lozano, J. A., and Peña, J. M. (2000). Optimization in continuous domains by learning and simulation of Gaussian networks. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 201–204.

    Google Scholar 

  • Larrañaga, P., Etxeberria, R., Lozano, J. A., Sierra, B., Inza, I., and Peña, J. M. (1999b). A review of the cooperation between evolutionary computation and probabilistic graphical models. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 314–324. La Habana.

    Google Scholar 

  • Larrañaga, P., Lozano, J. A., and Bengoetxea, E. (2001). Estimation of Distribution Algorithms based on multivariate normal and Gaussian networks. Technical Report KZZA-IK-1–01, Department of Computer Science and Artificial Intelligence, University of the Basque Country.

    Google Scholar 

  • Lauritzen, S. L. (1996). Graphical Models. Oxford University Press.

    Google Scholar 

  • Lobo, F. G., Deb, K., Goldberg, D. E., Harik, G. R., and Wang, L. (1998). Compressed introns in a linkage learning genetic algorithm. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 551–558. Morgan Kauffman.

    Google Scholar 

  • Lozano, J. A, and Mendiburu, A. (2001). Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Lozano, J. A., Sagarna, R., and Larrañaga, P. (2001). Parallel Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estima‑

    Google Scholar 

  • Lion of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Mahnig, T. and Mühlenbein, H. (2000). Mathematical analysis of optimization methods using search distributions. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 205–208.

    Google Scholar 

  • Maxwell, B. and Anderson, S. (1999). Training hidden Markov models using population-based learning. In Genetic and Evolutionary Computation Conference, GECCO-99.

    Google Scholar 

  • Monmarché, N., Ramat, E., Desbarats, L., and Venturini, G. (2000). Probabilistic search with genetic algorithms and ant colonies. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 209–211.

    Google Scholar 

  • Monmarché, N., Ramat, E., Dromel, G., Slimane, M., and Venturini, G. (1999). On the similarities between AS, BSC and PBIL: toward the birth of a new meta—heuristics. Technical Report 215, E3i, Université de Tours.

    Google Scholar 

  • Mühlenbein, H. (1998). The equation for response to selection and its use for prediction. Evolutionary Computation, 5:303–346.

    Article  Google Scholar 

  • Mühlenbein, H. and Mahnig, T. (1999). Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology, 7:19–32.

    Google Scholar 

  • Mühlenbein, H. and Mahnig, T. (1999). The Factorized Distribution Algorithm for additively decomposed functions. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 301–313. La Habana.

    Google Scholar 

  • Mühlenbein, H. and Mahnig, T. (1999). FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353–376.

    Article  Google Scholar 

  • Mühlenbein, H. and Mahnig, T. (2000). Evolutionary algorithms: From recombination to search distributions. Theoretical Aspects of Evolutionary Computing. Natural Computing, pages 137–176.

    Google Scholar 

  • Mühlenbein, H., Mahnig, T., and Ochoa, A. (1999). Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5:215–247.

    Article  MATH  Google Scholar 

  • Mühlenbein, H. and Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. In Lecture Notes in Computer Science 1411:Parallel Problem Solving from Nature - PPSN IV, pages 178187.

    Google Scholar 

  • Mühlenbein, H. and Voigt, H.-M. (1996). Gene pool recombination in genetic

    Google Scholar 

  • Lion of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.algorithms. Metaheuristics: Theory and applications, pages 53–62.

    Google Scholar 

  • Ochoa, A., Mühlenbein, H., and Soto, M. (2000a). Factorized Distribution Al‑

    Google Scholar 

  • gorithm using Bayesian networks. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 212–215.

    Google Scholar 

  • Ochoa, A., Mühlenbein, H., and Soto, M. (2000b). A Factorized Distribution Algorithm using single connected Bayesian networks. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 787–796.

    Chapter  Google Scholar 

  • Ochoa, A., Soto, M., Santana, R., Madera, J., and Jorge, N. (1999). The Factorized Distribution Algorithm and the junction tree: A learning perspective. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 368–377. La Habana.

    Google Scholar 

  • Pelikan, M. and Goldberg, D. E. (2000a). Genetic algorithms, clustering, and the breaking of symmetry. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 385–394.

    Chapter  Google Scholar 

  • Pelikan, M. and Goldberg, D. E. (2000). Hierarchical problem solving and the Bayesian optimization algorithm. In Whitley, D., Goldberg, D., Cantú-Paz, E., Spector, L., Parmee, I., and Beyer, H.-G., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 267–274. Morgan Kaufmann.

    Google Scholar 

  • Pelikan, M. and Goldberg, D. E. (2000). Research on the Bayesian optimization algorithm. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 212–215.

    Google Scholar 

  • Pelikan, M., Goldberg, D. E., and Cantú-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume 1, pages 525–532. Morgan Kaufmann Publishers, San Francisco, CA. Orlando, FL.

    Google Scholar 

  • Pelikan, M., Goldberg, D. E., and Cantú-Paz, E. (2000). Bayesian optimization algorithm, population sizing, and time to convergence. In Whitley, D., Goldberg, D., Cantú-Paz, E., Spector, L., Parmee, I., and Beyer, 11.-G., editors, Proceedings of the Genetic and Evolutionary Computation Conference,pages 275–282. Morgan Kaufmann.

    Google Scholar 

  • Pelikan, M., Goldberg, D. E., and Cantú-Paz, E. (2000b). Linkage problem, distribution estimation and Bayesian networks. Evolutionary Computation, 8(3):311–340.

    Article  Google Scholar 

  • Pelikan, M., Goldberg, D. E., and Lobo, F. (1999b). A survey of optimization by building and using probabilistic models. Technical Report I11iGAL Report 99018, University of Illinois at Urbana-Champaing.

    Google Scholar 

  • Pelikan, M., Goldberg, D. E., and Sastry, K. (2000c). Bayesian optimization algorithm, decision graphs, and Occam’s razor. Technical Report I11iGAL Report 200020, University of Illinois at Urbana-Champaing.

    Google Scholar 

  • Pelikan, M. and Mühlenbein, H. (1999). The bivariate marginal distribution algorithm. Advances in Soft Computing-Engineering Design and Manufacturing, pages 521–535.

    Google Scholar 

  • Peña, J. M., Lozano, J. A., and Larrañaga, P. (2001). Benefits of data clustering in multimodal function optimization via EDAs. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation.

    Google Scholar 

  • Priebe, C. E. (1994). Adaptive mixtures. Journal of the American Statistical Association, 89(427):796–806.

    Article  MathSciNet  MATH  Google Scholar 

  • Rissanen, J. (1978). Modeling by shortest data description.Automatica, pages 465–471.

    Google Scholar 

  • Rivera, J. (1999). Using Estimation of Distribution Algorithms as an evolutive component of the XCS classifier system. Technical Report, University of La Habana (In spanish).

    Google Scholar 

  • Robles, V., de Miguel, P., and Larrañaga, P. (2001). Solving the travelling salesman problem with Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Roure, J., Sangüesa, R., and Larrañaga, P. (2001). Partitional clustering by means of Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Rudlof, S. and Köppen, M. (1996). Stochastic hill climbing by vectors of normal distributions. In Proceedings of the First Online Workshop on Soft Computing (WSCI). Nagoya, Japan.

    Google Scholar 

  • Sagarna, R. (2000). Parallelization of Estimation of Distribution Algorithms. Master Thesis, University of the Basque Country, Department of Computer Science and Artificial Intelligence (In spanish).

    Google Scholar 

  • Sagarna, R. and Larrañaga, P. (2001). Solving the knapsack problem with Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Salustowicz, R. and Schmidhuber, J. (1997). Probabilistic incremental program evolution. Evolutionary Computation, 5(2):123–141.

    Article  Google Scholar 

  • Salustowicz, R. and Schmidhuber, J. (1998). Learning to predict trough probabilistic incremental program evolution and automatic task decomposition. Technical Report Technical Report IDSIA-11–98, University of Lugano.

    Google Scholar 

  • Santana, R. and Ochoa, A. (1999). Dealing with constraints with Estimation of Distribution Algorithms: The univariate case. In Second Symposium on

    Google Scholar 

  • Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 378–384. La Habana.

    Google Scholar 

  • Santana, R., Ochoa, A., Soto, M., Pereira, F. B., Machado, P., Costa, E., and Cardoso, A. (2000). Probabilistic evolution and the busy beaver problem. In Whitley, D., Goldberg, D., Cantú-Paz, E., Spector, L., Parmee, I., and Beyer, H.-G., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 380–380. Morgan Kaufmann.

    Google Scholar 

  • Sastry, K. and Goldberg, D. E. (2000). On extended compact genetic algorithm. In GECCO-2000, Late Breaking Papers, Genetic and evolutionary Computation Conference, pages 352–359.

    Google Scholar 

  • Schmidt, M., Kristensen, K., and Jensen, T. (1999). Adding genetics to the stan‑ dar PBIL algorithm. In Congress on Evolutionary Computation. CEC’99.

    Google Scholar 

  • Schwarz, J. and Ocenasek, J. L. (1999). Experimental study: Hypergraph partitioning based on the simple and advanced algorithms BMDA and BOA. In Proceedings of the Fifth International Conference on Soft Computing, pages 124–130. Brno, Czech Republic.

    Google Scholar 

  • Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Wiley, New York. Sebag, M. and Ducoulombier, A. (1998). Extending population-based incre‑mental learning to continuos search spaces. In Parallel Problem Solving from Nature - PPSN V, pages 418–427. Springer-Verlag. Berlin.

    Google Scholar 

  • Servais, M. P., de Jaer, G., and Greene, J. R. (1997). Function optimization using multiple-base population based incremental learning. In Proceedings of the Eight South African Workshop on Pattern Recognition.

    Google Scholar 

  • Servet, I., Trave-Massuyes, L., and Stern, D. (1997). Telephone network traffic overloading diagnosis and evolutionary techniques. In Proceedings of the Third European Conference on Artificial Evolution, (AE’97), pages 137–144.

    Google Scholar 

  • Sierra, B., Jiménez, E., Inza, I., Larrañaga, P., and Muruzábal, J. (2001). Rule induction using Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.

    Google Scholar 

  • Soto, M., Ochoa, A., Acid, S., and de Campos, L. M. (1999). Introducing the polytree aproximation of distribution algorithm. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 360–367. La Habana.

    Google Scholar 

  • Sukthankar, R., Baluja, S., and Hancock, J. (1997). Evolving an intelligent vehicle for tactical reasoning in traffic. In International Conference on Robotics and Automation.

    Google Scholar 

  • Syswerda, G. (1993). Simulated crossover in genetic algorithms. Foundations of Genetic Algorithms 2, pages 239–255.

    Google Scholar 

  • Thathachar, M. and Sastry, P. S. (1987). Learning optimal discriminant functions through a cooperative game of automata. IEEE Transactions on Systems, Man, and Cybernetics, 17(1).

    Google Scholar 

  • Estimation of Distribution Algorithms

    Google Scholar 

  • van Kemenade, C. H. M. (1998). Building block filtering and mixing. In Proceedings of the 1998 International Conference on Evolutionary Computation. IEEE Press.

    Google Scholar 

  • Whittaker, J. (1990). Graphical models in applied multivariate statistics. John Wiley and Sons.

    Google Scholar 

  • Zhang, B.-T. (1999). A Bayesian framework for evolutionary computation. In Proceedings of the Congress on Evolutionary Computation (CEC99), IEEE Press, pages 722–727.

    Google Scholar 

  • Zhang, B.-T. (2000). Bayesian evolutionary algorithms for learning and optimization. In Wu, A. S., editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pages 220–222.

    Google Scholar 

  • Zhang, B.-T. and Cho, D.-Y. (2000). Evolving neural trees for time series prediction using Bayesian evolutionary algorithms. In Proceedings of the First IEEE Workshop on Combinations of Evolutionary Computation and Neural Networks (ECNN-2000).

    Google Scholar 

  • Zhang, B.-T. and Shin, S.-Y. (2000). Bayesian evolutionary optimization using Helmholtz machines. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Lecture Notes in Computer Science,1917. Parallel Problem Solving from Nature — PPSN VI, pages 827–836.

    Chapter  Google Scholar 

  • Zhang, Q. and Mühlenbein, H. (1999). On global convergence of FDA with proportionate selection. In Second Symposium on Artificial Intelligence. Adaptive Systems. CIMAF 99, pages 340–343. La Habana.

    Google Scholar 

  • Zhigljaysky, A. A. (1991). Theory of Global Random Search. Kluwer Academic Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Artificial Intelligence, University of the Basque Country, Spain

    P. Larrañaga

Authors
  1. P. Larrañaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of the Basque Country, Spain

    Pedro Larrañaga  & Jose A. Lozano  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Larrañaga, P. (2002). A Review on Estimation of Distribution Algorithms. In: Larrañaga, P., Lozano, J.A. (eds) Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1539-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-1539-5_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5604-2

  • Online ISBN: 978-1-4615-1539-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation