Kumara Sastry

Limits of scalability of multiobjective estimation of distribution algorithms

Sastry, K., Pelikan, M., Goldberg, D. E. (2005). Proceedings of the Congress on Evolutionary Computation, 3, 2217—2224. [Full paper - PDF] [Full paper - PS] [Presentation slides].

Abstract:
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.

Related Posts:

• Multiobjective estimation of distribution algorithms
• Towards billion bit optimization via parallel estimation of distribution algorithm
• Efficiency enhancement of estimation of distribution algorithms
• Sub-structural niching in estimation of distribution algorithms
• Multiojbective hBOA, clustering, and scalability

Comments are closed.