Traffic Network Equilibrium

Course Syllabus
January – April 2019
Timings: Mon and Wed 9:15 - 10:45 AM
Location: Center for infrastructure, Sustainable Transportation and Urban Planning (CiSTUP)

This page contains lecture slides and assignments for ‘CE 272 Traffic Network Equilibrium’. Data for the programming project and LaTeX resources are also posted here.

Lectures

  1. Introduction

  2. Review of Convex Optimization - Part I

  3. Review of Convex Optimization - Part II

  4. Fixed Point Theorems and Variational Inequalities

  5. Notation and Shortest Path Algorithms

  6. Wardrop User Equilibrium and Beckmann Formulation

  7. System Optimum, Price of Anarchy, and Congestion Pricing

  8. Method of Successive Averages

  9. Frank-Wolfe Algorithm

  10. Connections with Potential Games

  11. Traffic Assignment with Elastic Demand - Part I

  12. Traffic Assignment with Elastic Demand - Part II

  13. Multi-Class User Equilibrium - Part I

  14. Multi-Class User Equilibrium - Part II

  15. Bicriterion Shortest Paths

  16. Bicriterion Traffic Assignment

  17. System Optimum Bicriterion Traffic Assignment - Part I

  18. System Optimum Bicriterion Traffic Assignment - Part II

  19. Overview of other TAP Variants (20 March)

  20. Path Flows and Gradient Projection (25 March)

  21. Entropy Maximization (27 March)

Assignments

  1. Assignment 1

  2. Assignment 2

  3. Assignment 3

  4. Assignment 4

  5. Assignment 5 (Due March 20)

  6. Programming Task 1

  7. Programming Task 2

  8. Programming Task 3 (Due March 31)

Resources

LaTeX

https://en.wikibooks.org/wiki/LaTeX
https://www.sharelatex.com/

Network data

https://github.com/bstabler/TransportationNetworks