What Do Different Traffic Flow Models Mean for System-Optimal Dynamic Traffic Assignment in a Many-to-One Network?
What Do Different Traffic Flow Models Mean for System-Optimal Dynamic Traffic Assignment in a Many-to-One Network?
复制标题
不同的流量模型对于多对一网络中的系统最优动态流量分配意味着什么？
DOI：
10.3141/2088-17
复制
发表时间：
2008
影响因子：
1.7
通讯作者：
H. M. Zhang
中科院分区：
文献类型：
--
作者：
Wei Shen;H. M. Zhang
本文应用多种宏观交通流模型来求解多对一网络中基于链路的系统最优动态交通分配问题。基于不同交通流模型的SO-DTA模型通常会产生不同的最优链路交通演化模式，但交通流模型是否以及如何影响最小系统成本和相应的最优到达目的地模式尚不清楚。研究了三种交通流模型——点队列、空间队列和细胞传输，并比较了它们在多对一网络中的最小系统成本。证明了对于具有两个连续瓶颈的线性网络、二进一出合并网络和一进二出发散网络这三种简单网络，基于这三种交通流模型的SO-DTA模型的最小系统成本是相同的。数值实验表明，对于一般的多对一网络，这一性质似乎是成立的。原因可能是三种交通流模型都以相同的速度传播非拥塞流，而总是以链路容量释放拥塞流。在SO-DTA应用程序中，主要关注的是最小的系统成本或到达目的地的模式，这些发现可以用来大大加快解决方案的过程。
A variety of macroscopic traffic flow models have been applied to formulate the link-based system optimal dynamic traffic assignment (SO-DTA) problem in a many-to-one network. It is expected that SO-DTA models based on various traffic flow models usually result in different optimal link traffic evolution patterns, but whether and how traffic flow models affect the minimal system cost and the corresponding optimal arrival pattern at the destination is unclear. Three traffic flow models–point-queue, spatial-queue, and cell-transmission–are examined, and their resulted minimal system cost in many-to-one networks is compared. It is proved that for three simple networks–a linear network with two sequential bottlenecks, a two-in-one-out merge network, and a one-in-two-out diverge network–the minimal system costs for the SO-DTA models based on these three traffic flow models are identical. Numerical experiments show that this property appears to be held for general many-to-one networks. The reason may be that all three traffic flow models propagate the uncongested flows at the same speed and release the congested flows always at the link capacity. In SO-DTA applications where only the minimal system cost or arrival pattern at the destination is of major interest, the findings can be utilized to substantially expedite the solution procedure.