瓶颈
排队论
排队
地铁列车时刻表
计算机科学
运输工程
高峰时间
运筹学
实时计算
计算机网络
数学
工程类
嵌入式系统
操作系统
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1990-08-01
卷期号:24 (3): 217-229
被引量:82
标识
DOI:10.1287/trsc.24.3.217
摘要
Several researchers have analyzed queueing patterns at bottleneck sites on freeways during the morning peak. However, all previous studies have assumed that each commuter passes only one bottleneck during his commuting trip. Here, we consider the possibility that some commuters pass two bottlenecks on their way to work. The objective is to obtain cumulative arrival curves at each of the two bottlenecks, given who passes both bottlenecks and who passes only one, and their desired arrival times at their work places (work starting times). Each commuter using the freeway is assumed to have the same travel cost function which consists of time-dependent costs due to queueing delay (waiting time in a queue) and schedule delay (the time difference between his actual and desired arrival time at the work place). Commuter trips are assigned temporally so as to establish an equilibrium in which each commuter seeks to minimize his travel cost. The queue evolutions illustrate a service priority at the downstream bottleneck in favor of commuters passing only the downstream bottleneck. One of the countermeasures for this equity problem in the service priority would be to meter the favored commuters.
科研通智能强力驱动
Strongly Powered by AbleSci AI