Beruflich Dokumente
Kultur Dokumente
225J
1.225J (ESD 205) Transportation Flow Systems
Lecture 2
Lecture 2 Outline
Background
Factors that ‘Determine’ a Runway Capacity
Minimum Time Separation between Two Arriving Aircrafts
Arrival Capacity Model for One Runway
Example
Practical Issues and Model Analysis
Other Models
Summary
1
Background
Two main types of air transportation infrastructure:
y Airports
y Air Traffic Control (ATC)
Airport services and facilities:
y Airside or Airfield (runways, taxiways, hangers)
y Landside (terminals, parking areas, access roads)
Models deal with issues related to:
y Passenger terminals
y Runway and taxiway systems
y ATC
Types of models:
y Analytical (i.e., the model of this lecture)
y Simulation (will be covered in a later lecture)
Background
Two main types of air transportation infrastructure:
y Airports
y Air Traffic Control (ATC)
Airport services and facilities:
y Airside or Airfield (runways, taxiways, hangers)
y Landside (terminals, parking areas, access roads)
Models deal with issues related to:
y Passenger terminals
y Runway and taxiway systems
y ATC
Types of models:
y Analytical (i.e., the model of this lecture)
y Simulation (will be covered in a later lecture)
2
Arrival runway capacity is (partially) determined by:
Aircraft Population:
y Types: Heavy, Large/Medium, Small
y Mix: Percentage of each type
Idealized representation:
Holding Area
Notation:
y n: length of final approach path
y i (j): type of leading (trailing) aircraft
y vi: ground speed of type i aircraft
y oi: runway occupancy time of type i aircraft
y sij: minimum separation between two airborne aircraft
y Tij: minimum acceptable time interval between successive arrivals
at the runway of type i and type j aircrafts (unknown)
1.225, 10/31/02 Lecture 2, Page 6
3
Minimum Time Separation of Two Aircrafts
Tij > oi
Answer:
n + sij n
max − , oi for vi > v j (‘opening case’)
v j vi
Tij =
sij
max v , oi for vi ≤ v j (‘closing case’)
j
1.225, 10/31/02 Lecture 2, Page 7
vi vj vi
n vj n
time t1 t2 time
approach t1 t2 sij
gate
sij + n
vj
4
Minimum Acceptable Interarrival Time
n + sij n
max − , oi for vi > v j (‘opening case’)
v j vi
Tij =
sij
max , oi for vi ≤ v j (‘closing case’)
v j
Example
Example
y Parameters (given) y [sij] matrix (given)
i pi vi oi Trailing aircraft
(a/c type) (prob.) (knots) (secs) Leading aircraft 1(H) 2(L) 3(M) 4(S)
1(H) 0 .2 150 70 1(H) 4 5 5 6
2(L) 2 . 5 2 .5 2 .5 4
0 .35 130 60 S= 2(L)
3(M) 0 .35 110 55 3(M) 2.5 2.5 2.5 4
4(S)
0 .1 90 50 4(S) 2.5 2.5 2.5 2.5
5
Arrival Runway Capacity: Example
1
Maximum flow rate (frequency of arrivals): = 33.9 arrivals/hour
E[Tij ]
It is called maximum theoretical capacity.
1
In practice, is called the ‘saturation capacity’ or ‘maximum
E[Tij′ ]
throughput’.
1 1
Typically, b = 10 sec = = 30.9 aircrafts/hour
E[Tij′ ] 116.3
6
Analysis of the Analytical Model
7
Lecture 2 Summary
Background
Factors that ‘Determine’ a Runway Capacity
Minimum Time Separation between Two Arriving Aircrafts
Arrival Capacity Model for One Runway
Example
Practical Issues and Model Analysis
Other Models