Vagvisare © S.Persson Department of Civil & Environmental Engineering • University of California Irvine
CEE 228A URBAN TRANSPORTATION NETWORKS I

Fall 2024 [Course Code: 15950]
Instructor: Professor MG McNally <mmcnally-at-uci-edu>
Overview Schedule Notes Projects Links HOME

Final Exam Final Exam will be Monday, December 9th (4-6 pm) [ Sample Final ]
Week 10. Stochastic Assignment; Variable Demand
Week 9. Trip Assignment Problem: Paradoxes; Stochastic Assignment
Week 8. Trip Assignment Problem: Algorithms; Theory
Week 7. Trip Assignment Problem: Behavioral Criteria; Midterm
Week 6. Network fundamentals including alternate structures for representing network data are presented. The Transportation Problem is generalized as the Transshipment Problem, which in turn is shown to be the general case of many Shortest Path Problems formulations.
Week 5. Networks and theShortest Path; Examples; [ Sample Midterm ]
Week 4. Network Fundamentals: Limitations imposed by the OR Transportation Problem lead to the link-based Transshipment Problem and the Shortest Path Problem, each of which requires Network basics.
Week 3 OR Transportation Problen: Primal and dual linear programs; the dual's interpretation is the basis of the Hitchcock Algorithm.
Week 2: Overview of TSA; Travel Forecasting; Shortest Paths
Week 1: Following an overview of course requirements, basic concepts of Transportation Systems Analysis are introduced. Travel demand forecasting materials from CEE220A are reviewed.
Pre-requisite: All enrolled students must review basic mathematical programming (CEE221a and the 228a links section provide some references). Selected notes will be posted to the web site but you will need to rely on basic knowledge from prior courses and/or self-study to assimilate this prerequisite course material.

CEE228a Home | Last modified: 4 December 2024 | terms of use | © MGMcNally ]