基于权衡效用的拐点识别
Knee Point Identification Based on Trade-Off Utility
摘要:
拐点,其特点是在所有目标的最小权衡损失,是有吸引力的决策者在多准则决策。相比之下,其他帕累托最优解的吸引力较小,因为一个目标的微小改进可能导致至少一个其他目标的显着退化。在本文中,我们提出了一个简单而有效的拐点识别方法的基础上权衡效用,称为KPITU,以帮助决策者确定拐点从一组给定的权衡解决方案。KPITU的基本思想是通过比较一个解与其邻域内其他解的权衡效用来顺序验证该解是否为拐点。特别是,一个解是一个拐点,当且仅当它在其邻居中具有最佳权衡效用。此外,我们实现了一个GPU版本的KPITU进行的拐点识别在一个并行的方式。此GPU版本将最坏情况下的复杂度从二次降低到线性。为了验证KPITU的有效性,我们将其性能与134个测试问题实例上的五种最先进的拐点识别方法进行了比较。实验结果充分证明了KPITU算法在求解局部拐点较多的问题时的优异性能。最后,我们进一步验证了KPITU的有效性,指导EMO算法搜索的膝点上飞在进化过程中。
英文摘要:
Knee points, characterised as their smallest trade-off loss at all objectives, are attractive to decision makers in multi-criterion decision-making. In contrast, other Pareto-optimal solutions are less attractive since a small improvement on one objective can lead to a significant degradation on at least one of the other objectives. In this paper, we propose a simple and effective knee point identification method based on trade-off utility, dubbed KPITU, to help decision makers identify knee points from a given set of trade-off solutions. The basic idea of KPITU is to sequentially validate whether a solution is a knee point or not by comparing its trade-off utility with others within its neighbourhood. In particular, a solution is a knee point if and only if it has the best trade-off utility among its neighbours. Moreover, we implement a GPU version of KPITU that carries out the knee point identification in a parallel manner. This GPU version reduces the worst-case complexity from quadratic to linear. To validate the effectiveness of KPITU, we compare its performance with five state-of-the-art knee point identification methods on 134 test problem instances. Empirical results fully demonstrate the outstanding performance of KPITU especially on problems with many local knee points. At the end, we further validate the usefulness of KPITU for guiding EMO algorithms to search for knee points on the fly during the evolutionary process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。