城市轨道交通网络首末班车协调计划研究

oordinated plan of the first and last trains bears important significance in improving the operation service level and playing the overall network function in urban rail transit. Considering the complexity of the connection relation between the first and last trains, a model to optimize the connection scheme was built on the basic of the analysis of network topology, the passenger flow demand and operation route-information. A model solution was proposed with a reference to the Kruskal algorithm of maximum spanning tree. Finally, an empirical analysis of Beijing rail transit network was made to invalidate the validity and accuracy, results showed that: the algorithm could effectively generate the connection scheme of the first and last trains, and could provide a decision support to network operation in urban rail transit network.