CEE 228A Urban Transportation Networks I -- Fall 2024 Notes

	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

Transportation Systems Analysis
Based on CEE 123/223

LP, OR, & Network Demos
Note: Links are to web sites maintained by others

Web: Search for LP Tutorial: numerous websites, pdfs, and videos are available
Jensen and Bard: OR Models and Methods (updated link)
Links below have not been checked:
Web: Dijkstra's Examples and Java Applet
Web: Floyd's Examples and Java Applet
Source: Interactive Dijkstra's [source code only]
Applet: Dijkstra's Applet [TUM]
Demo: Math Programming Demos
Demo: Dijkstra Demos
Demo: Data Structures & Algorithms
Web: OR Timeline

Transportation Networks I Notes
Notes will be updated / posted throughout the term.

Part I. Min Cost Flow Problems

CEE228a Slides (Part 1) [pdf]
CEE228a Slides (TSA Examples) [pdf]
CEE228a Slides (Feedback) [pdf]
Hitchcock Transportation Problem [pdf]
Network Fundamentals [pdf]
Transshipment Problems [pdf]
Minimum Path Problems [pdf] ; [Example ]
Demo: Dijkstra's Ex 1 ; Ex 2; Floyd's

Part II. Trip Assignment Problems

CEE228a Slides (Part 2) [pdf]
Trip Assignment: Theory & Models [pdf]
Trip Assignment: Heuristic Algorithms [pdf]
Trip Assignment: Example
Demo: UE via MSA (pop-up)
Demo: UE via Frank-Wolfe (pop-up)
Trip Assignment: Stochastic (Dial's) [pdf]
Demo: Dial's Algorithm (pop-up)
Trip Assignment: Variable Demand [pdf]
Example: Frank-Wolfe Example [pdf]
Trip Assignment: Algorithm Comparison [pdf]

CEE 228A Notes

[ back to top ]

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