CE 392C
Transportation Network Analysis
Fall 2021
This course covers static transportation networks, including shortest
path and traffic assignment. Lecture slides, homeworks, and practice
exams will be posted here as the semester progresses. Please check back
often.
Semester schedule
Week 1 (8/26)
 Reading assignment (response due on Monday 8/30):
Textbook sections 1.11.5, 2.12.3, 3.1, 4.14.3.
Skim Appendix A, and read more carefully if there are any unfamiliar topics
there.
 Please review the syllabus and let me know
if you have any questions.
 You can download a copy of the course text here.
 Lecture slides on
course logistics and
network terminology.
Week 2 (8/31 and 9/2)
 Reading assignment (response due on Monday 9/6):
Textbook sections 3.2; skim Appendix B, and then read section 3.3.
 Homework 1 due at 11:59 PM on Friday 9/17):
Python tutorial and network fundamentals..
 Online assignment due at 11:59 PM on Friday 9/10: see Canvas.
 If you are not familiar with Python, please go through this tutorial;
go through the sections titled "Basics of Python," "Builtin Data
Structures," and "Functions and Classes."
 Also see the page for additional tips and
suggestions on Python programming.
 If you are new to Python but have experience with a different
programming language, see the Python onramp.
 Lecture slides on
user equilibrium and system optimum and
mathematical techniques.
Week 3 (9/7 and 9/9)
Week 4 (9/14 and 9/16)
Week 5 (9/21 and 9/23)
Week 6 (9/28 and 9/30)
Week 7 (10/5 and 10/7)
Week 8 (10/12 and 10/14)
 Reading assignment (response due on Monday 10/18):
Textbook sections 8.38.3.5 and 8.3.7 (skim 8.3.3 and material on "Full cyclic path set")
 Online assignment due at 11:59 PM on Friday 10/22: see Canvas.
 Lecture slides on
stochastic user equilibrium.
Week 9 (10/19 and 10/21)
Week 10 (10/26 and 10/28)
 Reading assignment (response due on Monday 11/1):
Textbook section 5.2.2, skim 6.5.
 Project proposals due on Friday 10/29. Please discuss with me
if you have questions or are having trouble finding a group.
 Online assignment due at 11:59 PM on Friday 11/5: see Canvas.
 Lecture slides on
pathbased and
bushbased algorithms.
Week 11 (11/2 and 11/4)
Week 12 (11/9 and 11/11)
 Reading assignment (response due on Monday 11/15):
 Flyvbjerg, B., M. K. Skamris Holm, and S. L. Buhl. (2005)
How (in)accurate are demand forecasts in public works projects?
Journal of the American Planning Association 71, 131146.
 Waller, S. T., J. L. Schofer, and A. K. Ziliaskopoulos. (2001)
Evaluation with traffic assignment under demand uncertainty.
Transportation Research Record 1771, 6974.
 Online assignment due at 11:59 PM on Friday 11/19
 Lecture slides on
sensitivity analysis and bilevel programs.
Week 13 (11/16 and 11/18)
 No reading assignment this week.
 Online assignment due at 11:59 PM on Friday 11/19.
 Last semester's exam for practice.
 My C code for Algorithm B.
Week 14 (11/23)
 No reading assignment this week.
 SEMESTER EXAM on Tuesday 11/23.
Week 15 (11/30 and 12/2)
 Group project presentations.
 Project reports due Monday, December 13, at noon.
Back to teaching or the
main page.
