01089272

Component

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

http://scholar.google.com...+Fan&publication_year=2008

Regional transportation can be regarded as a complex system consisting of many subsystems. If it is assumed that the decisions of others are known, one of the subsystems, such as a manufacturer, will make decisions from the viewpoint of individual optimal. But among these subsystems, there are noncooperative interactions. The first Wardrop principle can be used to explain the interplay between the subsystems and the second Wardrop principle to explain the internal decision making of one subsystem. To capture the feature of hierarchical behavior, classical Wardrop principles need to be generalized. The new behavior principle is named the generalized Wardrop principle. With the substitution of actual path sets for the simple links in a spatial price equilibrium network and constructing the generalized transportation cost functions, the regional transportation network equilibrium model is formulated. The new model combines the spatial price equilibrium model with the network optimization model. It can be explained by the generalized Wardrop principle and reflects the multicommodity, multimodal characteristics of regional transportation. The modified projection algorithm is used to solve the model. One numerical example is given to show the efficiency of the algorithm.

01120896

English

pp 49-56

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309125963

Print

Figures (2) ; References (33) ; Tables (5)

Algorithms; Decision making; Equilibrium (Systems); Freight traffic; Network analysis (Planning); Regional transportation; Supply chain management; Systems analysis

Generalized Wardrop principle

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

TRIS, TRB, ATRI

Jan 29 2008 2:34PM

• Adaptive Route Choice Models in Stochastic Time-Dependent Networks
• Dynamic Network Loading Model with Explicit Traffic Wave Tracking
• Dynamic Origin–Destination Demand Estimation Using Turning Movement Counts
• Effectiveness of Origin–Destination Matrix Correction Procedure Using Traffic Counts
• Enhanced Lagged Cell-Transmission Model for Dynamic Traffic Assignment
• Incorporating Within-Day Transitions in Simultaneous Offline Estimation of Dynamic Origin–Destination Flows Without Assignment Matrices
• Lower-Bound Solution Algorithm for Equilibrium Signal-Setting Problem
• Measurement of Uncertainty Costs with Dynamic Traffic Simulations
• Modeling User Responses to Pricing: Simultaneous Route and Departure Time Network Equilibrium with Heterogeneous Users
• Probit-Based Time-Dependent Stochastic User Equilibrium Traffic Assignment Model
• Robust Pricing of Transportation Networks Under Uncertain Demand
• Simultaneous Perturbation Stochastic Approximation Algorithm for Solving Stochastic Problems of Transportation Network Analysis: Performance Evaluation
• Stochastic Multiclass Traffic Assignment with Consideration of Risk-Taking Behaviors
• Stochastic User Equilibrium Model with Implicit Travel Time Budget Constraint