01516669

Component

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

The traffic assignment problem (TAP) is a key element of many urban transport models. Given trip demand in the form of a matrix indexed by origin and destination, the TAP assigns flow to the traffic network to achieve a user equilibrium in which no individual traveler may reduce his or her trip cost by changing route. Many iterative algorithms have been developed to solve the TAP; these algorithms are usually initialized by all-or-nothing (AON) assignments in which all flow is assigned to the shortest paths and congestion is disregarded. A new method of initialization based on the solution of a simplified TAP formed by aggregating origin and destination nodes is developed. This simplified problem can be solved in a fraction of the time needed for the original problem. The user equilibrium of this aggregated problem can then be mapped onto the space of path flows of the original TAP. With a suitable choice of aggregation, the time required for an iterative TAP algorithm to converge can be greatly reduced. Including the time taken for initialization, this method gives convergence in some cases more than twice as fast as AON initialization. Methods for the automatic aggregation of origins and destinations are also proposed. The results show that the performance of path-based TAP algorithms is strongly dependent on the choice of initial solution.

01557688

14-2395

English

pp 52–57

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295581

Print

Figures (6) ; References (21) ; Tables (3)

Cluster analysis; Disaggregate analysis; Network nodes; Origin and destination; Traffic assignment

Computational efficiency; Path based algorithms

Highways; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 27 2014 2:51PM

• 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
• 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
• Transit Route Design Solved with Wireless Data Collection Algorithms
• 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