Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V....
-
Upload
morris-daniels -
Category
Documents
-
view
212 -
download
0
Transcript of Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V....
![Page 1: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/1.jpg)
Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion
and HyperpathsV. Trozzi 1, G. Gentile2, M. G. H. Bell3 , I. Kaparias4
1 CTS Imperial College London2 DICEA Università La Sapienza Roma3 Sydney University 4 City University London
Imperial College LondonUniversità La Sapienza – RomaSydney UniversityCity University London
![Page 2: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/2.jpg)
Hyperpath : what is this?Strategy on Transit Network
2
d
o
BUS STOP 2
BUS STOP 3
BUS STOP 1
21
2
1
13
34
1
3
3
4
![Page 3: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/3.jpg)
3
d
o
BUS STOP 2
BUS STOP 3
BUS STOP 1
21
2
1
13
34
1
3
3
4
Hyperpaths : why?Rational choice
- Waiting - Variance + Riding + Walking = + Utility
![Page 4: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/4.jpg)
4
d
o
BUS STOP 2
BUS STOP 3
BUS STOP 1
21
2
1
13
34
1
3
3
4
Dynamic Hyperpaths:queues of passengers at stops – capacity constraits
![Page 5: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/5.jpg)
Uncongested Network Assignment Map
ArcPerformance Functions
Dynamic User Equilibrium model : fixed point problem
per destination
dynamic temporal profiles
cost
![Page 6: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/6.jpg)
4. Network representation : supply vs demand
6
![Page 7: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/7.jpg)
4. Arc Performance Functions
7
The APF of each arc aA determines the temporal profile of exit time for any arc, given the entry time .
pedestrian arcs
line arcs
waiting arcs (this is for exp headways)frequency = vehicle flow propagation alng the line
1
aa
t
lenght( )
pedestrian speeedat
( ) line section time from schedule or AVMat
![Page 8: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/8.jpg)
8
Phase 1:Queuing
Phase 2:Waiting
Phase 1:Queuing
Phase 2:(uncongested) Waiting
4. Arc Performance FunctionsBottleneck queue model
![Page 9: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/9.jpg)
9
Available capacity
a’’
b
a’
τ
4. Arc Performance Functionspropagation of available capacity
" ''( ) ( ) ( )outa a be q
dwelling riding
waiting
queuing
1
11
in out
in out
Q t Q
tq t q
''1' " 1
"
( )( )
aa a
a
ee t
t
![Page 10: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/10.jpg)
' ' ' ( )in outa a aQ Q t
4. Arc Performance Functionsbottleneck queue model
' ' ' 'min :out ina a a aQ Q E E
Time varying bottleneck
FIFO
The above Qout is different from that resulting from network propagation: this is not a DNL
they are the same only at the fixed point
![Page 11: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/11.jpg)
'
' ''1at
a a d
4. Arc Performance Functionsnumbur of arrivals to wait before
boarding
While queuing some busses pass at the stop
![Page 12: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/12.jpg)
Hypergraph and Model Graph
12
WAa
QAa
LAa
a
LAa
a QAa
1QAa
t
QAa WAa d
![Page 13: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/13.jpg)
1. Stop model
BUS STOP 1
2123
2
1
Assumption:
Board the first “attractive line” that becomes available.
2
23
1
23
2
1
Sto
p n
od
e 1
Lin
e n
od
es
h = a1 a2 1
a2
a1
a2
a23
h = a2 a23
![Page 14: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/14.jpg)
1. Stop model
| 0
( ) , ( )
0,
aa h
dw a hp
a h
dwwp
t aha
ha
0|
| )()(
1)(
| |( ) ( ) ( )h a h a h
a h
w p t
( ) ( , ) ( , ), a a b
b h
f w F w a h
![Page 15: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/15.jpg)
2. Route Choice Model:Dynamic shortest hyperpath search
15
Waiting + Travel time after boarding
, | , |min a
ii d h a h HD d a h
h FSa h
g w p g t
2
1
h = a1 a2
i
a2
a1
The Dynamic Shortest Hyperpath is solved recursively proceeding backwards from destination
Temporal layers: Chabini approach
For a stop node, the travel time to destination is :
![Page 16: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/16.jpg)
2. Route Choice Model:Dynamic shortest hyperpath search
16
, | , |min a
ii d h a h HD d a h
h FSa h
g w p g t
Erlang pdf for waiting times
1exp
, if 0, 1 !
0, otherwise
a a
a a
a a
w ww
f w
![Page 17: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/17.jpg)
2. Route Choice Model:Dynamic shortest hyperpath search
17
, | , |min a
ii d h a h HD d a h
h FSa h
g w p g t
Erlang pdf for waiting times
1exp
, if 0, 1 !
0, otherwise
a a
a a
a a
w ww
f w
| 0
( ) , ( )
0,
aa h
dw a hp
a h
dwwp
t aha
ha
0|
| )()(
1)(
| |( ) ( ) ( )h a h a h
a h
w p t
![Page 18: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/18.jpg)
3. Network flow propagation model
18
The flow propagates forward across the network, starting from the origin node(s).
When the intermediate node i is reached, the flow proceeds along its forward star proportionally to diversion probabilities:
i
a1 = 60%
a2 = 40%
![Page 19: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/19.jpg)
19
ExampleDynamic ‘forward effects’ on flows an queues
07:30
07:30
Dynamic ‘forward effects’:
produced by what happened upstream in the network at an earlier time, on what happens downstream at a later time
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
Line Route section Frequency (vehicles/min)
In-vehicle travel time (min)
Vehicle capacity (passengers)
2 Stop 1 – Stop 4 1/6 25 501 Stop 1 – Stop 2 1/6 7 501 Stop 2 – Stop 3 1/6 6 503 Stop 2 – Stop 3 1/15 4 503 Stop 3 – Stop 4 1/15 4 504 Stop 3 – Stop 4 1/3 10 25
Line 2 slowLine 4 slow but frequentLine 3 fast but infrequent
Origin Destination Demand (passengers/min)1 4 52 4 73 4 7
![Page 20: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/20.jpg)
20
07:5508:00
ExampleDynamic ‘forward effects’
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
![Page 21: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/21.jpg)
21
7:30
7:40
7:50
8:00
8:10
8:20
8:30
8:40
8:50
9:00
0
2
4
6
8
10
Time of the day
xe QAa
0
1
2
3
4
5
Line 3 Line 4
()
ka
07:5508:00
ExampleDynamic ‘forward effects’
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
![Page 22: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/22.jpg)
22
ExampleDynamic ‘backward effects’ on route choices
Dynamic ‘backward effects’:
produced by what is expected to happen downstream in the network at a later time on what happens upstream at
an earlier time
08:1208:44
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
![Page 23: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/23.jpg)
08:12
23
7:30
7:40
7:50
8:00
8:10
8:20
8:30
8:40
8:50
9:00
0
1
2
3
4
5
Line 3 Line 4
Time of the day
()
ka
ExampleDynamic ‘backward effects’
08:44
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
![Page 24: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/24.jpg)
08:12
24
7:30
7:40
7:50
8:00
8:10
8:20
8:30
8:40
8:50
9:00
0
1
2
3
4
5
Line 3 Line 4
Time of the day
()
ka
ExampleDynamic ‘backward effects’
0
0.2
0.4
0.6
0.8
1
pa*|
h
08:44
07:5308:25
Line 1
Line 1 and Line 3
Line 3 and Line 4
Line 2
1 4
32
![Page 25: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/25.jpg)
25
ExampleDynamic change of line loadings
Line 1
Line 1
Line 4
Line 2
1 4
32
Line 3
Line 3
Line 1
Line 1
Line 4
Line 2
1 4
32Line 3
Line 3
Line 1
Line 1
Line 4
Line 2
1 4
32Line 3
Line 3
Line 1
Line 1
Line 4
Line 2
1 4
32Line 3
Line 3
Line 1
Line 1
Line 4
Line 2
1 4
32Line 3
Line 3
Line 1
Line 1
Line 4
Line 2
1 4
32Line 3
Line 3
07:30
07:45
08:00
08:15
08:30
08:45
<20% capacity
20-39% capacity
40-59% capacity
60-79% capacity
80-100% capacity
![Page 26: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/26.jpg)
- The model demonstrates the effects on route choice when congestion arises
- The approach allows for calculating congestion in a closed form (κ)
- Congestion is considered in the form of passengers FIFO queues
Conclusions:
![Page 27: Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths V. Trozzi 1, G. Gentile 2, M. G. H. Bell 3, I. Kaparias.](https://reader034.fdocuments.in/reader034/viewer/2022051820/56649e605503460f94b5af55/html5/thumbnails/27.jpg)
Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and
Hyperpaths
Thank you for your attention
27
Thank you for your attention!
Q&A