Matching supply and demand in large networks with focus on railways - - PowerPoint PPT Presentation

1

• Dr. Andreas Oetting

09.10.2004

3rd International Conference on Applied Infrastructure Research Berlin, 9th of October 2004

Matching supply and demand in large networks with focus on railways

• Dr. Andreas Oetting

2

• Dr. Andreas Oetting

09.10.2004

lines and nodes model the infrastructure

3

• Dr. Andreas Oetting

09.10.2004

matching supply and demand

• n one network

Planungswelt ProSim

model design long-distance passenger traffic short-distance passenger traffic freight traffic passenger and freight trains scenarios, travel time, characteristics of supply transport demand

4

• Dr. Andreas Oetting

09.10.2004

capacity and waiting times as characteristics of supply

waiting time line 2 sum of waiting time

=

?

line 2

+ +

capacity line 2

=

waiting time line 1 line 1 capacity line 1

+ +

waiting time node node capacity node

5

• Dr. Andreas Oetting

09.10.2004

waiting times

• can be measured
• are perceived by the user
• may be processed together with other characteristics of supply
• have an impact on route choice, transport demand, costs and

benefits

• can be communicated politically
• quantify the quality of supply

waiting times waiting times

scheduled waiting times waiting times during operation

6

• Dr. Andreas Oetting

09.10.2004

calculation of waiting times

example example

time RE network element ICE IC waiting time IC desired departure time waiting time RE an increasing number of trains leads to higher waiting times and a lower level of supply waiting time number

• f trains

minimum headway

7

• Dr. Andreas Oetting

09.10.2004

waiting time and capacity

The calculation of waiting times is a condition for the determination of the capacity waiting times practical capacity desired quality

8

• Dr. Andreas Oetting

09.10.2004

waiting times in nodes input data

• infrastructure

waiting times are produced

• load-dependant in 3 areas
• flows in a node
• load-independant

A B C A C B A C B

(e.g. locomotive change)

A C B

platform zone switching zones

9

• Dr. Andreas Oetting

09.10.2004

modelling infrastructure and network usage input data

• infrastructure and flows
• matrix of flows

to from A B C A C

• conflicts between flows

2 3 4 1 flow interfering flows

A C B A C B A C B

— — — 3 4

B

2 1 — —

2, 3 1, 4 1 2

10

• Dr. Andreas Oetting

09.10.2004

calculation of waiting times for the switching zone waiting time for the switching zone

• input data
• formula for waiting times
• equivalent number of trains
• queuing theory
• number of trains N
• coefficient of variation of the distances

between arriving trains

• minimum headway

( GI / GI / 1 / ∞ ) number of service lines size of holding area arrivals service

z N Z z N t

2 2 Züge w

⋅ − ⋅ =

∑

N t t

Züge w Zug , w

∑

= tw waiting time minimum headway N number of trains Z length of time segment z

V j j

1 ) 1 ( ρ − = ρ −

∏

              ⋅ − − ⋅ = ⇔

∏

j j V

Z z n 1 1 z Z n

ρ

• ccupation of switching zone by flow

n number of trains of a flow j index for interfering flows v index for equivalent interfering flow

11

• Dr. Andreas Oetting

09.10.2004

future new constructions of DB complement the high speed network

Hanau Fulda Würzburg Mannheim Frankfurt

12

• Dr. Andreas Oetting

09.10.2004

the comparison of infrastructure and network utilisation identifies bottlenecks

21< 21 21< 5 < 2 > 22< 22> 68< 73> 6 25< 25> 18< 18> 18< 19> 100< 101> 1 3 1 < 1 4 1 > 42< 44> 1 109> > 100< 101> 18< 18> 102< 97> 63< 63> 98< 101> 33< 30> 81< 84> 113< 103> 181< 174> 15 151> 1 1 3 < 1 1 5 > 8 4 < 7 > 110< 115> 5 6 < 5 4 > 102< 110> 47< 30> 23< 23> 3 8 < 6 2 > 5< 2> 9< 7> 23< 42> 2 4 7 < 9 8 < 3 3 < 3 92< 93 7 3 7 < 2 2 > 69< 116< 162<