01558342

Component

https://doi.org/10.3141/2498-01

Although capacity constraints in traffic assignment can represent many realistic features, these constraints are largely ignored in practice because of mathematical complexities in applying the methods proposed in the literature. In this study such complexities are relaxed by the adoption of an intuitive interpretation for the Lagrange values of the capacity constraints, that is, the amount of penalty added to the travel time of the oversaturated links to discharge the excessive flow to the extent to which they become saturated. This penalty term bears some similarity to the marginal cost of the system optimal. Hence the capacitated traffic assignment problem (TAP) becomes a normal uncapacitated TAP in which the aforementioned additional penalty is updated iteratively. The proposed provision is flexible to accommodate TAP’s solution algorithms such as Frank–Wolfe. The main motivation of this study is to address the needs of the industry; hence, the proposed method is coded in a leading commercial transport planning software product, and a large-scale network of Winnipeg, Manitoba, Canada, is used for numerical evaluations. Furthermore the benchmark network of Hearn is also used for comparative evaluations with respect to other methods. Results suggest that in regard to the reliability of the outcomes and computational efficacy, the proposed algorithm is as good as other methods. Unlike other methods, there is no additional parameter to be calibrated, and the convergence behavior of the algorithm is promising.

01575261

15-4587

English

pp 1–11

2015

Transportation Research Record: Journal of the Transportation Research Board

9780309295758

Print

Figures (5) ; References (41) ; Tables (1)

Algorithms; Capacity restraint; Heuristic methods; Networks; Traffic assignment

Winnipeg (Canada)

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

TRIS, TRB, ATRI

Dec 30 2014 1:31PM

• Dynamic Assignment-Simulation Methodology for Multimodal Urban Transit Networks
• Flow-Based and Density-Based Time-Dependent Demand Estimation for Congested Urban Transportation Networks
• Implications of Volatility in Day-to-Day Travel Flow and Road Capacity on Traffic Network Design Projects
• Integrated Frequency Allocation and User Assignment in Multimodal Transit Networks: Methodology and Application to Large-Scale Urban Systems
• Investigation of Centroid Connector Placement for Advanced Traffic Assignment Models with Added Network Detail
• Linear Dependence of User Equilibrium Routes in the Transportation Network
• Network Route Choice Model for Battery Electric Vehicle Drivers with Different Risk Attitudes
• Optimal Parking Pricing in Many-to-One Park-and-Ride Network with Parking Space Constraints
• Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance
• Parking Reservation for Managing Downtown Curbside Parking
• Using Lagrangian Relaxation to Solve Ready Mixed Concrete Dispatching Problems