Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 2004: Parallel Problem Solving from Nature - PPSN VIII pp 372–381Cite as

Distribution Tree-Building Real-Valued Evolutionary Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Abstract

This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting properties and can form a solid basis for further improvements which will make it even more competitive. Several comparative experiments on continuous real-valued optimization problems were carried out and the results are promising. It outperformed the genetic algorithm using the traditional crossover operator several times, in the majority of the remaining experiments it was comparable to the genetic algorithm performance.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.A.N., Thierens, D.: Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In: Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 197–200 (2000)

    Google Scholar 

  2. Breiman, L., Friedman, J., Stone, C.J., Olshen, R.A.: Classification and Regression Trees, January 1984. Kluwer Academic Publishers, Dordrecht (1984)

    MATH  Google Scholar 

  3. Gallagher, M.R., Frean, M., Downs, T.: Real-valued evolutionary optimization using a flexible probability density estimator. In: Genetic and Evolutionary Computation Conference (GECCO 1999)

    Google Scholar 

  4. Larrañaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms. GENA. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  5. Očenášek, J., Schwarz, J.: Estimation of Distribution Algorithm for Mixed Continuous-Discrete Optimization Problems. In: 2nd Euro-International Symposium on Computational Intelligence, pp. 227–232. IOS Press, Kosice (2002) ISBN 3-540-444139-5, ISSN 0302-9743

    Google Scholar 

  6. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Technical Report IlliGAL Report No. 98018, University of Illinois, Urbana-Champaign (September 1999)

    Google Scholar 

  7. Pošík, P.: Comparing various marginal probability models in evolutionary algorithms. In: Ošmera, P. (ed.) MENDEL 2003, Brno, vol. 1, pp. 59–64. Brno University (2003) ISBN 80-214-2411-7

    Google Scholar 

  8. Tsutsui, S., Pelikan, M., Goldberg, D.E.: Evolutionary algorithm using marginal histogram models in continuous domain. Technical Report IlliGAL Report No. 2001019, University of Illinois, Urbana-Champaign (March 2001)

    Google Scholar 

  9. Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating evolutionary algorithms. Artificial Intelligence 85, 245–276 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, Department of Cybernetics, Czech Technical University in Prague, Technická 2, 166 27, Prague 6, Czech Republic

    Petr Pošík

Authors
  1. Petr Pošík
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pošík, P. (2004). Distribution Tree-Building Real-Valued Evolutionary Algorithm. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation