同济大学学报（自然科学版）2012，Vol.40Issue(10)：1510-1516,7.DOI:10.3969/j.issn.0253-374x.2012.10.013
城市轨道交通网络末班车衔接方案的综合优化
Comprehensive Optimization for Connection Scheme of Last Trains in Urban Mass Transit Network
摘要
Abstract
This paper presents an analysis of the complexity and influencing factors of the connection relations among the last trains in urban mass transit network and a model built to optimize the connection scheme of the last trains. And then, this paper presents a design of the graph notation and matrix notation of connection relations among different lines. Based on the matrix notation of connection relations and the consideration of the passenger flow demand and operational demand, an algorithm is derived to optimize the connection scheme of the last trains with a reference to the Kruskal algorithm of minimum spanning tree. A numerical example is given to illustrate the feasibility of the developed algorithm. This algorithm can be easily realized by computer program, which provides a decision support to the operational department of urban mass transit in compiling the connection plan of the last trains of the whole network.关键词
城市轨道交通网络/末班车/衔接方案/客流需求/运营需求Key words
urban mass transit network/ the last train/ connection scheme/ passenger flow demand/ operational demand分类
交通工程引用本文复制引用
徐瑞华,李璇..城市轨道交通网络末班车衔接方案的综合优化[J].同济大学学报（自然科学版）,2012,40(10):1510-1516,7.基金项目
国家自然科学基金(71071112) （71071112）
