8.1 Space-Time Relationships Trajectory ® Time ® Figure 8.1 Space-time diagram (CES341 Transportation CChapter®: Traffic Analysis Techniques 2 Engineering and Planning 1 Transportation “ific Analysis Techniques 3 cups: Ehgineering and Planning8.1.1 Direct Graphical Solution Fig. 8.2 Location and size of double-track sections ‘Ona Transit system Single track 15 km long >Train 10 min interval dispatched from each end (W-E) i >5 min layovers Neglect stop time at stations > Uniform speed ‘i 45 km/h both * Determine number and location of double-track anesione sections, and the minimum length required for such sections in order for trains running as much as 2 min behind schedule to pass one another without delay CES341 Transporation (Chapter Traffic Analysis Techniques 4 Engineerngand Paning 8.1.1 Direct Graphical Solution Fig. 8.3 Train dispatch problem $30 Double-tracked section 3:00 30 Distance,km > East 1) Determine earliest time the W-bound train can arrive at the W end of the line 2) Determine the latest dispatch time (after 1:00 p.m.) that will allow the W-bound train to reach its destination without unnecessary delay CES3#1 Transportation CChapter8: Traffic Analysis Techniques Engineering and Planning > Rail line 90 km long, +75 km long double-track section located between 60-67.5 km from W end » A train leaves W end at 1:00 p.m. and travel E at constant speed of 45 km/h » The second train leaves from the E end at 1:30 p.m. and may travel at any speed up to 90 km/h8.1.2 Development of Analytical Solutions » Complicated space-time problems e Space-time diagrams are used to derive analytical solutions CES341 Transportation (Chapter8: ‘Traffic Analysis Techniques 6 Engineering and Planning, Example: Runway Capacity Analysis a ny gate ry gate Time Fig, 8.4 Time separation at Fig. 8.5 Time separation at runway threshold, vj $ vj runway threshold, v;2 vj (CES341 Transportation (Chapter Traffic Analysis Techniques 7 Engineering and PlanningExample: Runway Capacity Analysis Weighted average of interarrival time Capacity is expressed by = 1 Finn = 2 Pty 002) C==—— 1101) TF Amin where pj = probability of arrival pair ij If arrivals are independent Py = PP; (10.3) Note: Assume arrivals only, no departures More details in CES 446 Port and Airport Engineering CES341 Transportation Chapter: Traffic Analysis Techniques 8 Engineering and Planning, 8.1.3 Development of Simulation Models e More complicated problems » Space-time diagrams are used to develop simulation models « Behavior of system in a step-by-step manner CES341 Transportation Chapter8: Traffic Analysis Techniques 9 Engineering and Planning,Example: Block Signal Control System for Rail Line » Objective: To protect » System of blocks and train collisions and other aspects (combination of hazards such as broken signal lights) rails » System consists of * Electronically insulated section of tracks = blocks © Train detection system: to determine if a train is ina particular block (the block is occupied) ® Signal system (warn or control) (CES341 Transportation Chapter8: Traffic Analysis Techniques 10 Engineering and Planning, —— Direction of waver Train = Max. stoppin ‘distance (a) Two-block, three aspect (b) Three- block, three-aspect 88888 Block Max. stopping: ‘distance (©) Three-block, four aspect Fig. 8.6 Block signal control systems (CES341 Transportation Chapters: Trafic Analysis Techniques 1" Engineering and PlanningExample: Block Signal Control System © 0.75 km long blocks e Three-block, four aspect system © RR -stop and proceed at 7.5 km/h prepared to stop © RY - proceed at 30 km/h, prepare to stop at next signal © GY - proceed at 60 km/h © GG - proceed at full speed CES341 Transp Engineering ancl Chapter Traffic Analysis Techniques 12 Example: Block Signal Control System ° A train traveling at 45 km/h, passes a point A, which is located at a block boundary, at 11:00 a.m. © Five min and 30 s later, a second train passes this point traveling at 90 km/h in the same direction ° Both trains are 0.375 km long Describe the motion of the second train, determine the time that the rear of second train passes point B, located 4.875 km beyond point A CES341 Transportation (Chapter: Traffic Analysis Techniques. 13 Engineering and PlanningRear of first train Front of first train Distance, km Time-space diagram of the first train CES341 Transportation (Chapter: Traffic Analysis Techniques 14 Engineering and Planning B Distance, kin Signal indication after the first train S34 Transportation (Chapter: Traffic Analysis Techniques 15, Engineering and PlanningDistance, km, Trajectory of the second train according to block signals CES341 Transportation Chapter8: Traffic Analysis Techniques 16 Engineering and Planning Distance, km, Trajectory of the second train (front) according to block signals CES341 Transportation Chapter: Traffic Analysis Techniques "7 Engineering and PlanningHs 110 11:05 11:00 Distance, km. Trajectory of the second train (front&rear) according to block signals CES341 Transportation Chapter: Traffic Analysis Techniques 18 Engineering and Planning 8.14 Non-trajectory Space-Time Diagrams « Display information about traffic states (speed, flow rate, density) as well as vehicle trajectories e Contour diagram can be used to display region with similar traffic state values CES341 Transportation CChapterssTraffic Analysis Techniques 19 Engineering and Planning8.14 Non-trajectory Space-Time Diagrams Location Fuerte Dr. Murray Dr. E1Cajon Blvd. W. Main St. Johnson Ave. Magnolia/Rte. 67 5 Mollison Ave. 2nd St. CFS341 Transportation Chapter: Traffic Analysis Techniques Engineering and Planning 8.2 Queuing Analysis ane | ee Figure 8.12 Queuing System CES341 Transportation (Chapter: Traffic Analysis Techniques Engineering and Planning 20 248.2.1 Queuing Theory Fundamentals i ; j Tine The Figure 8.13 Arrival function Figure 8.14 Arrival and for airport runway departure functions for airport runway (CES341 Transportation Chapter: Traffic Analysis Techniques 22 Engineering and Planning 8.2.1 Queuing Theory Fundamentals i z i i j Tine Figure 8.14 Queuing Figure 8.14 Queuing diagram features diagram, smooth curve approximation (CES341 Transportation Chapter: Traffic Analysis Techniques 23 Engineering and Planning8.2.2 Queue Discipline « First-in, first-out (FIFO) « Last-in, first-out (LIFO) e Random service Priority service cES3H1 Chapter8: Traffic Analysis Techniques 24 Engineeri Relationship of Delay (w(t)) and Queue Length (Q(t)) of Individual at Time t W(t) = Waiting time (Delay) of an individual at time t Q(t) = Queue length at time t =service rate (CES341 Transportation (Chaptov8: Traffic Analysis Techniques 25 Engineering and Planning8.2.3 Stochastic Queuing Models » Deterministic queuing models ~ arrival and service rate are deterministic (known as some function) e Stochastic queuing models © constant long term arrival and service rates © short-term random fluctuations around the average rates © arrival rate may exceed service rate for short time intervals and queues will form CES 341 Transportation Chapter8: Traffic Analysis Techniques 26 Engineering and Planning Stochastic Queuing Models oes Arrivals Service Exponentially “Deterministic Distributed One Channel (No random variation) Inter-arrival times follow Negative Exponential Distribution ° M/M/1 CES341 Transportation Chapter: Traffic Analysis Techniques a7 Engineering and Planningfom A =arrival rate = l- p p= sents rate =— = traffic intensi Pp Zl ty 2 ul - p) Q=average queue length Ww =average waiting time t= oP t =average time 2u (1 ~P ) spent in the system (CES341 Transportation CChapter®: Traffic Analysis Techniques 28 Engineering and Planning A =arrival rate i= service rate p= 2S traffic intensity ut Q=average queue length Ww = average waiting time t = average time spent in the systemGeneral relationships O=At CES341 Transportation Chapter: Traffic Analysis Techniques 30 Engineering and Planning 8.2.4 Transportation Applications of Queuing Theory Server opens after arrivals begin Aviival eeetmpernny exeads constant service rate Service rate varies Server temporarily shut down (CES341 Transportation Chapter: Traffic Analysis Techniques 34 Engineering and Planning8.2.5 Queue Density, Storage, and Spillback e Density (vehicles per unit distance) e Occupancy - fraction of time vehicles are over the detector « Objectives of studying queue density * Locating queues and bottlenecks in traffic © Determine the length of the queue and space needed for queue storage, control the queue spillback to upstream section ‘Chapters: Trafic Analysis Techniques 32 Example Problem 8.1 e Morning peak traffic upstream of a toll booth is given in the table e The toll plaza consists of three booths, each of which can handle an average of one vehicle every 6 s. « Using queuing diagram, determine the maximum queue, the longest delay to an individual vehicle, and the total delay ‘Chapter: Traffic Analysis Techniques 33Example Problem 8.1 Time period 10 min volume Cumulative volume 7:00-7:10 200 200 7:10-7:20 400 600 7:20-7:30 500 1100 7:30-7:40 250 1350 7:40-7:50 200 1550 7:50-8:00 150 1700 (CES3H1 Transportation Chapter: Traffic Analysis Techniques 34 Engineering and Planning Cumulative volume, A(t) 10 min 1 300 veh/min, D(t) a 2 z 2 3 E é 100 D(t)>A( {Show A(t), No queues} 7:00 730 8:00 Time 8-21 ceswiTanporatin Chap Tac Araya Techiguee 3s Engineering and Planning,8.3 Network Analysis e Network “ Nodes : Usually points of facilities intersect * Origins or destinations of trips (source or sink nodes) ® Decision points © Links : Usually road or railway segments e Link characteristics * Link costs: Distance, travel time, generalized costs (weighted sum of several costs) (CES341 Transportation CChapter8: Traffic Analysis Techniques 36 Engineering and Planning Node Cost (travel time) ¥ 10 min 6 min Network Elements 8-23 _cissi1 Transportation Chaple Tafic Analyse Techniques 37 Engiesringand PlanningExample network Minimum path algorithm, step 1 8-25 _cisn Tamporaton Sap Tas Anya tai 2 Engnestngant Pann Minimum path algorithm, step 2 8-26 cts Trmperaton pe Tae Atay Tei = eee8-27 ces341 Transportation CChapter8: Traffic Analysis Techniques 40 Engineering and Planning, ‘Tentative label IS.E Minimum path algorithm, step 4 8-28 cv Tanporaton Cape Tai alps Tecelgpes an Cou TitepaeenMinimum path algorithm, step 5 8-29 cess Trans Engineeringand tation CChapter$: Traffic Analysis Techniques 42 Minimum path algorithm, step 6 CChapter8: Traffic Analysis Techniques 43Table 8.1 Link-cost array Node CES341 Transportation Chapter Traffic Analysis Techniques 44 Engineering and Planning 8-34 cES341 Transportation Chapters: Traffic Analysis Techniques 45 Engineering and Planning,Chapter8: Traffic Analysis Techniques Engineet 8-32. cess tion 8-33 ces341 TransportationCopyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 8-33 __cissai Transporation Chaplet: Talc Analysis Tehrigues 47 Enginceingand Ping copyright ©The MeGraw-Hll Companies, ne, Permission required for reproduction or alspay EICajon