© Siemens AG 2011. All Rights Reserved A New Method of Split and Cycle Time Calculation as Part of the Adaptive Network Control Method Sitraffic Motion.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
NEURAL NETWORKS Backpropagation Algorithm
ECE 667 Synthesis and Verification of Digital Circuits
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
ANDREW MAO, STACY WONG Regrets and Kidneys. Intro to Online Stochastic Optimization Data revealed over time Distribution of future events is known Under.
Acoustic design by simulated annealing algorithm
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
Introduction to VISSIM
Chapter 221 Chapter 22: Fundamentals of Signal Timing: Actuated Signals Explain terms related to actuated signals Explain why and where actuated signals.
The Min-Max Split Delivery Multi- Depot Vehicle Routing Problem with Minimum Delivery Amounts X. Wang, B. Golden, and E. Wasil INFORMS San Francisco November.
Supervised learning 1.Early learning algorithms 2.First order gradient methods 3.Second order gradient methods.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
INTRODUCTION TO TRANSPORT Lecture 4 Introduction to Transport Lecture 4: Signal Timing.
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.
Lec 24, Ch.19: Actuated signals and detectors (Objectives) Learn terminology related to actuated signals Understand why and where actuated signals are.
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
Lec 15, Ch.8, pp : Signal Timing (Objective)
Introduction to Transport
Chapter 6: Multilayer Neural Networks
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Lec 14, Ch.8, pp : Intersection control and warrants (objectives) Know the purpose of traffic control Know what MUTCD is and what’s in it Know what.
Lecture 4 Neural Networks ICS 273A UC Irvine Instructor: Max Welling Read chapter 4.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
ICS 273A UC Irvine Instructor: Max Welling Neural Networks.
2015 Traffic Signals 101 Topic 7 Field Operations.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
RT-TRACS A daptive Control Algorithms VFC-OPAC Farhad Pooran PB Farradyne Inc. TRB A3A18 Mid-Year Meeting and Adaptive Control Workshop July 12-14, 1998.
Applied Transportation Analysis ITS Application SCATS.
Assessment of Urban Transportation Networks by integrating Transportation Planning and Operational Methods /Tools Presentation by: Sabbir Saiyed, P.Eng.
Workshop PRIXNET – 11/12 Mars CONGESTION PRICING IN AIR TRANSPORTATION Karine Deschinkel Laboratoire PRiSM – Université de Versailles.
A Framework for Distributed Model Predictive Control
ENCI 303 Lecture PS-19 Optimization 2
A Simple Algorithm for Stable Minimum Storage Merging Pok-Son Kim Kookmin University, Department of Mathematics, Seoul , Korea Arne Kutzner Seokyeong.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
Chapter 20: Actuated Signal Control and Detection
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
1 Optimization Based Power Generation Scheduling Xiaohong Guan Tsinghua / Xian Jiaotong University.
Line Balancing Problem
TRAFFIC SIGNAL OPTIMIZATION: A Coordinated Effort Tom Dancey, P.E. Signal System Engineer City of Springfield CITY OF SPRINGFIELD & MISSOURI DEPARTMENT.
Siemens Traffic Controls Ltd ITSE99/Standards 1 Traffic Management and Control Workshop on Research and Technological Development for Information Society.
Dr. Essam almasri Traffic Management and Control (ENGC 6340) 9. Microscopic Traffic Modeling 9. Microscopic Traffic Modeling.
Optimization with Neural Networks Presented by: Mahmood Khademi Babak Bashiri Instructor: Dr. Bagheri Sharif University of Technology April 2007.
Optimal Sequencing of Traffic Streams at a Signalized Intersection Peter G. Furth Dept. of Civil & Environmental Engineering Northeastern University, Boston,
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
Stochastic Optimization Method for Coordinated Actuated Traffic Control May 16, 2008 Joyoung Lee and Byungkyu “Brian” Park, Ph.D Presented at VISSIM UGM.
Bernhard Friedrich Hanover, May 2001 Strategic Control in Metropolitan Areas Bernhard Friedrich Institute of Transport Engineering and Planning Hanover.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
ALGORITHMS.
TRB Planning Applications Conference May 2009, Houston,TX A Caveat on O-D Matrix Estimation/Adjustment: Deviations from a seed matrix and Simultaneous.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Frankfurt (Germany), 6-9 June 2011 Manuel Avendaño J. V. Milanović Manuel Avendaño – UK – Session 2 – Paper 0529 METHODOLOGY FOR FLEXIBLE, COST-EFFECTIVE.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Department of Electrical Engineering, Southern Taiwan University 1 Robotic Interaction Learning Lab The ant colony algorithm In short, domain is defined.
Institute of Chemical engineering- Bulgarian academy of sciences
Traffic Simulator Calibration
GREEN WAVE TRAFFIC OPTIMIZATION
Video through a Crystal Ball:
* Topic 7 Field Operations
Unit 4: Dynamic Programming
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
DISCRETE ASCENT OPTIMAL PROGRAMMING APPLIED TO NETWORK CONFIGURATION IN ELECTRICAL DISTRIBUTION SYSTEMS B. A. Souza H. A. Ferreira H. N. Alves.
Neural Networks ICS 273A UC Irvine Instructor: Max Welling
Boltzmann Machine (BM) (§6.4)
Chapter 6 Network Flow Models.
Template for methodological application
Presentation transcript:

© Siemens AG All Rights Reserved A New Method of Split and Cycle Time Calculation as Part of the Adaptive Network Control Method Sitraffic Motion Juergen Mueck (presentation, with input from Qiao Ge) Dr. Andreas Poschinger and Qiao Ge (paper) J. Mueck, A. Poschinger: Siemens AG, Germany Q. Ge: ETH Zuerich, Switzerland

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 2 Content  Context: Adaptive Network Control  Requirements we have to meet  Algorithmic Solution  Split Calculation  Cycle Time Selection  Conclusions

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 3 Context: Split and Cycle Time Calculation within Sitraffic Motion Hierarchical Architecture Central Network Control Local Traffic Actuated Control Central Optimization  Optimize every 5-15 min  Signal program choice  Stage sequences  Cycle times  Green split  Offset Local controllers  Control every second  Traffic actuation  PT Priorisation

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 4 Customer requirements we have to meet Many customers have very detailed requirements regarding split and cycle time calculation, for example:  Split must be calculated as optimal as possible  Assign free parts of split (buffer times) to  Pedestrians (inner city traffic)  Side roads (promoting Public Transport)  Main roads (making coordination more robust)  Impose min/max times and other restrictions  Common cycle time must be sufficiently high, but only when needed...  Cycle time selection must be fast but robust Do all this with an algorithm, which is comprehensible can be changed in configuration at any time doesn’t use stochastic optimization (  traceability, calibration, speed) Example with four sub junctions

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 5 Split and cycle time calculation, based on stages Basics For each controller:  Start with the minimum possible cycle time, incl. minimum durations  Find the signal group with the smallest Green Reserve Rate (R) first, then extend the stage containing this signal group with 1 second. SG 2 has the smallest R minimum required cycle time 1s to stage 3 Update and Repeat until for all signal groups Green Reserve Rate

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 6 Split and cycle time calculation, based on stages Applying Multiple-Criteria Decision Matrix +1s Assessment per signal group (“min wins”) Assessment per stage (“min wins”)   Maximum Signal Length  Green Reserve Rate  Green Distribution Factor Initial signal plan (= min cycle time)  Min signal & stage lengths Final signal plan with required cycle time / target cycle time Maximum stage lengths # One stage wins Increasing stage length improves sg assessment stage not relevant  99 maximum reached  100

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 7 Decision Matrix Example (1): Which stage to extend?  One signal group has green time in more than one stages  Main /Help Signal Group  Boundary Condition  Approach: Stage based decision matrix If SG 4 has the min. R, then extend Stage 1 or Stage 2?

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 8 Decision Matrix Example (2): Decision step Stage 1Stage 2Stage 3Stage 4Stage 5 Signal Group R SG R R R R Stage 1Stage 2Stage 3Stage 4Stage 5 R SG R R R R Sorted by Stages (ascending order of R): Original:

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 9 Interim result: “Stage based cycle time” Found cycle time fulfills (if possible)  Min stage durations  Min green times  Necessary green times The found cycle time is definitely the minimum necessary cycle time.... but with regard to applying trends or forecasting to the found cycle time: Min constraints and coupled green times in stages have biased the found cycle times.  Hybrid approach by using a second cycle time calculation method and “merging” the results So, the cycle time calculated this way can not be used as base for trend analysis.

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 10 Split and Cycle time, based on stages (part 1) Overall picture on cycle time and split calculation, showing the hybrid cycle time approach Cycle time forecast Split (cont.) for se- lected Cycle time = Calculation step Cycle time, by conflict groups Cycle time calculation based on “conflict groups” (= cg)  Def. “cg” ≡ “Set of conflicting signal groups”  Enumerate through all cg’s  Use intergreen times only Found cycle time  is by that much lower, but  is without discontinuities and bias  feasible for trend analysis

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 11 Cycle time forecast Cycle time, by conflict groups Idea:  Transfer the relative change during the time horizon from conflict based cycle time to the stage based one Please refer to the paper for the theoretical fundation of the transfer process Split and Cycle time, based on stages (part 1) with

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 12 Post processing of the identified “best” cycle time Found cycle time is feasible to recognize evolving peak traffic fast enough Some “finalizing”...  Final cycle time has to be one out of a given set (Discretizing)  Cycle time required by all intersections in an area have to be merged (usually by a “max” operation...)  Some hysteresis is applied (Stability)  Downward changes are delayed (Stability)

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 13 Conclusions Split calculation Compared to the previous, heuristic method, based on a steepest gradient approach (not shown here) Simulation results show that:  Constraints are safely met (if consistent)  Calculation is much faster  Initial parameters do well  saves time & money!  Positive feed back from field applic.  Performance improvement ≈ 5% (weighting of number of stops and delay) Cycle time calculation First findings allow to expect that  the approach could be a way to sufficiently handle cycle time selection in practice  both from a clear algorithmic point of view and  a practical point of view (few calibration parameters) But more experience in the field is necessary to have sufficient input for the final assessment.

IC MOL CTE © Siemens AG All Rights Reserved Juergen MueckPage 14 BACKUP