01334290

Component

https://doi.org/10.3141/2263-02

http://scholar.google.com...hang&publication_year=2011

“Individual path marginal cost” (IPMC) is defined as the change in travel cost of one unit of flow on a time-dependent path caused by one unit of flow on another time-dependent path. Knowledge of IPMC is central to dynamic transportation modeling, for instance, to compute system-optimal network performance, to solve a dynamic origin–destination (O-D) estimation problem, and to analyze equity issues for travelers with different origins and destinations. This paper proposes a method of approximating IPMC for general networks, in which a cell transmission model–based kinematic wave model is used to model traffic dynamics. By tracing the changes in the cumulative flow curves of the bottleneck links on which queues form during dynamic network loading, an approximation method is developed to obtain the IPMC for the cases of merge junctions, diverge junctions, and general junctions. This method was applied to compute the total path marginal cost in a network. The results showed that vehicles at the beginning of the congestion duration had significantly larger marginal travel costs than other vehicles. The method was then applied to solve a dynamic O-D estimation problem with partial link-flow counts and historical O-D trip tables. With the incorporation of IPMC into the estimation procedure, both the O-D demands and the observed path travel times were successfully reproduced.

01365004

11-2094

English

pp 9-18

2011

Transportation Research Record: Journal of the Transportation Research Board

9780309223034

Print

Figures (6) ; References (16) ; Tables (1)

Bottlenecks; Marginal costs; Networks; Origin and destination; Traffic congestion; Traffic models; Traffic queuing; Travel demand; Travel time

Cell transmission model; Spillback effects (Traffic)

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

TRIS, TRB

Feb 17 2011 6:03PM

• Adaptive Traffic Control for Large-Scale Dynamic Traffic Assignment Applications
• Application of Discrete Fourier Transform to Find Reliable Shortest Paths
• Bi-Level Optimization Model for Public Transportation Network Redesign Problem: Accounting for Equity Issues
• Capacitated-Vehicle Routing Problem with Backhauls on Trees: Model, Properties, Formulation, and Algorithm
• Centralized Time-Dependent Multiple-Carrier Collaboration Problem for Less-Than-Truckload Carriers
• Comparison of Multiobjective Evolutionary Algorithms for Optimization of Externalities by Using Dynamic Traffic Management Measures
• Day-to-Day Dynamic Model in Discrete–Continuum Transportation Networks
• Disaggregate Multimodal Travel Demand Modeling Based on Road Pricing and Access to Transit
• Distribution and Assignment of Compulsory and Discretionary Traffic
• Efficient Methodology for Benchmarking Dynamic Origin–Destination Demand Estimation Methods
• Many-to-Many Game-Theoretic Approach for the Measurement of Transportation Network Vulnerability
• Methodology for Locating Link Count Sensors That Accounts for Reliability of Prior Estimates from Origin–Destination Matrices
• Model of Traffic Flow Capacity Constraint Through Nodes for Dynamic Network Loading with Queue Spillback
• New Gradient Approximation Method for Dynamic Origin–Destination Matrix Estimation on Congested Networks
• Select Zone Analysis for Traffic Impact Studies
• Time-Dependent Origin–Destination Demand Estimation: Challenges and Methods for Large-Scale Networks with Multiple Vehicle Classes
• Transit Stop-Level Origin–Destination Estimation Through Use of Transit Schedule and Automated Data Collection System
• Travel Speed Forecasting by Means of Continuous Conditional Random Fields
• Vulnerability Analysis of Transportation Network Under Scenarios of Sea Level Rise