Traffic Network Equilibrium

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. Game Theory and Traffic Equilibria

3. Review of Convex Optimization - Part I

4. Review of Convex Optimization - Part II

5. Fixed Point Theorems and Variational Inequalities

6. Notation and Shortest Path Algorithms

7. Wardrop User Equilibrium and Beckmann Formulation

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

9. Method of Successive Averages

10. Frank-Wolfe Algorithm

11. Connections with Potential Games

12. Traffic Assignment with Elastic Demand - Part I

13. Traffic Assignment with Elastic Demand - Part II

14. Multi-Class User Equilibrium - Part I

15. Multi-Class User Equilibrium - Part II

16. Bicriterion Shortest Paths

17. Bicriterion Traffic Assignment

18. System Optimum Bicriterion Traffic Assignment - Part I

19. System Optimum Bicriterion Traffic Assignment - Part II

20. Overview of other TAP Variants

21. Path Flows and Gradient Projection

22. Entropy Maximization

23. Acyclic Graphs, Bushes, and Topological Ordering

24. Algorithm B - Part I

25. Algorithm B - Part II

26. Sensitivity Analysis - Part I

27. Sensitivity Analysis - Part II and Wrap-up

Assignments

1. Programming Task 1
   

2. Programming Task 2
   

3. Programming Task 3
   

4. Programming Task 4
   

Resources

LaTeX

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

Network data

https://github.com/bstabler/TransportationNetworks

Google Colab

https://research.google.com/colaboratory/