@article{Branke2004,
abstract = {Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searching for the whole Pareto-optimal front of solutions, and relies on a decision maker to finally select a single solution. However, in particular if the number of objectives is large, the number of Pareto-optimal solutions may be huge, and it may be very difficult to pick one "best" solution out of this large set of alternatives. As we argue in this paper, the most interesting solutions of the Pareto-optimal front are solutions where a small improvement in one objective would lead to a large deterioration in at least one other objective. These solutions are sometimes also called "knees". We then introduce a new modified multi-objective evolutionary algorithm which is able to focus search on these knee regions, resulting in a smaller set of solutions which are likely to be more relevant to the decision maker. {\textcopyright} Springer-Verlag 2004.},
author = {Branke, J{\"{u}}rgen and Deb, Kalyanmoy and Dierolf, Henning and Osswald, Matthias},
doi = {10.1007/978-3-540-30217-9_73},
isbn = {3540230920},
issn = {16113349},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
mendeley-groups = {COIN{\_}website/2004},
pages = {722--731},
publisher = {Springer, Berlin, Heidelberg},
title = {{Finding knees in multi-objective optimization}},
url = {https://link.springer.com/chapter/10.1007/978-3-540-30217-9{\_}73},
volume = {3242},
year = {2004}
}