Trip AssignmentWorked Examples

Example 1- ALL-or-Nothing Case

Algorithm- ALL-or-Nothing Assignment

Equilibrium Assignment (capacity Restraint Assignment)

Two link problem with an O-D pair

Example-2
All or Nothing Assignment

Problem formulation
User Equilibrium

Solution

For Large Networks- Frank-wolfe Algorithm

Initial UE guess: AON based on free-flow times Find link travel times at current UE guess Find Latest AON based on link travel times above New UE guess: Find best to combine old UE guess and latest AON solution through Z function Repeat second step

Example -3
t1(V1)=1+3V1

t2(V2)=2+V2

t3(V3)=3+2V3

O-D Demand constraint V1+V2+V3=10

Solution- FW algorithm
See excel Worksheet A: Initial estimates of travel time B: First AON Solution C: As we dont yet have any other information, the AON solution in B becomes our first equilibrium flow estimate D: The corresponding equilibrium travel time estimates are obtained by substituting the flows C in the travel time functions E: the input travel times to the next step F: The AON solution G: This is the first time we have to do some work to calculate these values the first combination step of the FW algorithm, combination of a mix of C and F
New (V1, V2, V3)= (1-)(10,0,0) + (0,10,0) = (10-10, 10, 0), Put these volumes in Z function, calculate , =0.725 GOTO step D and repeat this until travel times equate each other