地铁列车时刻表
电梯
控制(管理)
配对
点(几何)
计算机科学
常量(计算机编程)
运筹学
工程类
数学
超导电性
量子力学
结构工程
操作系统
物理
人工智能
程序设计语言
几何学
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1974-08-01
卷期号:8 (3): 248-264
被引量:133
摘要
If the time required for a vehicle (particularly buses or elevators) to load passengers is an increasing function of the number of passengers loaded, then, on a route served by more than one vehicle, the vehicles tend to form pairs. If a vehicle runs behind (ahead of) schedule, it typically will pick up more (less) passengers and get even further behind (ahead of) schedule. The following is concerned with a shuttle type of route having just two vehicles and serving passengers who arrive at a constant rate. There is one control point at which vehicles can be intentionally delayed. The object is to devise a strategy of control that will minimize the average waiting time of the passengers. The strategy must correct for random fluctuations in trip time so that the headways will not become sufficiently unequal as to initiate effects of pairing. An approximate solution of the optimization problem suggests that the optimal control involves sufficiently tight control that the pairing effect has little influence on the waiting times.
科研通智能强力驱动
Strongly Powered by AbleSci AI