- Published 2008 in European Journal of Operational Research

Research into the dynamics of Genetic Algorithms (GAs) has led to the field of Estimation–of–Distribution Algorithms (EDAs). For discrete search spaces, EDAs have been developed that have obtained very promising results on a wide variety of problems. In this paper we investigate the conditions under which the adaptation of this technique to continuous search spaces fails to perform optimization efficiently. We show that without careful interpretation and adaptation of lessons learned from discrete EDAs, continuous EDAs will fail to perform efficient optimization on even some of the simplest problems. We reconsider the most important lessons to be learned in the design of EDAs and subsequently show how we can use this knowledge to extend continuous EDAs that were obtained by straightforward adaptation from the discrete domain so as to obtain an improvement in performance. Experimental results are presented to illustrate this improvement and to additionally confirm experimentally that a proper adaptation of discrete EDAs to the continuous case indeed requires careful consideration.

@article{Bosman2008MatchingIS,
title={Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms},
author={Peter A. N. Bosman and J{\"{o}rn Grahl},
journal={European Journal of Operational Research},
year={2008},
volume={185},
pages={1246-1264}
}