• Project Report Format Requirements
  
  
• PROJECT 1: Tromaville AGT System [pdf]
  This project involves an initial formulation stage that must be completed independently. The first few questions deal with the path-based formulation and the last few deal with the link-based formulation. Don't over-exert yourselves with grunt work -- take the time to be sure that you understand the techniques.
  
  
• Project 1 Due Date: TBD but at or prior to midterm


• PROJECT 2:
  Write a paper or develop a slide presentation for a topic relevant to this course. You can not choose a topic that is already covered in the course. If you do not select one of the sample topics listed, please seek my topic approval before starting your work.
  1. Comparison/Estimation/Documentation of Advanced Link Performance Functions
  2. Methods to Introduce Turn Penalties in Shortest Path Algorithms
  3. Vine-based Path Algorithms
  4. Evaluation of Heap, Bucket, and Other Advanced Data Structures
  5. Review and Evaluation of Network Design Algorithms
  6. Path-based versus Link-based Algorithms
  7. Origin-based versus Link-based Algorithms
  8. Bi- and n-conjugate Frank-Wolfe Algorithms
  9. Dynamic Traffic Assignment
  10. Variational Inequality Formulations
  11. Multiple User Class Assignment
  12. Transit Assignment

Projects must be pre-approved but can be a paper, a software application with documentation, or a Powerpoint presentation (the latter will not be presented but will be linked to the web site for class review). If a proposed project overlaps with class material, then it must be extended to more advanced topics.