A Primal-Dual Traffic Assignment Algorithm

E. R. Petersen
Additional contact information
E. R. Petersen: Queen's University, Ontario

Management Science, 1975, vol. 22, issue 1, 87-95

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.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.1.87 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1975:i:1:p:87-95

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().