中文摘要：

分析了城市轨道交通网络末班车衔接关系的复杂性及影响因素，建立了网络末班车衔接方案优化模型；设计了网络线路衔接关系的图形和矩阵表示法；基于线路衔接关系的矩阵表达，借鉴最小生成树Kruskal算法的基本思想，提出了考虑客流需求及运营者的特定衔接需求的网络末班车衔接方案优化算法，并给出了具体算例，表明该算法具有较强的适用性、易于计算机实现，可为城市轨道交通网络运营部门制订网络末班车衔接计划提供决策支持．

英文摘要：

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.