2013 | OriginalPaper | Buchkapitel
Scalability of Population-Based Search Heuristics for Many-Objective Optimization
verfasst von : Ramprasad Joshi, Bharat Deshpande
Erschienen in: Applications of Evolutionary Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Beginning with Talagrand [16]’s seminal work, isoperimetric inequalities have been used extensively in analysing randomized algorithms. We develop similar inequalities and apply them to analysing population-based randomized search heuristics for multiobjective optimization in ℝ
n
space. We demonstrate the utility of the framework in explaining an empirical observation so far not explained analytically: the curse of dimensionality, for many-objective problems. The framework makes use of the black-box model now popular in EC research.