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

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

Final Exam Final Exam will be Monday, March 18, 4-6 pm and Wednesday March 20th, 4-6 pm
Week 10. Theory; Examples; Braess; Stochastic Assignment; Sample Final
Week 9. Midterm Exam; Trip Assignment Problem: Deterministic Algorithms
Week 8. Midterm
Week 7. Trip Assignment Problem: Behavioral Criteria; Sample 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
Week 4. Formal presentation of The OR Transportation Problem. Primal and dual linear programs; the dual's interpretation is the basis of the Hitchcock Algorithm. Limitations imposed by problem formulation lead to the link-based Transshipment Problem formulation.
Weeks 3 Overview of TSA, Transportation Planning, Travel Forecasting
Week 2: Following an overview of course requirements, basic concepts of Transportation Systems Analysis are introduced. Travel demand forecasting materials from CEE220A are reviewed.
Week 1: Due to TRB, CEE228a will not meet this week. These sessions will be re-scheduled.
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: 18 March 2024 | terms of use | © MGMcNally ]