Dynamic Traffic Assignment
This course is designed to teach students the emerging field of dynamic traffic assignment. Notes, homeworks,
and practice exams will be posted here as the semester progresses.
Week 15 (5/1 and 5/3)
- Final project report (due 5 PM on Thursday 5/10): Submit on Canvas
- Project presentations both days this week. See guidelines and rubric for course project.
Week 14 (4/24 and 4/26)
Week 13 (4/17 and 4/19)
Week 12 (4/10 and 4/12)
- No reading assignment this week.
- Lecture slides on properties of dynamic user equilibrium and practical issues related to dynamic traffic assignment.
Week 11 (4/3 and 4/5)
- Reading assignment (response due at 9 AM on Monday 4/9): Read the following papers and respond via email:
- Boyles, S. D., C. Melson, T. Rambha, and J. C. Duthie. Diverge nodes and dynamic traffic equilibria. Working paper.
- Cascetta, E., A. Papola, V. Marzano, F. Simonelli, and I. Vitiello. (2013) Quasi-dynamic estimation of O-D flows from traffic counts: formulation, statistical validation and performance analysis on real data. Transportation Research Part B 55, 171-187.
- Online assignment 3 due at 11:59 PM on Friday 4/13: See Canvas
- Lecture slides on algorithms for solving for dynamic user equilibrium, and properties of dynamic user equilibrium. Spreadsheet for exploring Nie's merge.
Week 10 (3/27 and 3/29)
- Reading assignment (response due at 9 AM on Monday 4/2): Read the following papers and respond via email:
- Daganzo, C. F. (1998) Queue spillovers in transportation networks with a route choice. Transportation Science 32, 3-11.
- Nie, Y. (2010) Equilibrium analysis of macroscopic traffic oscillations. Transportation Research Part B 44, 62-72.
- Homework 3 due at 11:59 PM on Friday 4/6: Node models
- Lecture slides on algorithms for solving for dynamic user equilibrium.
Week 9 (3/20 and 3/22)
Week 8 (3/6 and 3/8)
- Reading assignment (response due at 9 AM on Monday 3/19): Textbook sections 12.1-12.2.2
- Lecture slides on time-dependent shortest paths. Note that the text has some errors in the example tables for the second and third TDSP algorithms. These slides have the corrected values.
Week 7 (2/27 and 3/1)
- Reading assignment (response due at 9 AM on Monday 3/5): Textbook sections 11.2 and 11.3
- Online assignment 2 due at 11:59 PM on Friday 3/9) : Fancier network loading; see "Quizzes" on Canvas.
- Homework 2 due at 11:59 PM on Friday 3/9): Link models
- Lecture slides on general intersections and time-dependent shortest paths.
Week 6 (2/20 and 2/22)
Week 5 (2/13 and 2/15)
Week 4 (2/6 and 2/8)
- Reading assignment (response due at 9 AM on Wednesday 2/14): Textbook section 10.5
- Online assignment due at 11:59 PM on Friday 2/16) : Basic network loading; see "Quizzes" on Canvas.
- Homework 1 due at 11:59 PM on Friday 2/23): Python tutorial and LWR problems
- Lecture slides on LWR model.
Week 3 (1/30 and 2/1)
Week 2 (1/23 and 1/25)
- Reading assignment (response due at 9 AM on Monday 1/29): Textbook sections 10.2-10.4.2; also skim the DTA primer put together by the TRB ADB30 committee.
- If you are not familiar with Python, please go through this tutorial; go through the sections titled "Basics of Python," "Built-in Data Structures," and "Functions and Classes."
- Lecture slides on basic link models. Also, last week's slides have been updated with additional content.
Week 1 (1/16 and 1/18)