Important announcement

Dear visitor,

Please note that this OpenCourseWare platform will be replaced at the end of 2026 by a new platform (under the same url ocw.tudelft.nl).

Courses and their contents that are currently available the platform will partly be migrated. URL’s for this content will change and content might be unavailable for some time. In addition, some courses will not be available anymore.

If you are linking to specific courses on this platform (for instance for your students), please take timely measures to avoid problems with access. Possible actions are:

  • Download the materials to your local platform (laptop, server)
  • For educators only (including TU Delft lecturers): Contact us at ocw@tudelft.nl and inform us what course you are using in what context (institute, program, period of use, number of students). We will research (in collaboration with the authors of the course) and decide if we will migrate the course, and if yes, can supply you with a new url.

Thank you.

6. Uncongested assignment

6. Uncongested assignment

Uncongested assignment, or simply assignment, is the topic of this lecture. The assignment determines the route choice, given travel demand and infrastructure supply. The shortest path method, which was already introduced in lecture 1, returns in this lecture. Two assignment types are highlighted and discussed:

  • Type 1: All-or-nothing (AON) assignment
  • Type 2: Stochastic assignment

Both types do not model congestion effects, because this is done in lecture 7. The all-or-nothing assignment type is used in case only one route is modelled, while stochastic assignment is used when multiple routes are modelled.

Back to top
[sg_popup id=6]