01154277

Component

Rapid Transit Network Design Problem (RTND) is a mathematical model which aims to find the best rapid transit routes combination. In this study, a new mathematical model and a solution algorithm is presented for RTND. This proposed model is formulated as a Mixed Integer Programming (MIP), which maximizes transit network coverage as its objective function. The author also design, a solution algorithm is suggested, which is composed of five main procedures: 1) Route Generation, 2) Route Combination, 3) Network Coverage Evaluation (NCE), 4) Branch Cutting, and 5) NCE Skipping. Route generation procedure specifies a set of candidate routes. Next, a search tree building strategy is applied to perform the search process through the candidate set. Afterwards, for a given transit network, NCE procedure should be executed to determine transit network coverage. Finally, the last two procedures, branch cutting and NCE Skipping criteria, are designed to recognize route combinations that cannot be optimal, and keep them away from executing NCE procedure. The algorithm is implemented in C# and some benchmark problems are used to evaluate its efficiency. The comparison between a computational time and a benchmark study shows an outstanding improvement achieved by this algorithm.

01147878

10-3334

English

18p

2010

Transportation Research Board 89th Annual Meeting

DVD

Figures (4) ; References (18) ; Tables (3)

Mixed integer programming; Public transit; Rapid transit; Transit operating agencies

Network design problem; Route generation; Transportation routes

Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning

Transportation Research Board Annual Meeting 2010 Paper #10-3334

TRIS, TRB

Jan 25 2010 11:40AM