arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 0908.3025cs.NE
收藏

高度多目标优化技术:某些非支配点优于其他点

Techniques for Highly Multiobjective Optimisation: Some Nondominated Points are Better than Others

David Corne, Joshua Knowles

摘要:

进化多目标优化(EMO)的研究领域是更好地理解EMO算法的性质和能力,并积累大量证据证明其在实际应用中的价值。一个紧迫的新问题是,青睐EMO算法的规模不佳时,问题有很多(如五个或更多)的目标。其中一个主要原因是,在多目标EMO搜索中,种群很可能主要由非支配解组成。反过来,这意味着常用的算法无法出于选择性目的区分这些。然而,有一些方法可以有效地用于对非支配集中的点进行排序,因此可以有效地支持EMO搜索中的选择。在这里,我们讨论和比较几个这样的方法。我们的主要发现是,经常被忽视的平均排名策略的简单变体通常优于其他测试方法,涵盖5-20个目标和不同数量的目标间相关性的问题。

英文摘要:

The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much evidence of their worth in practical scenarios. An urgent emerging issue is that the favoured EMO algorithms scale poorly when problems have many (e.g. five or more) objectives. One of the chief reasons for this is believed to be that, in many-objective EMO search, populations are likely to be largely composed of nondominated solutions. In turn, this means that the commonly-used algorithms cannot distinguish between these for selective purposes. However, there are methods that can be used validly to rank points in a nondominated set, and may therefore usefully underpin selection in EMO search. Here we discuss and compare several such methods. Our main finding is that simple variants of the often-overlooked Average Ranking strategy usually outperform other methods tested, covering problems with 5-20 objectives and differing amounts of inter-objective correlation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑