STOCHASTIC USER

EQUILIBRIUM
SUBMITTED BY
SUDHA DAS KHAN 11ID60R18
JAYASHREE.A 11ID60R24
TRAFFIC ASSIGNMENT
Traffic assignment, the selection of routes
(alternative called paths) between origins and
destinations in transportation networks.
TRAFFIC ASSIGNMENT MODEL
Traffic assignment model has three submodels:
1. Supply model: simulates variation in network
performance due to user behaviour
2. Demand model: simulates variation in user
behaviour due to network performance
3. Supply-demand interaction model: simulates the
user network interaction


TRAFFIC ASSIGNMENT BASED ON
1. Dynamic approach(within day or day to day)
2. Utility approach(deterministic or stochastic)
3. Service regularity(regular or irregular)
4. User information system(present or not)
5. User type(frequent or occasional)
UTILITY THEORY
The utility to a individual traveler offered by given travel choice alternative
depends on:
speed
safety
cost
travel time
translated into its monetary value of traveler.
The traveler wishes to maximize his/her utility

DETERMINISTIC UTILITY THEORY
o The utility of a traveler is the function of travel choice alternatives.
o It is assumed that the function remains constant for a particular route or
for a particular class of people.
o U
ij
= b
ij
c
ij
t
ij




o It is not possible to predict with certainty the alternative that the generic
decision maker will select
U
ij
utility received from trip made between i and j
b
ij
income of the traveler
c
ij
cost of travel
- parameter which converts time into monetary value
STOCHASTIC UTILITY THEORY
The utility function takes into account the individual strength of preference for
route choice
It is not possible to predict the alternative of the traveler with certainty
Hence it is expressed in terms of probability
The perceived utility U
i
j
, expressed as sum of systematic utility(V
i
j
) and random
residual(
i
j
)
U
i
j
= V
i
j
+

i
j

V
j
i

= E[U
i
j
]


2
i,j
= Var[U
i
j
]
And therefore,
E[U
i
j
] = V
j
i

Var[V
j
i
] = 0
E[
i
j
] = 0

Var[
i
j
] =
2
i,j

The probability is given by,
P
i
[j/I
i
] = Pr[V
i
j
+

i
j
> V
i
k
+

i
k
] = Pr[V
i
j
- V
i
k
>
i
k
-
i
j
]


TRAFFIC ASSIGNMENT BASED ON UTILITY
APPROACH
DETERMINISTIC
APPROACH
STOCHASTIC
APPROACH
It does not take into account the
overlapping of the path
Simple structure and ease of use
It takes into account the
overlapping at the cost of path
enumeration
The drawbacks of modified logit
model and taken care
Requires Monte Carlo Simulation or
of complete path enumeration and
numerical integration of the
multivariate Normal distribution

All or nothing
assignment

Method of
Successive Average
Modified Algorithm
Capacity Restraint
Assignment
Incremental
Assignment
Logit Model
Modified Logit
Model
Probit Model
STOCHASTIC
APPROACH
Logit Model
Modified Logit
Model
Probit Model
STOCHASTIC USER EQUILIBRIUM
(LOGIT MODEL)
WHICH PATH IS CHEAPEST;
SHORTEST; LESS
CONGESTED..
STOCHASTIC
LOADING METHOD
CAPACITY
RESTRAINT
The proportion of traffic between O-D pair(r,s) choosing
to use route k which has a mean cost of C
rs
k
is given by,


the cost term are independent Gumbel variate
is the spread parameter
The model has Markovian nature, then


B(j) set of before nodes for node j and c
ij
is cost
of link


exp( )
exp( )
k
k
rs
j
rs
rs
j
C
P
C
u
u

( )
exp( )
rj ri ij
i B j
j
W W C
u
e
=

Stochastic Loading Method

Flow on link(i,j) from origin r is given by

X
rj
outflow of traffic with origin r to node j
Satisfaction function, the mean perceived cost of
travel between O-D pairs(r,s)



exp( ) /
rj
ij
rj
W
ij
X X
C
u =
1 1
log( ) log exp( )
k
rs
rs rs
k
S
W C
u
u u
| |
= =
|
\ .

CAPACITY RESTRAINT
Here capacity restraint in the form of link-cost flow
function
The link flow at iteration n+1 is
x
n+1
=x
n
+
n
[y
(n)
-x
(n)
]

n
- step length (1/n+1) (Method of successive average)
y
(n)
all or nothing assignment solution

STOCHASTIC USER EQUILIBRIUM ALGORITHM
Step 1: Set up an initial flow pattern x
ij
, typically by carrying out a
stochastic loading based on free flow link costs
Step 2:
Compute new link costs c
(n)
based on the current flow
pattern x
(n)
Carry out a stochastic loading using these link costs,
producing an auxiliary flow pattern y
(n)
Using the output values of S
rs

and the vector of partial
derivatives z/ x
a
, compute z
0
and g
0

0
( ) ( ) ( ) ( )
a
x
a a a a rs rs
a a rs
z x C x dx x c x q S x = +

}
( ) ( )
( ) ( )
( ) ( )
n n a a
a a a a
a
dz x dc x
g x y y x
d dx

= =
Step 3: Compute link cost based on auxiliary solution and
use these to determine z
1
and g
1
Step 4: using z0, z1 and g0, g1, estimate the optimal step
length
n
,
n
= -g
0
/(-g
0
+g
1
)

update the current solution,
x
n+1
=x
n
+
n
[y
(n)
-x
(n)
]
Step 5: at stochastic user equilibrium the auxiliary and
current flow pattern are the same
CONCLUSION
The most widely used algorithm is Method of
Successive Average
Inspite of its drawbacks, the logit method is widely
used
Many algorithm are also developed to take care of
the drawbacks in logit model
REFERENCE
ALGORITHMS FOR LOGIT-BASED STOCHASTIC USER
EQUILIBRIUM ASSIGNMENT MIKE MAHER - Department of
Civil and Transportation Engineering, Napier University,
Edinburgh EH10 5DT, U.K.
Transportation System Analysis: Models and Application by
Eennio Cascetta
Transportation System Engineering: theory and method by
Eennio Cascetta

EXAMPLE:
Network consisting of three parallel links between a
single O-D pair. The link cost flow relations are:
c
1
=3+x
1
c
2
=2+2x
2
c
3
=2.5+1.5x
3

and the demand is one.

n z(x) x
1
(n)
x
2
(n)
x
3
(n)

0 -1.6055308 0.1863237 0.5064804 0.3071959
1 -1.6267193 0.2514581 0.4058328 0.3427091
2 -1.6268206 0.2588580 0.4062035 0.3349384
3 -1.6268212 0.2591917 0.4056907 0.3351176
4 -1.6268212 0.2592326 0.4056927 0.3350746
5 -1.6268212 0.2592345 0.4056899 0.3350756
6 -1.6268212 0.2592347 0.4056899 0.3350754