Dynamic user optimal assignment with physical queues for a many-to-many OD pattern
Dynamic user optimal assignment with physical queues for a many-to-many OD pattern
复制标题
DOI：
10.1016/s0191-2615(00)00005-9
复制
发表时间：
2001-06
影响因子：
6.8
通讯作者：
M. Kuwahara;T. Akamatsu
中科院分区：
文献类型：
--
作者：
M. Kuwahara;T. Akamatsu
本研究扩展了点队列概念下的动态用户最优分配，以处理物理队列问题。给定时间相关的多对多OD卷，本文首先给出了服从流守恒和先进先出队列原则的分配公式。然后定义了最优条件，并讨论了基于运动波理论的物理队列传播。最后，提出了一种求解算法，并通过算例分析了点队列分析与物理队列分析的典型区别。
This research extends the dynamic user optimal assignment under the point queue concept so as to deal with physical queues. Given time-dependent many-to-many OD volumes, this paper first shows the formulation of the assignment subject to the flow conservation and the first-in-first-out (FIFO) queue discipline. The optimal condition is then defined and the physical queue propagation based on the kinematic wave theory is discussed. Finally, a solution algorithm is proposed and typical differences between point and physical queue analyses are presented through an example calculation.