WAITING TIMES AT PERIODICALLY SWITCHED ONE-WAY TRAFFIC LANES
WAITING TIMES AT PERIODICALLY SWITCHED ONE-WAY TRAFFIC LANES
复制标题
定期切换单向交通车道的等待时间
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
M. Ebben
中科院分区：
文献类型：
--
作者：
M. Heijden;A. Harten;M. Ebben
我们研究了两个方向的交通共享的车道上的车辆等待时间。与交叉路口相比，我们关注的是共享基础设施的车辆通过时间可能很长的情况。该模型的动机源于我们对地下交通系统的研究。我们根据定期控制规则检查车辆等待时间（即基础设施上的行驶方向根据固定的时间表在两个方向之间切换）。我们分析对称和非对称系统（即，两个方向的车辆到达率以及有效的绿色和红色时段可能不同）。事实上，我们正在处理一个单服务器、两个队列轮询系统，具有随机设置时间和定期（非详尽）服务规则。我们开发了平均等待时间的近似值，并通过与模拟结果的比较表明，泊松到达的准确度通常在 1-2% 范围内。此外，我们还指出了如何将我们的近似推广到复合泊松到达。
We study vehicle waiting times at a traffic lane that is shared by traffic from two directions. In contrast to crossovers, we focus on instances where the vehicle passing time of the shared infrastructure can be large. The motivation for this model arises from our research on underground transportation systems. We examine vehicle waiting times under periodic control rules (i.e., the driving direction on the infrastructure is switched between two directions according to a fixed time schedule). We analyze both symmetric and asymmetric systems (i.e., vehicle arrival rates as well as effective green and red periods may be different for both directions). In fact, we are dealing with a single server, two-queue polling system with random setup times and periodic (nonexhaustive) service discipline. We develop approximations for the mean waiting time and we show by comparison to simulation results that the accuracy is usually in the range of 1–2% for Poisson arrivals. Also, we indicate how our approximations can be generalized to compound Poisson arrivals.