混合非支配排序算法:分治排序与最优排序
Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort
摘要:
许多生产级算法受益于将用于解决大问题实例的渐进有效算法(通过将它们拆分为较小的问题实例)与用于解决小子问题的具有非常小的实现常数的渐进低效算法相结合。一个著名的例子是稳定排序,其中合并排序通常与插入排序相结合,以实现恒定但明显的速度提升。我们把这个想法应用到非支配排序中。也就是说,我们结合了分治算法,它具有目前最好的已知的渐近运行时间的$O(N (\log N)^{M - 1})$,与最佳顺序排序算法,它具有运行时间的$O(N^2 M)$,但展示了最好的实际性能的二次算法。经验评估表明,混合动力的运行时间通常不会比两个原始算法差,而对于大量的点,它优于他们至少20%。对于较少数量的目标,加速可以高达四倍。
英文摘要:
Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small implementation constant for solving small subproblems. A well-known example is stable sorting, where mergesort is often combined with insertion sort to achieve a constant but noticeable speed-up. We apply this idea to non-dominated sorting. Namely, we combine the divide-and-conquer algorithm, which has the currently best known asymptotic runtime of $O(N (\log N)^{M - 1})$, with the Best Order Sort algorithm, which has the runtime of $O(N^2 M)$ but demonstrates the best practical performance out of quadratic algorithms. Empirical evaluation shows that the hybrid's running time is typically not worse than of both original algorithms, while for large numbers of points it outperforms them by at least 20%. For smaller numbers of objectives, the speedup can be as large as four times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。