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

考虑车辆容量的公共交通动态交通分配

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities

Julian Patzner, Matthias Müller-Hannemann

AI总结:

本文扩展基于 CSA 的公共交通分配方法,提出保证车辆容量可行并刻画拥堵、拒载、延误及乘客学习适应的动态仿真框架,且在哥廷根和斯图加特网络上实现秒级日分配计算。

摘要:

交通分配是许多城市交通规划工具的核心组成部分,用于确定交通在运输网络上的分布方式。我们研究公共交通交通分配的计算任务:给定一个公共交通网络、时刻表、车辆容量和需求(即一份乘客列表,每位乘客都有对应的起点、终点和出发时间),目标是预测由此产生的客流以及每辆车相应的载客量。对个体乘客进行微观随机仿真是一种标准方法,但计算成本高昂。Briem 等人(2017)已经表明,对 Connection Scan Algorithm(CSA,连接扫描算法)进行巧妙改造可以产生高效的交通分配算法,但该方法忽略车辆容量,从而导致车辆过度拥挤。本文以他们的工作为起点,提出一种新的扩展模型,保证分配满足容量可行性,并纳入动态网络拥堵效应,例如车辆拥挤、拒绝登车和停靠时间延误。此外,我们还纳入个体乘客基于其网络使用经验进行的学习与适应。应用场景包括研究由适应导致的感知出行时间演变、容量增加的影响,或时刻表变化(如新增或取消某一班次或整条线路)所引发的网络效应。所提出的框架已在德国哥廷根和斯图加特的公共交通网络上进行实验评估。仿真表现出很高的效率:在标准个人计算机上,每个仿真日的交通分配计算仅需几秒钟。

英文摘要:

Traffic assignment is a core component of many urban transport planning tools. It is used to determine how traffic is distributed over a transportation network. We study the task of computing traffic assignments for public transport: Given a public transit network, a timetable, vehicle capacities and a demand (i.e. a list of passengers, each with an associated origin, destination, and departure time), the goal is to predict the resulting passenger flow and the corresponding load of each vehicle. Microscopic stochastic simulation of individual passengers is a standard, but computationally expensive approach. Briem et al. (2017) have shown that a clever adaptation of the Connection Scan Algorithm (CSA) can lead to highly efficient traffic assignment algorithms, but ignores vehicle capacities, resulting in overcrowded vehicles. Taking their work as a starting point, we here propose a new and extended model that guarantees capacity-feasible assignments and incorporates dynamic network congestion effects such as crowded vehicles, denied boarding, and dwell time delays. Moreover, we also incorporate learning and adaptation of individual passengers based on their experience with the network. Applications include studying the evolution of perceived travel times as a result of adaptation, the impact of an increase in capacity, or network effects due to changes in the timetable such as the addition or the removal of a service or a whole line. The proposed framework has been experimentally evaluated with public transport networks of Göttingen and Stuttgart (Germany). The simulation proves to be highly efficient. On a standard PC the computation of a traffic assignment takes just a few seconds per simulation day.

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

↑