Skip to main content

Explicit Exploration in Estimation of Distribution Algorithms

  • Conference paper
  • 2387 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8266))

Abstract

This work proposes an Estimation of Distribution Algorithm (EDA) that incorporates an explicit separation between the exploration stage and the exploitation stage. For each stage a probabilistic model is required. The proposed EDA uses a mixture of distributions in the exploration stage whereas a multivariate Gaussian distribution is used in the exploitation stage. The benefits of using an explicit exploration stage are shown through numerical experiments.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bosman, P.: Design and Application of Iterated Density-Estimation Evolutionary Algorithms. Ph.D. thesis, University of Utrecht, Utrecht, The Netherlands (2003)

    Google Scholar 

  2. Bosman, P., Grahl, J., Thierens, D.: AMaLGaM IDEAs in Noiseless Black-Box Optimization Benchmarking. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, GECCO 2009, pp. 2247–2254. ACM (2009)

    Google Scholar 

  3. De Bonet, J., Isbell, C., Viola, P.: MIMIC: Finding Optima by Estimating Probability Densities. In: Advances in Neural Information Processing Systems, vol. 9, pp. 424–430. The MIT Press (1997)

    Google Scholar 

  4. Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation 1(3), 111–128 (2011)

    Article  Google Scholar 

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

    Google Scholar 

  6. Larrañaga, P., Etxeberria, R., Lozano, J., Peña, J.: Optimization in continuous domains by learning and simulation of Gaussian networks. In: Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference, GECCO 2000, pp. 201–204 (2000)

    Google Scholar 

  7. Larrañaga, P., Lozano, J., Bengoetxea, E.: Estimation of Distribution Algorithm based on multivariate normal and Gaussian networks. Tech. Rep. EHU-KZAA-IK-1/01, Department of Computer Science and Artificial Intelligence, University of the Basque Country (2001)

    Google Scholar 

  8. Larrañaga, P., Lozano, J. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers (2002)

    Google Scholar 

  9. Mühlenbein, H.: The Equation for Response to Selection and its Use for Prediction. Evolutionary Computation 5(3), 303–346 (1998)

    Article  Google Scholar 

  10. Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178–187. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. Pelikan, M., Goldberg, D., Cantú-Paz, E.: BOA: The Bayesian Optimization Algorithm. In: Banzhaf, W., Daida, J., Eiben, A., Garzon, M., Honavar, V., Jakiela, M., Smith, R. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 1999, vol. 1, pp. 525–532. Morgan Kaufmann Publishers (1999)

    Google Scholar 

  12. Pelikan, M., Mühlenbein, H.: The Bivariate Marginal Distribution Algorithm. In: Roy, R., Furuhashi, T., Chawdhry, P. (eds.) Advances in Soft Computing - Engineering Design and Manufacturing, pp. 521–535. Springer, London (1999)

    Google Scholar 

  13. Salinas-Gutiérrez, R., Hernández-Aguirre, A., Villa-Diharce, E.: Estimation of Distribution Algorithms based on Copula Functions. In: GECCO 2011: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, Graduate Students Workshop, pp. 795–798. ACM (2011)

    Google Scholar 

  14. Soto, M., Ochoa, A., Acid, S., de Campos, L.: Introducing the polytree approximation of distribution algorithm. In: Ochoa, A., Soto, M., Santana, R. (eds.) Second International Symposium on Artificial Intelligence. Adaptive Systems, CIMAF 1999, pp. 360–367, Academia, La Habana (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salinas-Gutiérrez, R., Muñoz-Zavala, Á.E., Hernández-Aguirre, A., Castillo-Galván, M.A. (2013). Explicit Exploration in Estimation of Distribution Algorithms. In: Castro, F., Gelbukh, A., González, M. (eds) Advances in Soft Computing and Its Applications. MICAI 2013. Lecture Notes in Computer Science(), vol 8266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45111-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45111-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45110-2

  • Online ISBN: 978-3-642-45111-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics