On incremental methods for traffic assignment

Author(s)
Ferland, J.A. Florian, M. & Achim, C.
Year
Abstract

The purpose of this note is a critical appraisal of incremental methods for traffic assignment. The main point which we develop is that incremental methods do not solve the minimization problem associated with computing an assignment that satisfies Wardrop's first extremal principle. We illustrate our conclusion with a simple counter example.

Request publication

4 + 11 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
B 9597 T /71 / IRRD 217137
Source

Transportation Research. 1975 /08. 9(4) Pp237-9 (2 Figs.; 18 Refs.)

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.