Numerical optimization with real-valued estimation-of-distribution algorithms

12Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter we focus on the design of real-valued estimation-of-distribution algorithms (EDAs) for the task of numerical optimization. Here, both the problem variables as well as their encoding are real values. Concordantly, the type of probability distribution to be used for estimation and sampling in the EDA is continuous. In this chapter we indicate the main challenges in this area. Furthermore, we review the existing literature to indicate the current EDA practice for realvalued numerical optimization. Based on observations originating from this existing research and on existing work in the literature regarding dynamics of continuous EDAs, we draw some conclusions about the feasibility of existing EDA approaches. Also we provide an explanation for some observed deficiencies of continuous EDAs as well as possible improvements and future directions of research in this branch of EDAs. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Bosman, P. A. N., & Thierens, D. (2007). Numerical optimization with real-valued estimation-of-distribution algorithms. Studies in Computational Intelligence. https://doi.org/10.1007/978-3-540-34954-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free