Many-objective problems: Challenges and methods

23Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter presents a short review of the state-of-the-art efforts for understanding and solving problems with a large number of objectives (usually known as many-objective optimization problems, MOP s). The first part of the chapter presents the current studies aimed at discovering the sources that make a multiobjective optimization problem (MOP) harder when more objectives are added, degrading in this way, the performance of a multiobjective evolutionary algorithm (MOEA). Next, some of the most relevant techniques designed to deal with MOPs are presented and categorized.

Cite

CITATION STYLE

APA

Jaimes, A. L., & Coello, C. A. C. (2015). Many-objective problems: Challenges and methods. In Springer Handbook of Computational Intelligence (pp. 1033–1046). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-43505-2_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free