Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks
2005 (English)In: Evolutionary Computation, ISSN 1063-6560, Vol. 13, no 1, 43-66 p.Article in journal (Refereed) Published
Many optimization problems are what can be called globally multimodal, i.e., they present several global optima. Unfortunately, this is a major source of difficulties for most estimation of distribution algorithms, making their effectiveness and efficiency degrade, due to genetic drift. With the aim of overcoming these drawbacks for discrete globally multimodal problem optimization, this paper introduces and evaluates a new estimation of distribution algorithm based on unsupervised learning of Bayesian networks. We report the satisfactory results of our experiments with symmetrical binary optimization problems. © 2005 by the Massachusetts Institute of Technology.
Place, publisher, year, edition, pages
2005. Vol. 13, no 1, 43-66 p.
IdentifiersURN: urn:nbn:se:liu:diva-30219DOI: 10.1162/1063656053583432Local ID: 15716OAI: oai:DiVA.org:liu-30219DiVA: diva2:251041