Terminal Design Passenger Processing. errata  Consider TSA impacts.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Airport Procedures 101. #1 Arrive to the airport Many people take a taxi or get a friend to drop them off to avoid having to pay to park at the airport.
PEDESTRIANS Osama Tabash Khaled El-Yazory Dr. Essam Almasri
Capacity, Level of Service, Intersection Design (1)
Chapter 15: Weaving, Merging, and Diverging Movements on Freeways and Multilane Highways Chapter objectives: By the end of this chapter the student will.
Terminal Design. Some thoughts from Mark Day (LEX)… Expansions are greatly limited based on the initial configuration. Similar comments to planning must.
Airport Systems Planning & Design / RdN Defining Capacity of Airport Passenger Buildings Dr. Richard de Neufville Professor of Engineering Systems and.
Best Practices in Airport Ground Transportation—Accent on the Positive Two Curbside Allocation Case Studies Presented to Airport Ground Transportation.
Transportation Engineering
INTRODUCTION TO TRANSPORT Lecture 3 Introduction to Transport Lecture 4: Traffic Signal.
Vehicle Flow.
1 Design of Evacuation System for High-Rise Building Danqing Yu.
Queuing Models Basic Concepts. QUEUING MODELS Queuing is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open.
Progressive Signal Systems. Coordinated Systems Two or more intersections Signals have a fixed time relationship to one another Progression can be achieved.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Queuing CEE 320 Anne Goodchild.
Queuing and Transportation
CEE 320 Fall 2008 Queuing CEE 320 Anne Goodchild.
Lec13, Ch.6, pp : Gap acceptance and Queuing Theory (Objectives)
Lec 15, Ch.8, pp : Signal Timing (Objective)
CEE 320 Spring 2007 Queuing CEE 320 Steve Muench.
Lec 5: Capacity and LOS (Ch. 2, p.74-88)
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.
Signalized Intersections
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Materials developed by K. Watkins, J. LaMondia and C. Brakewood Stop/ Station Design & Access Unit 6: Station Design & Access.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Asst. Prof. Dr. Mongkut Piantanakulchai
Introduction to Operations Research
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Kelowna International Airport 2010 Development Program September 17, 2007.
18 Management of Waiting Lines.
Queuing Theory. Introduction Queuing is the study of waiting lines, or queues. The objective of queuing analysis is to design systems that enable organizations.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Introduction to Transport
Chapter 13: Weaving, Merging, and Diverging Movements on Freeways and Multilane Highways Chapter objectives: By the end of these chapters the student will.
Traffic Flow Fundamentals
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
1 Computer Networks & The Internet Lecture 4 Imran Ahmed University of Management & Technology.
TRB Session January 23, 2007 Transportation Research Board Session Lessons Learned from Large Airport Development “Orlando Airport Experience”
Vehicle Flow. Homework Ch 3 # 1,4, 7, 15 Vehicle Flow How do vehicles operate in the system –capacity –speed –headway –density.
Route and Network Planning
CS 3830 Day 4 Introduction 1-1. Announcements  No office hour 12pm-1pm today only  Quiz on Friday  Program 1 due on Friday (put in DropBox on S drive)
Seat belt law New Jersey seat belt laws require the following people to always be in seat belts while driving in a vehicle. 1 The motorist (driver) 2 All.
Airport Systems Planning & Design / RdN Design of Components of Airport Passenger Buildings Dr. Richard de Neufville Professor of Engineering Systems and.
Components of AP Pax Bldgs Slide 1 of 27 / RdN © Design of Components of Airport Passenger Buildings Richard de Neufville Professor of Engineering Systems.
Hcm 2010: BASIC CONCEPTS praveen edara, ph.d., p.e., PTOE
1 CEE 8207 Summer 2013 L#6 Queue. 2 Queueing System Provide a mean to estimate important measures of Highway Performance  Travel time  Speed Affects.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
COCHIN INTERNATIONAL AIRPORT LIMITED 1. CIAL-A PATHBREAKER Cochin International airport, the country’s first Greenfield airport built under public private.
Chapter 9 Capacity and Level of Service for Highway Segments
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Traffic Flow Characteristics. Dr. Attaullah Shah
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
MODULE 4, LESSON 5 Developing Service: Calculating Capacity.
Vacation begins when you land! JUNE one of two Orlando Sanford (SFB) is one of two international airport’s in the Greater Orlando area Source:
Models of Traffic Flow 1.
When I travel, my mother always drop me off at the airport
Transportation Research Board
Defining Capacity of Airport Passenger Buildings
Delays Deterministic Stochastic Assumes “error free” type case
Design of Components of Airport Passenger Buildings
Queuing Analysis Two analytical techniques can be employed to study queuing processes: Shock wave analysis Demand-capacity process is deterministic Suited.
Terminal Design Passenger Processing
Delays Deterministic Stochastic Assumes “error free” type case
Queuing Theory III.
Presentation transcript:

Terminal Design Passenger Processing

errata  Consider TSA impacts

Passenger Space Guidelines (1/2)  Personal space Transit 18x24 inches Airports 5-10 ft 2 (30 inch circle)  Lateral movement 30 inches between “traffic” lanes  Longitudinal movement 8-10 feet per person  Net pedestrian area ft 2

Passenger Space Guidelines (2/2)  Queuing space 5-10 ft 2  Stairs ft 2 Escalators can be smaller  Pedestrian flow f = s/a Where f pedestrian flow, s speed, a area per pedestrian (note analog to vehicular traffic flow density relationship: flow = density * velocity)

Passenger System (1/5)  Entryways Passenger and visitors Enplaning and deplaning Auto doors20-30 pax/min Manual doors10-15 pax/min  Lobby areas All persons using airport Seating capacity 15-25% of enplaning Space 20 sf/pax

Passenger System (2/5)  Ticket counter Check in and baggage drop Estimate 10% of peak hour originating pax with 5 pax in line max Spacing: ft. between counters without bags ft. between counters for regular Queue space 3 ft./pax = 15 ft. Provide ft. circulation area behind queues 10 ft. of depth for the counter itself

Passenger System (3/5)  Security Service rate pax/hr (lower than book says) ft wide; ft long Deplaning exit corridor ft wide, revolving door or guards 20-40’10’-20’ 15-20’

Passenger System (4/5)  Departure lounge Estimate 80% of pax need seating Space ft 2 /pax Walking corridors should be provided  Boarding corridors 10 ft. wide Service rate 2-4 pax/min

Passenger System (4/5)  Corridors 20 ft wide minimum ft desirable for maneuvering  Stairs 30 inches minimum per lane Speed ft/min; average 100 ft/min  Baggage claim Special procedures

Queuing Equations (1/4)  Arrivals Poisson rate q  Service Exponential rate Q  Ratio ρ= q/Q < 1.0  More than one server (n) Ratio ρ = q/(Qn)

Queuing Equations (2/4)  M/M/1 Wait time in queue: E(w) = q/[Q(Q-q)] Average time in system: E(t) = 1/(Q-q) Average queue length: E(m) = q 2 /[Q(Q-q)] Probability of k “units” in system: P(k)= (q/Q) k [1-(q/Q)]  Used for flow through processes Entrance gates Security Jetways

Queuing Equations (2/4)  M/D/1 Wait time in queue: E(w) = q/[2Q(Q-q)] Average time in system: E(t) = [2Q- q]/[2Q(Q-q)] Average time in service: E(t s ) = 1/Q Average queue length: E(m) = q 2 /[2Q(Q-q)]  For multiple servers (n), approximate Q as nQ Be careful – service time is not affected by n Check equations above!  Used for processes with fixed service Ticket services Car rental

Queuing Equations (3/4)  If ρ= q/Q > 1.0 Wait time in queue: E(w’) = E(w) 0.9 +E(e) where E(w) 0.9 is the E(w) when ρ =0.9 and E(e)=T(q-nQ)/(2nQ) where T is the time that demand exceeds service n=number of servers Average queue length: E(m’) = [E(w’)+1/Q)]q  Baggage claims Average delay E(b) = E(t 2 ) +NT/(N+1) –E(t 1 ) Where  t 2 = time when 1 st bag shows up  t 1 = time when passengers arrive  N = number of bags per person  T = between first and last bags

Queuing Equations (4/4)  Total passenger processing time E(T) = E(w) + E(s) + E(t) where E(w) average wait in queue time E(s) average service time E(t) average walk time

Passenger Flow - Enplaning DA1A1 A2A2 ETTXXSS L L JJ

Enplaning Flow Example DETXSS L J Device Service time Doors 10 sec Express 90 sec Ticket 180 sec Security (X) 30 sec Seat Select 25 sec Jetway 20 sec n Servers Pax/hr/n pax/hr Pax/hr

Enplaning Flow Example Device q Q Wait (min) Service (sec) Gate Express Ticket Security Seat Select Jetway Use the average wait in queue time equations to get wait. Remember to use the right queuing equation for the right device.

Enplaning Flow Example AT O Concession Stands

Enplaning Flow Example AT O Concession Stands Walk dist (ft)

Enplaning Flow Example X

Enplaning Flow Example Wait time E(w)=1(0.19)+0.45(1.88)+0.20(1.25)+1(0.50)+0.60(0.06)+1(0.19) = 2.01 min Service time E(s)=1(10)+0.45(90)+0.20(180)+1(30)+0.60(25)+1(10)= s. = 2.52 min Walk time E(t)= [0.45[( )/2]+0.20[( )/2]+ 0.35[0.75(185)+0.25(300)]+1(760)]/2.5 = 408 s. = 6.8 min Total time E(T)= = min

Passenger Flow Deplaning DBECRJS

Deplaning Flow Example (1/8) DBECRJS 500 pax/hr 1.5 bags/pax 1 visit/pax Device Service time Doors 10 sec Escalator 5 sec Security exit 3 sec Car rental 240 sec Jetway 10 sec

Deplaning Flow Example (2/8) Device Service time Doors 10 sec Escalator 5 sec Security exit 3 sec Car rental 240 sec Jetway 10 sec Servers Pax/hr DBECRJS Bags: 1.5 bags/pax = 309 bags, 2 servers

Deplaning Flow Example (3/8) Device q Q Wait (min) Service (min) Doors Escalator Security exit Car rental Jetway

Enplaning Flow Example (4/8) Car Rentals Incoming Bags

Deplaning Flow Example (5/8) Car Rentals Incoming Bags

Deplaning Flow Example (6/8) X

Deplaning Flow Example (7/8) For bags E(w)= (1.86) = 0.53 min E(s)= (240)=0.54 min E(t)= [ (415)+0.06(405)]/2.5=7.13 min Avg arrival time= =8.20 Bags/device 309/2 = 155 bags Load time 155/10 = 15.5 min E( b ) = E(t 2 )+nT/(n+1)–E(t 1 )=10+[1.5(15.5)/2.5]-8.20= min

Deplaning Flow Example (8/8) Wait time E(w)=1( )+0.41(11.1)+0.39(1.86)+0.05 = 5.74 min Service time E(s)=1(10+5+3)+0.39(240)+1(10)= 2.03 min Walk time E(t)= [1(900)+0.40[( )/2]+0.21( )+ 0.14( )+0.19(315)+0.06( )]/2.5 = 9.41 min Total time E(T)= = min

Terminal Footprint

Airport Roadway Circulation Deplaning Enplaning Terminal Frontage Road Terminal Access Road Terminal Exit Road Short Term Parking Long Term Parking

Gate Configuration  Large airlines have their own  Smaller typically combine/share  May need to have “airline” terminals  Wide bodies occupy outside gates