Transit Network Optimization: Minimizing Transfers and Maximizing Service Coverage with an Integrated Simulated Annealing and Tabu Search Method
infrastructure - interchange/transfer, ridership - commuting, mode - bus
Transit networks, Transfers, Tabu search, Simulated annealing, Service coverage, Optimization, Optimisation, Miami-Dade County (Florida), Intracity bus transportation, Greedy algorithms, Bus transit
This paper presents a mathematical methodology for transit route network optimization. The goal is to provide an effective computational tool for optimization of a large-scale transit route network. The objectives are to minimize transfers and maximize service coverage. 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 stochastic search scheme capable of finding the expected global optimal result on the basis of an integrated simulated annealing, tabu, and greedy search algorithm. The methodology has been tested with published solutions to benchmark problems and applied to a large-scale realistic network optimization problem in Miami-Dade County, Florida.
Zhao, Fang, Ubaka, Ike, Gan, Albert, (2005). Transit Network Optimization: Minimizing Transfers and Maximizing Service Coverage with an Integrated Simulated Annealing and Tabu Search Method. Transportation Research Record: Journal of the Transportation Research Board, 1923, pp 180-188.