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

被引:223
|
作者
Deb, Kalyanmoy [1 ,2 ]
Gupta, Shivam [3 ]
机构
[1] IIT Kanpur, Kanpur Genet Algorithms Lab, Dept Mech Engn, Kanpur 208016, Uttar Pradesh, India
[2] Aalto Univ, Dept Business Technol, Sch Econ, FI-00076 Aalto, Finland
[3] IIT Kanpur, Dept Civil Engn, Kanpur 208016, Uttar Pradesh, India
关键词
knee point; preferred solutions; bicriteria problems; evolutionary algorithms; NSGA-II;
D O I
10.1080/0305215X.2010.548863
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:1175 / 1204
页数:30
相关论文
共 50 条