01372919

Component

https://doi.org/10.3141/2283-14

http://scholar.google.com...+Nie&publication_year=2012

This paper aims to investigate how the trade-offs involved in the construction and solution of restrictive master problems for the user equilibrium traffic assignment problem may affect the overall convergence performance of the solution algorithms. Three strategies used to update user equilibrium path sets in path-based algorithms are examined: an origin–destination (O-D)-based strategy that updates the path set for each single O-D pair just before path flows are updated, an origin-based strategy that updates path sets for all O-D pairs associated with the same origin at once, and a simultaneous strategy that updates the path sets for all O-D pairs together. Three recently developed path-based algorithms to update the path sets by using three strategies are implemented for solution of the restrictive master problems. The implementation strategies are tested on medium to large real networks, and their relative performance characteristics are compared. The results show that the construction and update of the restrictive master problems by the different strategies have significant impacts on convergence as well as solution noise. The computational time for convergence under the simultaneous and origin-based strategies is significantly less than that under the O-D-based strategy. In addition, the solution obtained by adoption of the simultaneous strategy exhibits less noise than the other two strategies. These results provide important theoretical and practical insights into solution algorithms for the traffic assignment problem.

01450929

12-3502

English

pp 131–142

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

Figures; References

Origin and destination; Shortest path algorithms; Traffic assignment; Traffic equilibrium

Traffic convergence; User equilibrium

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

TRIS, TRB, ATRI

Feb 8 2012 5:17PM

• Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
• Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices
• Case Study–Based Evaluation of Stochastic Multicommodity Emergency Inventory Management Model
• Demand and Supply Calibration of Dynamic Traffic Assignment Models: Past Efforts and Future Challenges
• Distance-Based Dynamic Pricing Strategy for Managed Toll Lanes
• Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application
• Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
• Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds
• Model for Optimization of Locations of Schools and Student Transportation in Rural Areas
• Model to Locate Sensors for Estimation of Static Origin–Destination Volumes Given Prior Flow Information
• Path-Constrained Traffic Assignment: Model and Algorithm
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks