Fundamentals of transportation network analysis, including graph representations of transportation networks, shortest path search algorithms, static traffic assignment and user equilibrium, and dynamic traffic assignment. Focus on how basic mathematical analysis tools such as linear and nonlinear programming can be used to analyze transportation network problems. The objective of this course is to introduce students to transportation network analysis fundamentals so that they are equipped with basic skills to analyze related problems in this area.
Spring | Summer | Fall | ||
---|---|---|---|---|
(Session 1) | (Session 2) | |||
2023 | ||||
2022 | ||||
2021 | ||||
2020 | ||||
2019 |
Trans Network Analysis (3c)
|
|||
2018 | ||||
2017 |
Trans Network Analysis (3c)
|
|||
2016 |
Trans Network Analysis (3c)
|
|||
2015 | ||||
2014 |
Trans Network Analysis (3c)
|
|||
2013 |
Trans Network Analysis (3c)
|
|||
2012 | ||||
2011 | ||||
2010 |
Transportation Algorithms (3c)
|
|||
2009 |
Transportation Algorithm (3c)
|
|||
2008 | ||||
2007 | ||||
2006 | ||||
2005 |
Transportation Algorithm (3c)
|
|||
2004 | ||||
2003 |
Transportation Algorithm (3c)
|
|||
2002 | ||||
2001 | ||||
2000 | ||||
1999 |
Transportation Algorithm (3c)
|
|||
1998 |