2008 | OriginalPaper | Buchkapitel
Handling Uncertainties in Evolutionary Multi-Objective Optimization
verfasst von : Kay Chen Tan, Chi Keong Goh
Erschienen in: Computational Intelligence: Research Frontiers
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
Evolutionary algorithms are stochastic search methods that are efficient and effective for solving sophisticated multi-objective (MO) problems. Advances made in the field of evolutionary multi-objective optimization (EMO) are the results of two decades worth of intense research, studying various topics that are unique to MO optimization. However many of these studies assume that the problem is deterministic and static, and the EMO performance generally deteriorates in the presence of uncertainties. In certain situations, the solutions found may not even be implementable in practice. In this chapter, the challenges faced in handling three different forms of uncertainties in EMO will be discussed, including 1) noisy objective functions, 2) dynamic MO fitness landscape, and 3) robust MO optimization. Specifically, the impact of these uncertainties on MO optimization will be described and the approaches/modifications to basic algorithm design for better and robust EMO performance will be presented.