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.
On incremental methods for traffic assignment
19.08.1974
3 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Incremental equilibrium assignment and applications to traffic network model
Wiley | 2023
|Incremental equilibrium assignment and applications to traffic network model
DOAJ | 2023
|The Dilemma and Countermeasures of incremental assignment of network traffic flow
British Library Conference Proceedings | 2010
|The Dilemma and Countermeasures of incremental assignment of network traffic flow
British Library Conference Proceedings | 2010
|Traffic assignment by Mechanical Methods
Engineering Index Backfile | 1956