关键词: 城市交通, 轨道交通, 双层模型, 线网规划, 禁忌算法

Abstract: To address the lack of quantitative network generation techniques and high planning complexity in the case of large numbers of stations, this paper establishes a bi-level model composed of a network design model and a line selection model, and minimizes the total length of the network and maximizes the operational efficiency. The model considers the contiguity of stations and the presence of a line on the edge, represented by binaries variables in the planning of urban rail transit networks and lines given stations. Under the constraints of station accessibility and engineering feasibility, this paper designs a minimum spanning tree algorithm based on clustering and network repair strategies, to solve network design model and improve the computational speed of network generation. Under the constraints of operation feasibility, this paper designs an algorithm for solving the bi-objective programming based on the Tabu Search, which solves the line selection model and transforms the bi-objective programming problem into a single-objective programming problem. The bi-level model can automatically generate the optimal network and line alignments when using the stations in operation and passenger OD as input, and the results can be reasonable when compared with the opening transit network. The model results show that they are similar to the real network and lines, but have less the total length of the network and higher operational efficiency. The ratio of direct passenger flow to the total increases by 0.7% and the ratio of once- transfer passenger flow to the total increases by 4.2% when the total length of the network decreases by 1.7%.

Key words: urban traffic, rail transit, bi-level model, network and line planning, Tabu Search