arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.10302cs.DS
收藏

基于Pareto最优边界子集有效表示的近似双准则搜索

Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier

Oren Salzman

摘要:

我们考虑的双标准最短路径问题,我们要计算最短路径的图,同时平衡两个成本函数。虽然这个问题有许多应用,但通常没有同时最小化两个成本函数的路径。因此,我们通常考虑在两个成本函数中没有路径严格优于其他路径的路径集合,称为帕累托最优边界。不幸的是,这个集合的大小可能是图顶点数的指数,一般问题是NP-难的。虽然现有的方案来近似这个集合存在,它们可能比精确的方法时,应用到相对较小的实例和运行它们的图形上,即使是一个中等数量的节点往往是不切实际的。问题的关键在于如何有效地逼近帕累托最优边界。我们的关键见解是,帕累托最优边界可以近似使用路径对。这个简单的观察使我们能够运行最佳优先搜索,同时有效地修剪掉中间解,以获得任何给定近似因子的帕累托前沿的近似值。我们比较了我们的方法与适应BOA*,国家的最先进的算法计算精确解的双标准最短路径问题。我们的实验表明,随着问题变得更加困难,所获得的加速比变得更加明显。具体来说,在大型路线图上,我们获得了超过$\times 8.5$的平均加速比和超过$\times 148$的最大加速比。

英文摘要:

We consider the bi-criteria shortest-path problem where we want to compute shortest paths on a graph that simultaneously balance two cost functions. While this problem has numerous applications, there is usually no path minimizing both cost functions simultaneously. Thus, we typically consider the set of paths where no path is strictly better then the others in both cost functions, a set called the Pareto-optimal frontier. Unfortunately, the size of this set may be exponential in the number of graph vertices and the general problem is NP-hard. While existing schemes to approximate this set exist, they may be slower than exact approaches when applied to relatively small instances and running them on graphs with even a moderate number of nodes is often impractical. The crux of the problem lies in how to efficiently approximate the Pareto-optimal frontier. Our key insight is that the Pareto-optimal frontier can be approximated using pairs of paths. This simple observation allows us to run a best-first-search while efficiently and effectively pruning away intermediate solutions in order to obtain an approximation of the Pareto frontier for any given approximation factor. We compared our approach with an adaptation of BOA*, the state-of-the-art algorithm for computing exact solutions to the bi-criteria shortest-path problem. Our experiments show that as the problem becomes harder, the speedup obtained becomes more pronounced. Specifically, on large roadmaps, we obtain an average speedup of more than $\times 8.5$ and a maximal speedup of over $\times 148$.

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

↑