A Primal-Dual Traffic Assignment Algorithm

E. R. Petersen

33 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Complexity and Algorithms in Graphs Optimization and Mathematical Programming

Abstract

A new algorithm for solving the traffic assignment problem is presented. This is a primal-dual algorithm which utilizes a flow augmentation primal and a shortest path dual procedure. At each iteration a feasible solution is known together with a measure of “goodness” of the solution. It is shown that the algorithm converges to an optimal solution. Experience with the algorithm suggests that this convergence is very rapid.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 33 citations exist upstream.

References

1971An Extended Traffic Assignment Model with Applications to Two-Way Traffic 1963Some aspects of the urban traffic assignment problem

Cited by

1993A partial linearization method for the traffic assignment problem 2015Adaptation of Network Simplex for the Traffic Assignment Problem 2015Using Multi-Attribute Decision Factors for a Modified All-or-Nothing Traffic Assignment 2014Cost scaling based successive approximation algorithm for the traffic assignment problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.