Decomposable Problems, Niching, and Scalability of Multiobjective Estimation of Distribution Algorithms
<|reference_start|>Decomposable Problems, Niching, and Scalability of Multiobjective Estimation of Distribution Algorithms: 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.<|reference_end|>
@article{sastry2005decomposable,
    title={Decomposable Problems, Niching, and Scalability of Multiobjective
  Estimation of Distribution Algorithms},
    author={Kumara Sastry, Martin Pelikan, David E. Goldberg},
    journal={arXiv preprint arXiv:cs/0502057},
    year={2005},
    number={IlliGAL Report No. 2005004},
    archivePrefix={arXiv},
    eprint={cs/0502057},
    primaryClass={cs.NE cs.AI}
}