arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.02086cs.DScs.NI
收藏

加权时间依赖网络中Pareto最优路径的计算

On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks

Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot

摘要:

加权点可用性时间依赖网络是时间边的列表,其中每个时间边具有出现时间值、行进时间值和成本值。本文研究了加权点可用时变网络中的单源Pareto问题,它包括对任意目的地d计算所有Pareto最优对(t,c),其中t和c分别是从s到d的路径的到达时间和费用(一对(t,c)是帕累托最优的,如果没有路径的到达时间小于t和成本不差于c或到达时间不大于t和更好的成本)。我们设计并分析了一个求解该问题的通用算法,其时间复杂度为O(M log P),其中M为时间边数,P为网络中每个节点的最大Pareto最优对数.这种复杂性显著地改善了先前已知解决方案的时间复杂度。我们的算法可以用来解决几个不同的最小成本路径问题的加权点可用性时间依赖网络的各种各样的成本定义,它可以很容易地修改,以处理单目的地帕累托问题。我们的所有结果适用于有向网络,但它们可以很容易地适应无向网络,没有边的零旅行时间。

英文摘要:

A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. In this paper we consider the single source Pareto problem in weighted point-availability time-dependent networks, which consists of computing, for any destination d, all Pareto optimal pairs (t, c), where t and c are the arrival time and the cost of a path from s to d, respectively (a pair (t, c) is Pareto optimal if there is no path with arrival time smaller than t and cost no worse than c or arrival time no greater than t and better cost). We design and analyse a general algorithm for solving this problem, whose time complexity is O(M log P), where M is the number of temporal edges and P is the maximum number of Pareto optimal pairs for each node of the network. This complexity significantly improves the time complexity of the previously known solution. Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem. All our results apply to directed networks, but they can be easily adapted to undirected networks with no edges with zero travel time.

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

↑