排队论
马尔可夫链
计算机科学
马尔可夫过程
实时计算
数学优化
计算机网络
数学
统计
机器学习
作者
Weihua Gu,Michael J. Cassidy,Yuwei Li
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2014-08-13
卷期号:49 (2): 204-212
被引量:37
标识
DOI:10.1287/trsc.2014.0537
摘要
We consider curbside bus stops of the kind that serve multiple bus routes and that are isolated from the effects of traffic signals and other stops. A Markov chain embedded in the bus queueing process is used to develop steady-state queueing models of this stop type, as illustrated by two special cases. The models estimate the maximum number of buses that can arrive at and serve a stop and still satisfy a specified target of average bus delay. These models can be used to determine, for example, a stop’s suitable number of bus berths, given the bus demand and the specified delay target. The solutions for the two cases are used to derive a closed-form, parsimonious approximation model for general cases. This approximation matches simulations reasonably well for many conditions that arise in real settings; differences of less than 10% were common. Our results unveil how suitable choices for the number of bus berths are influenced by both the variation in the time that buses spend serving passengers at the stop and the specified delay target. The models further show why the proxy measure commonly used for the delay target in previous bus stop studies is a poor one.
科研通智能强力驱动
Strongly Powered by AbleSci AI