OPTIMIZATION OF TRANSIT NETWORK TO MINIMIZE TRANSFERS

Abstract

This report presents mathematical methodologies for transit route network optimization. The goal is to provide an effective computational tool for the optimization of a large-scale transit route network. The objectives are to minimize transfers and optimize route directness while maximizing service coverage. The formulation of the method consists of three parts: representation of transit route network solution search spaces, representation of transit route and network constraints, and a search scheme capable of finding the expected global optimal result. The search methods included greedy search, fast hill climbing, and an integrated simulated annealing, tabu and greedy search algorithm. The methodologies have been implemented as a computer program, and have been tested with several benchmark problems. They were also applied to a large-scale realistic network optimization problem in Miami-Dade County, Florida. The test results showed that the methodologies developed in this study were capable of improving a given network solution in terms of average transfers and transit service coverage. A prototype application for transit network optimization has been implemented with TransCAD as the user interface.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 50 citations exist upstream.