瓶颈
排队
地铁列车时刻表
方案(数学)
计算机科学
排队论
数学优化
实时计算
计算机网络
数学
操作系统
数学分析
嵌入式系统
作者
Nima Shirmohammadi,Yafeng Yin
摘要
This paper proposes to use tradable credits to control the maximum queue length at a bottleneck. Given a queue length threshold specified by the traffic authority, the authors designed a tradable credit scheme to maintain the queue length of the bottleneck to be less than the threshold for homogenous travelers. The scheme was compared against a multistep tolling scheme under demand uncertainty. The authors then studied the capability of the tradable credit scheme in the presence of two types of user heterogeneity: proportional heterogeneity and heterogeneity in unit schedule penalty associated with late arrival (γ heterogeneity). It was found that the proposed scheme could successfully maintain the queue length under proportional heterogeneity, but not necessarily under γ heterogeneity. However, if the distribution of γ heterogeneity were known in advance, the scheme could be modified to ensure success in controlling queue length.
科研通智能强力驱动
Strongly Powered by AbleSci AI