Decomposable Problems, Niching, and Scalability of Multiobjective Estimation of Distribution Algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The paper analyzes the scalability of multiobjective estimation of distribution algorithms (MOEDAs) on a class of boundedly-difficult additively-separable multiobjective optimization problems. The paper illustrates that even if the linkage is correctly identified, massive multimodality of the search problems can easily overwhelm the nicher and lead to exponential scale-up. Facetwise models are subsequently used to propose a growth rate of the number of differing substructures between the two objectives to avoid the niching method from being overwhelmed and lead to polynomial scalability of MOEDAs.
Submitted to Genetic and Evolutionary Computation Conference, GECCO-2005

Keywords

Neural and Evolutionary Computing, Artificial Intelligence

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32629

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0502057
 http://arxiv.org/abs/cs/0502057

Collections

arXiv