arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.3447math.DSmath.OC
收藏

交通系统行程时间的上界

Upper bounds for the travel time on traffic systems

Nadir Farhi, Habib Haj-Salem, Jean-Patrick Lebacque

摘要:

衡量道路交通网络性能和舒适度的一个关键指标是网络用户完成行程所需的旅行时间。道路交通网络上的行程时间是随机的,高度可变的,并依赖于多个参数。因此,必须有良好的指标和衡量其变化的方法。在这篇文章中,我们扩展了最近的方法,用于推导道路交通网络中旅行时间的确定性界限(Farhi,Haj-Salem和Lebacque 2013)。该方法包括在使用代数制定的细胞传输交通模型的环路上,其中的汽车动力学被看作是一个线性最小加系统。系统的冲激响应是解析推导出来的,并被解释为网络微积分理论中所谓的服务曲线(其中道路被视为服务器)。后者的理论的基本结果,然后使用推导出的上界的行程时间通过环路。在这篇文章中,我们考虑开放系统而不是封闭系统。我们定义了一组基本的交通系统和这样的系统的级联的操作员。我们表明,任何道路行程的交通系统可以建立连接一些基本的交通系统。系统的连接在于根据组合系统的服务保证给出结果系统的服务保证。我们用一个数值例子来说明这种方法,在这里我们计算一个上界的行程时间在一个给定的路线在城市网络。

英文摘要:

A key measure of performance and comfort in a road traffic network is the travel time that the users of the network experience to complete their journeys. Travel times on road traffic networks are stochastic, highly variable, and dependent on several parameters. It is, therefore, necessary to have good indicators and measures of their variations. In this article, we extend a recent approach for the derivation of deterministic bounds on the travel time in a road traffic network (Farhi, Haj-Salem and Lebacque 2013). The approach consists in using an algebraic formulation of the cell-transmission traffic model on a ring road, where the car-dynamics is seen as a linear min-plus system. The impulse response of the system is derived analytically, and is interpreted as what is called a service curve in the network calculus theory (where the road is seen as a server). The basic results of the latter theory are then used to derive an upper bound for the travel time through the ring road. We consider in this article open systems rather than closed ones. We define a set of elementary traffic systems and an operator for the concatenation of such systems. We show that the traffic system of any road itinerary can be built by concatenating a number of elementary traffic systems. The concatenation of systems consists in giving a service guarantee of the resulting system in function of service guarantees of the composed systems. We illustrate this approach with a numerical example, where we compute an upper bound for the travel time on a given route in a urban network.

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

↑