01373004

Component

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

http://scholar.google.com...ller&publication_year=2012

This paper presents a mathematical programming model and solution method for the path-constrained traffic assignment problem, in which route choices simultaneously follow the Wardropian equilibrium principle and yield the distance constraint imposed on the path. This problem is motivated by the need for modeling distance-restrained electric vehicles in congested networks, but the resulting model and solution method can be applied to various conditions with similar path-based constraints. The equilibrium conditions of the problem reveal that any path cost in the network is the sum of corresponding link costs and a path-specific out-of-range penalty term. The suggested method, based on the classic Frank–Wolfe algorithm, incorporates an efficient constrained shortest-path algorithm as its subroutine. This algorithm fully exploits the underlying network structure of the problem and is relatively easy to implement. Numerical results from the examples of problems provided show how the equilibrium conditions are reshaped by the path constraint and how the traffic flow patterns are affected by different constraint tightness levels.

01450929

12-3755

English

pp 25–33

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

Figures; References; Tables

Electric vehicles; Programming (Mathematics); Shortest path algorithms; Traffic assignment; Traffic equilibrium; Traffic flow

Frank-Wolfe algorithm; Wardrop model

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

TRIS, TRB, ATRI

Feb 8 2012 5:19PM

• 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
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem: Computational Study
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks