arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.04018cs.SIcs.SYeess.SY
收藏

用户均衡交通分配:k路减-加算法

User equilibrium traffic assignment: k paths subtracting-adding algorithm

Milos Nikolic, Dusan Teodorovic

摘要:

交通分配问题是最重要的交通规划问题之一。交通规划者、交通工程师和计算机科学家所面临的任务是生成高质量的用户均衡近似解,以便在合理的CPU时间内进行交通情景比较。我们引入了k路径减-加(k-PSA)算法来近似交通分配问题的用户平衡。k-PSA算法由两个交替的阶段组成:(1)扩大吸引路径的集合;(2)为每个起点-目的地节点对生成的吸引路径之间的减-加行程。该算法迭代地执行这两个阶段,直到每个起点-目的地对的路径数为k。我们测试了所提出的算法在四个基准交通网络的文献。进行的数值试验表明,所提出的方法产生,在短时间内,计算时间,平均而言,非常接近用户平衡的解决方案。

英文摘要:

The traffic assignment problem is one of the most important transportation planning problems. The task faced by transportation planners, traffic engineers, and computer scientists is to generate high quality, approximate solutions of users equilibrium, that enable traffic scenario comparisons in a reasonable CPU time. We introduce the k Paths Subtracting-Adding (k-PSA) algorithm to approximate the user equilibrium of the traffic assignment problem. The k-PSA algorithm consists of two alternating phases: (1) enlargement of the set of attractive paths; (2) subtracting-adding trips between generated attractive paths for each origin-destination pair of nodes. The proposed algorithm performs the two phases iteratively until the number of paths for each origin-destination pair is k. We tested the proposed algorithm on four benchmark transportation networks from the literature. The performed numerical tests show that the proposed approach generates, in short, computation times, solutions that are, on average, very close to the user equilibrium.

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

↑