01519890

Component

https://doi.org/10.3141/2466-05

The transit route network design problem and its variants, aiming for economically viable and efficient transit routes in urban areas, has been attracting many contributions in recent years and continues to be an active research field. This activity is mainly caused by the intractability of the underlying optimization problems in large-scale transportation networks, generally leading to the use of heuristic schemes to build good practical solutions. A relationship between the transit route network design problem and the problem of data collection in wireless sensor networks is presented, and an innovative solution approach is proposed based on a recently proposed algorithm in that domain. The original solution algorithm is adapted to urban transportation networks and tests are carried out on large-scale data sets on a single-route variant of the transit route network design problem. The results obtained show that the solution approach can be efficiently tuned to meet specific route design objectives and provide balanced solutions.

01557688

14-5169

English

pp 42–51

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295581

Print

Figures (2) ; References (35) ; Tables (2)

Algorithms; Data collection; Design; Networks; Optimization; Routes; Wireless communication systems

Transit network design

Data and Information Technology; Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 27 2014 3:48PM

• Access and Connectivity Trade-Offs in Transit Stop Location
• Capacitated Centralized Carrier Collaboration Multihub Location Problem: Tabu Search Approach
• Capacity Estimation in Support of Mesoscopic Simulation as Part of Dynamic Traffic Assignment Models
• Dual-Route Distribution Strategy with Supply Chain Disruption
• High-Speed Train Network Routing with Column Generation
• Initializing the Traffic Assignment Problem by Zone Aggregation and Disaggregation
• Modeling Corridor and Growth Pole Coevolution in Regional Transportation Network
• Modeling Network Growth with Scaling Laws in a Linear Monocentric City
• Park-and-Ride Network Equilibrium with Heterogeneous Commuters and Parking Space Constraint
• Properties of Dynamic Freeway Network Flexibility Model
• Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks: Case Studies for Stockholm, Sweden, and Singapore
• Simulation Framework for Modeling Large-Scale Flexible Transit Systems
• Subnetwork Analysis for Dynamic Traffic Assignment Models: Strategy for Estimating Demand at Subnetwork Boundaries
• Travel Time Distribution Under Interrupted Flow and Application to Travel Time Reliability
• Two-Step Approach for Correction of Seed Matrix in Dynamic Demand Estimation
• Unified Route Choice Framework: Specification and Application to Urban Traffic Control