A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems
A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems
复制标题
DOI：
10.1007/11844297_56
复制
发表时间：
2006-09
期刊：
影响因子：
--
通讯作者：
S. Kukkonen;K. Deb
中科院分区：
文献类型：
--
作者：
S. Kukkonen;K. Deb
解的多样性保持是多目标优化问题的重要内容。现有的技术是次优的意义上获得的分布或执行时间。本文提出了一种有效且相对快速的非支配解集剪枝方法。所提出的方法是基于拥挤估计技术，使用最近的邻居的解决方案，在欧几里德意义上，和一种技术，快速找到这些最近的邻居。该方法进行了实验评估，结果表明，获得的分布和执行时间之间的一个很好的权衡。分布在多目标问题中也是好的，当目标数超过两个时。
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.