This unit of study aims to provide a comprehensive introduction to the mathematical representation, characterisation, analysis, and practical applications of transport networks. It covers the mathematical design of transport networks, the resolution of routing, matching, and other related combinatorial problems, and highlights key distinctions between public and private transport networks. Students will develop an understanding of algorithm efficiency, network economics, and concepts such as users' equilibrium and systems' optimum. The course employs a combination of lectures and tutorials. Students will design a public transport network using a representation of a real-life city in a semester-long group project. By the end of the course, students will know the fundamentals of networks theory and understand how to use it to model different transport systems.
Unit details and rules
Academic unit | Civil Engineering |
---|---|
Credit points | 6 |
Prerequisites
?
|
None |
Corequisites
?
|
None |
Prohibitions
?
|
None |
Assumed knowledge
?
|
CIVL2700 OR CIVL9700 |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Andres Fielbaum Schnitzler, andres.fielbaum@sydney.edu.au |
---|