摘要
研究了城市轨道交通多个循环区段线路上列车最优开行方案的计算机自动编制问题 ,给出各种循环方式下车底运用数下界的数学计算公式 .建立了使列车实载率达到最大的列车日班次运行计划的优化模型 ,并给出一个求该模型的计算机算法 .实现了编制城轨列车班次计划的自动化 .
The paper studies the automatic program of optimal running-plan of train number on computer for the urban railway traffic with all kinds of cycling considered.The mathematical formulas are firstly obtained for minimal number of trains. The optimal model is formed for the train running-plan,in which the rates of virtual loading can reach the maximum. The computer algorithm is designed for the very model, and the optimal running can be got automatically.
出处
《同济大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2004年第8期1005-1008,1014,共5页
Journal of Tongji University:Natural Science
关键词
城市轨道交通
班次计划
优先模型
算法
urban railway traffic
running-plan
optimal model
algorithm