A fast and effective method for pruning of non-dominated solutions in many-objective problems

Kukkonen, Saku ; Deb, Kalyanmoy (2006) A fast and effective method for pruning of non-dominated solutions in many-objective problems Lecture Notes in Computer Science, 4193 . pp. 553-562. ISSN 0302-9743

[img]
Preview
PDF - Author Version
745kB

Official URL: http://www.springerlink.com/content/u68537ug46383t...

Related URL: http://dx.doi.org/10.1007/11844297_56

Abstract

Diversity maintenance of solutions is an essential part in multi-objective optimization. Existing techniques are suboptimal either in the sense of obtained distribution or execution time. This paper proposes an effective and relatively fast method for pruning a set of non-dominated solutions. The proposed method is based on a crowding estimation technique using nearest neighbors of solutions in Euclidean sense, and a technique for finding these nearest neighbors quickly. The method is experimentally evaluated, and results indicate a good trade-off between the obtained distribution and execution time. Distribution is good also in many-objective problems, when number of objectives is more than two.

Item Type:Article
Source:Copyright of this article belongs to Springer.
ID Code:81660
Deposited On:07 Feb 2012 05:37
Last Modified:18 May 2016 23:07

Repository Staff Only: item control page