Scribd
Upload
59 views5 pages

1.225 J (ESD 205) Transportation Flow Systems

The document summarizes the key topics covered in the 1.225J transportation flow systems course, including modeling of air traffic flows, road traffic flows, shortest path algorithms, traffic assignment, optimization, queuing models, simulation, and traffic signal control. It concludes with possible related subjects for follow-on courses.

Uploaded by

Elsa Eka Putri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
59 views5 pages

1.225 J (ESD 205) Transportation Flow Systems

The document summarizes the key topics covered in the 1.225J transportation flow systems course, including modeling of air traffic flows, road traffic flows, shortest path algorithms, traffic assignment, optimization, queuing models, simulation, and traffic signal control. It concludes with possible related subjects for follow-on courses.

Uploaded by

Elsa Eka Putri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1.

225J
1.225J (ESD 205) Transportation Flow Systems

Lecture 13:
WrapWrap-up
Quiz Review
Subject Evaluation

Prof. Ismail Chabini and Prof. Amedeo Odoni

1.225J
1.225J (ESD 205) Transportation Flow Systems

Course WrapWrap-Up

Prof. Ismail Chabini and Prof. Amedeo Odoni

Cumulative plots and TimeTime-Space Diagrams


Q = W
Cumulative plots: A(t), D(t), Q(t), w(n)
1
q( x)
Analysis at a fixed position of time-space diagrams:
1 h ( x)
k (t )
Analysis at a fixed time of time-space diagrams:
s (t )

Modeling Air Traffic Flows

Introduction to the modeling of air traffic flows


An analytical model for arrival capacity of one runway
Model analysis and practical issues
Overview of other models for ATM workload, air delays, taxiways
and airport terminals

Wrap-up, Page 3

1.225, 12/12/02

Modeling Road Traffic Flows


Macroscopic models: fundamental (density vs. flow) diagram
Microscopic car-following models
Relationship between macroscopic and microscopic models

Shortest Paths and Assignment on NonNonCongested Networks

Representation of an urban road network (supply)


Zoning and analysis periods (demand)
A one-to-all (all-to-one) shortest paths: example and algorithm
Assignment on non-congested networks: compute shortest paths
between O-D pairs, load O-D demands on shortest paths and sum
link flows

1.225, 12/12/02

Wrap-up, Page 4

Traffic Assignment on Congested


Congested Networks
Volume-delay functions for congested networks and static demand
Static traffic assignment concepts and principles
Concepts: assignment, arc incidence matrix, relationships
between path flows and link flows, and link costs and path costs
Traffic assignment principles: User Optimal and System Optimal
User Optimal assignment:
All used paths have equal and minimum travel times
Equivalent to an imaginary system optimum traffic assignment:
link travel time functions are replaced by:
System Optimal traffic assignment:
Total travel times are minimized
Equivalent to an imaginary user optimal traffic assignment: link
travel time functions are replaced by marginal link travel-times
All used paths have equal and minimum marginal travel times
Wrap-up, Page 5

1.225, 12/12/02

Introduction to Optimization

Mathematical programs (MPs)


Formulation of shortest path problems as MPs
Formulation of U.O. traffic assignment as an MP
Relationship between U.O. and S.O. traffic assignment
Relationship between U.O. and S.O. traffic assignment is useful for
the development of solution methods

Freeway Traffic Control


Introduction to freeway traffic control and ramp metering
Pre-timed, coordinated ramp metering to maximize the number of
vehicles served while maintaining freeway capacity: an LP
formulation and example
1.225, 12/12/02

Wrap-up, Page 6

Delays in Probabilistic Models

Introduction to queuing processes and queuing systems


Steady state vs. transient state
Terminology and notation for queuing models
Littles Law and basic relationships between fundamental variables
State Transition Diagram for M/M/1
Derivation of queuing characteristics of M/M/1

Wrap-up, Page 7

1.225, 12/12/02

Simulation Models

Introduction to simulation models


Random numbers and the inverse transformation method
Event-driven and discrete-time simulation for M/M/1 systems
An event-driven simulation model for M/M/1 on a spreadsheet

Traffic Signals Control at Isolated Intersections


Definition of saturation flow rate, effective greens, and lost time
The three terms of Webster formula for delay at an isolated
intersection
Websters cycle time setting procedure
Websters green time setting procedure

1.225, 12/12/02

Wrap-up, Page 8

Possible FollowFollow-on Subjects

Road traffic network models and algorithms (1.207)


Air traffic control (16.71?)
Probabilistic models (1.203, 6.431)
Algorithms (1.204)
Mathematical programming (15.081)

1.225, 12/12/02

Wrap-up, Page 9

You might also like