Limits of scalability of multiobjective estimation of distribution algorithms

  • Sastry K
  • Goldberg D
  • Pelikan M
  • 25

    Readers

    Mendeley users who have this article in their library.
  • 27

    Citations

    Citations of this article.

Abstract

The paper analyzes the scalability of multiobjective estimation of distribution algorithms (MOEDAs), particularly multiobjective extended compact genetic algorithm (meCGA), on a class of boundedly-difficult additively-separable multiobjective optimization problems. The paper demonstrates 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. The exponential growth of the Pareto-optimal solutions introduces a fundamental limit on the scalability of MOEDAs and the number of competing substructures between the multiple objectives. Facetwise models are subsequently used to predict this limit in the 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.

Author-supplied keywords

  • Facetwise models
  • MOEDA
  • Pareto distribution
  • Pareto optimisation
  • Pareto-optimal solutions
  • evolutionary computation
  • genetic algorithms
  • meCGA
  • multiobjective estimation of distribution algorith
  • multiobjective extended compact genetic algorithm
  • multiobjective optimization problems
  • niching method
  • polynomial scalability
  • search problems

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • K Sastry

  • D E Goldberg

  • M Pelikan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free