摘要
针对车辆段内干扰源对地铁列车运行的扰动,以列车连带晚点期望值最小为目标,确定地铁列车平峰时段的始发时刻,分配初始缓冲时间。细分连带晚点,详细描述了连带晚点传播的各种情况,建立了简单情形下地铁列车初始布点的理论模型。经分析,该模型为凸规划的约束极值问题,且证明在小干扰条件下,均衡初始布点的列车时刻表为模型的最优解。
Due to the existence of disturbance sources along the metro line, metro train timetable has to allow for certain perturbations. Aimed at minimizing the expected value of knock - on delays, the optimized buffer time allocation scheme is established, where the departure time points of all the trains starting from the metro depot are determined. For convenience, the knock - on delays are subdivided into several types, then the details of train delay propagation are described. Subsequently, a theoretical model focusing on the initial layout distribution of the trains is proposed. Through analysis, the above - mentioned model is proved to be a convex programming problem with constrained optimization, and the uniformly distributed layout of train timetable is the optimal solution.
出处
《物流技术》
2010年第15期47-51,共5页
Logistics Technology
基金
国家自然科学基金项目(70631001
70971010)
北京市教委北京交通发展研究中心产学研联合博士生培养基地建设项目(BJ2009-04)
关键词
地铁列车
缓冲时间
初始布点
鲁棒性
Metro train
buffer time
initial distribution
robustness
