arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.06106cs.NE
收藏

多目标优化的归并非支配排序算法

Merge Non-Dominated Sorting Algorithm for Many-Objective Optimization

Javier Moreno, Daniel Rodriguez, Antonio Nebro, Jose A. Lozano

摘要:

许多基于Pareto的多目标进化算法需要在每次迭代中根据优势原则对种群的解进行排序,这可能成为一个昂贵的操作,特别是在处理多目标优化问题的情况下。本文提出了一种新的计算非支配排序过程的有效算法,称为合并非支配排序(MNDS),它的最佳计算复杂度为$Θ(NlogN)$,最差计算复杂度为$Θ(MN^2)$.我们的方法是基于利用合并排序算法的特点,每个解决方案的优势集的计算。我们比较MNDS对四个众所周知的技术,可以被认为是最先进的。结果表明,MNDS算法优于其他技术的比较次数以及总运行时间。

英文摘要:

Many Pareto-based multi-objective evolutionary algorithms require to rank the solutions of the population in each iteration according to the dominance principle, what can become a costly operation particularly in the case of dealing with many-objective optimization problems. In this paper, we present a new efficient algorithm for computing the non-dominated sorting procedure, called Merge Non-Dominated Sorting (MNDS), which has a best computational complexity of $Θ(NlogN)$ and a worst computational complexity of $Θ(MN^2)$. Our approach is based on the computation of the dominance set of each solution by taking advantage of the characteristics of the merge sort algorithm. We compare the MNDS against four well-known techniques that can be considered as the state-of-the-art. The results indicate that the MNDS algorithm outperforms the other techniques in terms of number of comparisons as well as the total running time.

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

↑