scholarly journals Morning commute with competing modes and distributed demand: User equilibrium, system optimum, and pricing

2012 ◽  
Vol 46 (10) ◽  
pp. 1519-1534 ◽  
Author(s):  
Eric J. Gonzales ◽  
Carlos F. Daganzo
Keyword(s):  
User Equilibrium ◽  
Equilibrium System ◽  
System Optimum ◽  
Morning Commute

A THEORY OF MULTIPLE VEHICLE TYPE DYNAMIC MARGINAL COST CONSIDERING DEPARTURE TIME CHOICES

Transport ◽  
2010 ◽  
Vol 25 (3) ◽  
pp. 307-313
Author(s):  
Shu-Guang Li ◽  
Qing-Hua Zhou
Keyword(s):  
Marginal Cost ◽  
User Equilibrium ◽  
System Optimum ◽  
Equilibrium Conditions ◽  
Traffic Demand ◽  
Vehicle Type ◽  
Departure Time ◽  
Single Vehicle ◽  
Link Model ◽  
Analytic Expression

The analysis of single vehicle type dynamic marginal cost is extended to multiple vehicle type dynamic one based on time‐dependent multiple vehicle type queue analysis at a bottleneck. First, a dynamic link model to rep‐ resent the interactions between cars and trucks is provided. Then, the analytic expression of a multiple vehicle type dynamic marginal cost function considering departure time choices is deduced under congested and un‐congested conditions and consequently, a dynamic toll function is given. A heuristic algorithm is introduced to solve multiple vehicle type dynamic queues and toll under system optimum and user equilibrium conditions taking into account traveler's departure time. A numerical example shows that a dynamic congestion toll can diminish queues and improve system conditions when traffic demand is not changed.

Modeling of Dynamic Game-Based Route Guidance System

2011 ◽  
Vol 130-134 ◽  
pp. 1867-1871
Author(s):  
Yun Wei ◽  
Qing Shao ◽  
Yin Han
Keyword(s):  
Game Theory ◽  
Flow System ◽  
Dynamic Game ◽  
User Equilibrium ◽  
Theory Model ◽  
Guidance System ◽  
Route Guidance ◽  
System Optimum ◽  
Simulation Results ◽  
Guidance Information

Route guidance process is the dynamic game-based process of traffic authority and users, users’ behavior is affected by the guidance information and it also affect guidance effect. On the basis of analysis of user equilibrium and system optimum, a game theory model between traffic authority and users is presented, and system optimum and user optimum guidance strategy are given. Simulation results show that: user optimum guidance strategy will bring oscillation of traffic flow, system optimum guidance strategy is optimal but difficult to achieve, and coordination of system optimum and user optimum is close to system optimum strategy.

scholarly journals Bounding the Inefficiency of the Multiclass, Multicriteria C-Logit Stochastic User Equilibrium in a Transportation Network

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Lekai Yuan ◽  
Xi Zhang ◽  
Chaofeng Shi
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Stochastic System ◽  
Traffic Congestion ◽  
Transportation Network ◽  
User Equilibrium ◽  
Upper Bounds ◽  
Choice Probability ◽  
Stochastic User Equilibrium ◽  
System Optimum

We derive the exact inefficiency upper bounds of the multiclass C-Logit stochastic user equilibrium (CL-SUE) in a transportation network. All travelers are classified on the basis of different values of time (VOT) into M classes. The multiclass CL-SUE model gives a more realistic path choice probability in comparison with the logit-based stochastic user equilibrium model by considering the overlapping effects between paths. To find efficiency loss upper bounds of the multiclass CL-SUE, two equivalent variational inequalities for the multiclass CL-SUE model, i.e., time-based variational inequality (VI) and monetary-based VI, are formulated. We give four different methods to define the inefficiency of the multiclass CL-SUE, i.e., to compare multiclass CL-SUE with multiclass system optimum, or to compare multiclass CL-SUE with multiclass C-Logit stochastic system optimum (CL-SSO), under the time-based criterion and the monetary-based criterion, respectively. We further investigate the effects of various parameters which include the degree of path overlapping (the commonality factor), the network complexity, degree of traffic congestion, the VOT of user classes, the network familiarity, and the total demand on the inefficiency bounds.

scholarly journals A Based-Bottleneck Multiple Vehicle Type Dynamic Marginal Cost Model and Algorithm

1970 ◽  
Vol 24 (5) ◽  
pp. 381-387
Author(s):  
Shuguang Li
Keyword(s):  
Marginal Cost ◽  
Cost Model ◽  
User Equilibrium ◽  
System Optimum ◽  
Equilibrium Conditions ◽  
Vehicle Type ◽  
Flow Speeds ◽  
Single Vehicle ◽  
Link Model ◽  
Analytic Expression

Single vehicle type dynamic marginal cost model is extended to multiple vehicle type dynamic one based on time-dependent multiple vehicle type queue analysis at a bottleneck. A dynamic link model is presented to model interactions between cars and trucks, given the link consists of two distinct segments. The first segment is the running segment on which cars (trucks) run at their free-flow speeds and the second segment is the exit queue segment. A car or a truck is assumed to be a point without length. The class-specific pi parameter is used to transform the effect of truck into passenger car equivalents, so the exit flow of cars and trucks can be calculated according to the exit capacity of a bottleneck. The analytic expression of multiple vehicle type dynamic marginal cost function is deduced under congested and uncongested conditions. Then a heuristic algorithm is presented in solving multiple vehicle type dynamic queues, tolls under system optimum and user equilibrium conditions. The numerical example illustrates the simplicity and applicability of the proposed approach.

scholarly journals A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Wen-Xiang Wu ◽  
Hai-Jun Huang
Keyword(s):  
User Equilibrium ◽  
Gradient Projection ◽  
Projection Algorithm ◽  
Value Of Time ◽  
Large Network ◽  
System Optimum ◽  
Gradient Projection Algorithm ◽  
Optimum Model ◽  
Viable Approach ◽  
The Cost

The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document