Aggressive Signal Priority with Compensation: Maximizing the Transit Benefit Without Disrupting Traffic Peter G. Furth Northeastern University.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

1 Concurrency: Deadlock and Starvation Chapter 6.
1
Technische Universität München + Hewlett Packard Laboratories Dynamic Workload Management for Very Large Data Warehouses Juggling Feathers and Bowling.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Part 3 Probabilistic Decision Models
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
UNITED NATIONS Shipment Details Report – January 2006.
RXQ Customer Enrollment Using a Registration Agent (RA) Process Flow Diagram (Move-In) Customer Supplier Customer authorizes Enrollment ( )
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Status Report: Evaluation of Private Sector Data in Minneapolis Shawn Turner Texas Transportation.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 10 second questions
Loading and Unloading Students
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Traffic Analysis Toolbox & Highway Capacity Manual Transition
Andrew McNaughton 1 Radical Change is Entirely Possible! 2 nd November 2011.
Turing Machines.
PP Test Review Sections 6-1 to 6-6
EU market situation for eggs and poultry Management Committee 20 October 2011.
1 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. On the Capacity of Wireless CSMA/CA Multihop Networks Rafael Laufer and Leonard Kleinrock Bell.
Developing a Project Plan CHAPTER SIX Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Chapter 6: Developing a Project Plan
Project Management 6e..
Where We Are Now Copyright © 2011 The McGraw-Hill Companies, All Rights Reserved.
Developing a Project Plan
2 |SharePoint Saturday New York City
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
VOORBLAD.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Linear-Quadratic Model Predictive Control for Urban Traffic Networks
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
Signs, Signals, and Pavement Markings
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Intracellular Compartments and Transport
Drivers Education Journal # Please pick up all the handouts Get out a sheet of loose leaf paper and something to write with Write the.
PSSA Preparation.
Essential Cell Biology
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Energy Generation in Mitochondria and Chlorplasts
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Transit Signal Priority Applications New Technologies, New Opportunities Peter Koonce, PE APTA BRT Conference – Seattle, WA Wednesday, May 5, 2009 Technology.
Introduction to Transport
Advanced Public Transit Systems (APTS) Transit ITS CEE582.
Transit Priority Strategies for Multiple Routes under Headway-based Operations Shandong University, China & University of Maryland at College Park, USA.
Transit Signal Priority (TSP). Problem: Transit vehicles are slow Problem: Transit vehicles are effected even more than cars by traffic lights –The number.
Presentation transcript:

Aggressive Signal Priority with Compensation: Maximizing the Transit Benefit Without Disrupting Traffic Peter G. Furth Northeastern University

Transit Signal Priority – Hype or Help? Zurich: nearly zero delay for trams and buses, normal traffic delays for autos Portland, OR: route level changes between 0% and 12% Many US applications: < 3 s savings per intersection, or no measurement at all 2

3 Overview of Ruggles Bus Terminal 13 different bus routes 96 buses enter and leave, AM peak At the busiest intersection Buses = 3% of vehicles Bus passengers = 37% of travelers Average bus entry + exit delay = 150 s Research Question: How much difference can priority make near a major terminal?

4 BUS TERMINAL Back Entrance Main Entrance Exit Ruggles- Busway Ruggles- Tremont-Whittier Tremont-Cass Cass-Columbus

5

6

1 Bus Delays with Incremental Priority Treatments, by Route

Passive Priority Operate without detecting buses Shorter cycles (shorter red shorter wait) Cycle splits and offsets that favor bus movements Diverting upstream traffic 8

9 9 Increasing EBL Split by 5 s: It only consumes 2.5 s Max Green = 16 seconds Proportion p (max-out) = 84.6% Avg bus delay = 98 s p (max-out) = 51.2% Avg bus delay = 67 s Max Green = 21 seconds Avg Green (EBL) = 15.3s Proportion Avg Green (EBL) = 17.8s

Detection Check-in detector location –Early enough to allow time to respond –Late enough to estimate bus arrival time Checkout detector to cancel request –Avoid wasted green –Performance measurement In-ground vs. overhead Optical signal with calibrated sensitivity Continuous detection (short-range radio and GPS) 10 Sketch 1

Upstream Detector, with travel time = maximum green extension Simplicity: Request = detection No need for priority request generator 11 Weaknesses: assumes constant speed no flexibility for updates, time of day settings not suitable for other priority tactics

What if Theres a Near-Side Stop? Detector located just after stop Disable optical signal until door closes (Portland, OR) 12

Advanced (Upstream) Detection Predictive priority –Checkout loop 1 communicates to signal 4 –Logic needed to predict arrival time, generate priority request, choose appropriate priority action 13

Priority to Buses in Mixed Traffic Electronic bulldozer Flushing the queue ahead of the bus = tracking queue length (Zurich) 14

In Mixed Traffic, Near Saturation Detectors & logic for queue management – Stopped cars, not moving cars, hinder buses 15 (Zurich) (Eindhoven) Traffic metering

Green Extension Built-in logic in modern controllers Large benefit to a few buses –Little disruption to traffic Extension increment is often fixed –Wastes green Is extra time borrowed or stolen? –Uncoordinated phase: often borrowed –Coordinated phase: usually stolen 16

17

18 Green Time Distribution for EBL No Priority Proportion Avg Green (EBL) = 17.8s Avg Green (WBT) = 30.3s p (max-out) = Avg Green (WBT) = 29.8s p (max-out) = p (extended) = Avg Green (EBL) = 18.1s Proportion With Green Extension Extended Green

Priority Push Extension Increment no priority, uniform arrivals R = effective red C = cycle length v = arrival rate s = discharge rate 19

with priority X = green extn Priority push! 20

Priority Push vs. Extension Increment (cycle length = 100 s, red time = 50 s, degree of saturation = 85%) 21

Priority Push vs. Red Time (cycle length = 100 s, extension increment = 15 s, degree of saturation = 85%) 22

Early Green How aggressive? –How much to shorten competing phases? –Skip competing phases? –Compensation to shortened / skipped phases? –For buses arriving in early part of green? Requires tracking queue length Smaller benefit to large number of buses –Hard to implement when bus frequency is high Truncate and possibly skip preceding phases 23

Early Red Incompatible with typical coordination logic –custom programming Shorten bus streets current green to get faster return to green in the next cycle, or red light during stop for pedestrian safety 24

Phase Rotation and Insertion Dynamically change leading left to lagging left 25 Second realization on bus detection only

26

27 10 s inserted EBL phase: only consumes 2.5 s Green Extension Only Proportion Extended Green Avg Green (EBL) = 18.1s Avg Green (WBT) = 29.8s Avg Green (insertion) = 4.4s Avg Green (WBT) = 27.3s p (insertion) = Extended Green Primary Phase, when Phase Insertion is Programmed Avg Green (primary) = 14.7s Avg Green (total) = 19.1s Proportion Bus delay = 55 s Bus delay = 33 s

Flush-and-Return Green extension (if needed) to clear queue from bus stop Force signal to red during stop –Minimizes buss impact on road capacity Return to green as quickly as possible 28 Early green tactic for Near-Side Stops bus

Predictive Priority Predict bus arrival time based on detection 2-3 minutes ahead Adjust cycle lengths so that bus will arrive on green Immediate priority as backup Adaptive (learning) prediction algorithm 29 Used for light rail in Houston & Salt Lake City; simulated for Boston

Conditional Priority Less interference with traffic (Eindhoven) Push-pull means of operational control (Einhoven) What is Late: 15 s or 3 minutes? Demands fine-tuned schedule Headway-based priority for short-headway service 30 Priority to Late Buses

Recovery to Arterial Coordination Fixed background cycle: long way / short way –How holy is arterial coordination? Dynamic coordination (Zurich) –Small zones (1-3 intersections) –Shape green waves through the zone around bus –Zone boundaries are segments that offer storage buffer 31

Self-Organizing Coordination No fixed cycle length Each signals start of green becomes a request to downstream signal –Peer-to-peer communication between signals –upstream signals request has lower priority that bus request Result: spontaneous green wave Inherently interruptible 32 Simulated for San Juan, Puerto Rico

33

Free Actuation within a Cycle (Back Entrance) Delay reduction for buses = 14 s (from 21 s to 7 s) Delay reduction for general traffic = 7 s

Compensating Interrupted Streams Compensation logic is rare –Result: traffic engineers limit priority Actuation can provide automatic compensation BUT, with typical arterial coordination, all the slack goes to the main movement, preventing compensation to minor movements 35

1 Bus Delays with Incremental Priority Treatments, by Route

Six Keys to Performance 1.Aim for near-zero delay (Yes, we can!) 2.Multiple and intelligent tactics 3.Aggressive tactics, with compensation 4.Alternatives to rigid coordination 5.Advanced prediction with gradual cycle adjustments 6.Custom programming and continual improvement 37