An Infeasible Start Algorithm for the Transit Route Network Design Problem
This paper develops an efficient heuristic for the transit network design, formulated as an integer programming problem. The suggested model includes a preliminary step of route set generation, followed by an iterative procedure that selects the best routes and corresponding headways. The iterative procedure is performed by an infeasible start algorithm that first assign all transit routes with the maximal frequency, and then iteratively eliminate routes and decrease frequencies of the less attractive ones. Routes are evaluated using a frequency based transit assignment model that considers online information. The proposed model is applied to the Winnipeg transit network. The transit network found by the algorithm comprise fewer, faster and more frequent lines that serve high volume of passengers. The running time of the algorithm is very short compared to parallel meta-heuristic algorithms and therefore applicable to large-scale networks. The relative simplicity of the model creates transparency of the process and enables high control of the algorithm steps.
-
Supplemental Notes:
- This paper was sponsored by TRB committee AP025 Standing Committee on Public Transportation Planning and Development.
-
Corporate Authors:
Transportation Research Board
, -
Authors:
- Oliker, Nurit
- Bekhor, Shlomo
-
Conference:
- Transportation Research Board 98th Annual Meeting
- Location: Washington DC, United States
- Date: 2019-1-13 to 2019-1-17
- Date: 2019
Language
- English
Media Info
- Media Type: Digital/other
- Features: References;
- Pagination: 5p
Subject/Index Terms
- TRT Terms: Algorithms; Headways; Integer programming; Public transit; Routes; Traffic assignment
- Geographic Terms: Winnipeg (Canada)
- Subject Areas: Planning and Forecasting; Public Transportation;
Filing Info
- Accession Number: 01697502
- Record Type: Publication
- Report/Paper Numbers: 19-02222
- Files: TRIS, TRB, ATRI
- Created Date: Mar 1 2019 3:51PM