This document discusses operational problems in transportation systems including air traffic flow management, road traffic flow management, and integrated dynamic traffic control and assignment. It describes approaches to traffic prediction including statistical methods and dynamic traffic assignment methods. Finally, it presents results from a case study of different control approaches for a network in Back Bay, Boston, comparing total travel time under each control approach to the system optimum.
This document discusses operational problems in transportation systems including air traffic flow management, road traffic flow management, and integrated dynamic traffic control and assignment. It describes approaches to traffic prediction including statistical methods and dynamic traffic assignment methods. Finally, it presents results from a case study of different control approaches for a network in Back Bay, Boston, comparing total travel time under each control approach to the system optimum.
This document discusses operational problems in transportation systems including air traffic flow management, road traffic flow management, and integrated dynamic traffic control and assignment. It describes approaches to traffic prediction including statistical methods and dynamic traffic assignment methods. Finally, it presents results from a case study of different control approaches for a network in Back Bay, Boston, comparing total travel time under each control approach to the system optimum.
This document discusses operational problems in transportation systems including air traffic flow management, road traffic flow management, and integrated dynamic traffic control and assignment. It describes approaches to traffic prediction including statistical methods and dynamic traffic assignment methods. Finally, it presents results from a case study of different control approaches for a network in Back Bay, Boston, comparing total travel time under each control approach to the system optimum.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 13
1.
225J (ESD 225) Transportation Flow
Systems
Operational Problems in Traffic Systems
(Continued)
Prof. Ismail Chabini and Prof. Amedeo Odoni
1.225, 11/28/02 Operational Problems Part 1: Air Traffic Flow Management
• Introduction and conceptual definition of operational problems
• Ground-holding strategies • Results from case study
Part 2: Road Traffic Flow Management
• Conceptual organization of road traffic management problems
• Integrated dynamic traffic control and assignment • Results from case study
1.225, 11/28/02 Information Technology and Transportation Systems Management
Traffic Management Center
User Services Traffic Control
• traffic information • signal settings • routing advice • ramp meeting
Traffic Travel Network Surveillance Demand Supply System
Transportation Network
1.225, 11/28/02 Desirable Properties of an ATMS/ATIS
• ATMS/ATIS should be responsive to:
– “future” demand – potential adjustments in travel patterns due to information – variations in network capacity due to traffic control actions • ATMS/ATIS should be based on “projected” traffic conditions to: – anticipate downstream traffic conditions – improve credibility
1.225, 11/28/02 Traffic Prediction Approaches
• Statistical Methods – require no explicit assignment – are suitable for short intervals • Dynamic Traffic Assignment Methods – incorporate driver behavior – require network performance – require time-dependent O-D flows – have high computational requirements
1.225, 11/28/02 A Framework for (Analytical) Dynamic Traffic Assignment
destinations, 100 time intervals • Time of known methods: – Can be of quadratic as a function of the number of time intervals – May take up to 25 minutes for one destination • Algorithm DOT: – 0.8 seconds for one destination – Theoretically, this is the best one can do! • Other avenues: – High performance computing implementations (10 to 20 times faster) – Exploit hierarchy of transportation networks (5 to 10 times faster) • Combined effect: 100*10*5=5000 1.225, 11/28/02 Types of DTA Models • Microscopic traffic models (MITSIM): – Traffic is represented at the vehicle level – Vehicles are moved using car-following and lane changing models • Mesoscopic traffic models (MesoTS/DynaMIT): – Traffic is represented at the vehicle level – Speed is obtained using models that relate macroscopic traffic flow variables • Macroscopic (or flow-based) traffic models: – Traffic is represented as continuous variables – Speed is obtained using models that relate macroscopic traffic flow variables • Analytical (flow-based) traffic models 1.225, 11/28/02 Amsterdam Test Network
• Path variables: 34 Mbytes • Average time for one loading: about 3 minutes • Saving ratio compared to known analytical methods: 1000 • Results are encouraging for real-time deployment
• MITSIM: 1.5 times slower than real time
• MesoTS: 16 times faster than real time • Analytical approach: 45 times faster than real time
1.225, 11/28/02 Interdependence of Control and Assignment
Dynamic Traffic Control Dynamic Dynamic Traffic Signal Flow Setting
Dynamic Traffic Assignment
• Consequences of the conventional approach:
– Sub-optimal signal settings; – Inconsistent traffic flow predictions. 1.225, 11/28/02 A Case Study (cont.)
• Controls – current existing pre-timed control – Webster equal-saturation control – Smith P0 Control – One-level Cournot control – Bi-level Stackelberg control – System-optimal Monopoly control • Route Choices – A set of pre-determined paths (4 paths) for each O-D pair – Total of 400 paths – Demand is model using C-Logit 1.225, 11/28/02 Results from Back Bay Case Study: Total Travel Time
Controls Total Travel Time Gap from System-Optimum
