Understanding knee points in bicriteria problems and their implications as preferred solution principles

Deb, Kalyanmoy ; Gupta, Shivam (2011) Understanding knee points in bicriteria problems and their implications as preferred solution principles Engineering Optimization, 43 (11). pp. 1175-1204. ISSN 0305-215X

[img]
Preview
PDF - Author Version
1MB

Official URL: http://www.tandfonline.com/doi/abs/10.1080/0305215...

Related URL: http://dx.doi.org/10.1080/0305215X.2010.548863

Abstract

A knee point is almost always a preferred trade-off solution, if it exists in a bicriteria optimization problem. In this article, an attempt is made to improve understanding of a knee point and investigate the properties of a bicriteria problem that may exhibit a knee on its Pareto-optimal front. Past studies are reviewed and a couple of new definitions are suggested. Additionally, a knee region is defined for problems in which, instead of one, a set of knee-like solutions exists. Edge-knee solutions, which behave like knee solutions but lie near one of the extremes on the Pareto-optimal front, are also introduced. It is interesting that in many problem-solving tasks, despite the existence of a number of solution methodologies, only one or a few of them are commonly used. Here, it is argued that often such common solution principles are knee solutions to a bicriteria problem formed with two conflicting goals of the underlying problem-solving task. The argument is illustrated on a number of tasks, such as regression, sorting, clustering and a number of engineering designs.

Item Type:Article
Source:Copyright of this article belongs to Taylor and Francis Group.
Keywords:Knee Point; Preferred Solutions; Bicriteria Problems; Evolutionary Algorithms; NSGA-II
ID Code:81048
Deposited On:03 Feb 2012 11:55
Last Modified:18 May 2016 22:45

Repository Staff Only: item control page