@InProceedings{10.1007/11844297_56,
author="Kukkonen, Saku
and Deb, Kalyanmoy",
editor="Runarsson, Thomas Philip
and Beyer, Hans-Georg
and Burke, Edmund
and Merelo-Guerv{\'o}s, Juan J.
and Whitley, L. Darrell
and Yao, Xin",
title="A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems",
booktitle="Parallel Problem Solving from Nature - PPSN IX",
year="2006",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="553--562",
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.",
isbn="978-3-540-38991-0"
}