Distribution Tree-Building Real-Valued Evolutionary Algorithm

  • Petr Pošík
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3242)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Breiman, L., Friedman, J., Stone, C.J., Olshen, R.A.: Classification and Regression Trees, January 1984. Kluwer Academic Publishers, Dordrecht (1984)MATHGoogle Scholar
  3. 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. 4.
    Larrañaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms. GENA. Kluwer Academic Publishers, Dordrecht (2002)MATHGoogle Scholar
  5. 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-9743Google Scholar
  6. 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. 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-7Google Scholar
  8. 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. 9.
    Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating evolutionary algorithms. Artificial Intelligence 85, 245–276 (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Petr Pošík
    • 1
  1. 1.Faculty of Electrical Engineering, Department of CyberneticsCzech Technical University in PraguePrague 6Czech Republic

Personalised recommendations