01658121

Component

A solution method is proposed to address the multi-objective transit network design problem with variable route set size. The solution method integrates a novel route set size alternating heuristic and a non-dominated sorting genetic algorithm. The route set size alternating heuristic is designed to change the number of routes in a route set by adding/deleting the most suitable route. The non-dominated sorting genetic algorithm aims to determine approximate Pareto front. The proposed algorithms are tested on Mandl’s benchmark network and a large real network. The results for Mandl’s network show that the route set size alternating heuristic can save considerable computation time without deteriorating the solution quality. The obtained approximate Pareto front for the large real network evidences that the proposed solution method can significantly improve the solution quality when compared with previously published results

This paper was sponsored by TRB committee AP010 Standing Committee on Transit Management and Performance. Pareto-Optimal Solutions for the Multiobjective Transit Network Design Problem with Variable Route Set Size: This is an alternate title.

18-00525

English

15p

2018

Transportation Research Board 97th Annual Meeting

Digital/other

Figures; References; Tables

Genetic algorithms; Heuristic methods; Networks; Public transit; Routes

Pareto optimum; Transit network design

Planning and Forecasting; Public Transportation

Transportation Research Board Annual Meeting 2018 Paper #18-00525

TRIS, TRB, ATRI

Jan 8 2018 10:08AM