Citation

Smith MJ. Transp. Res. B Methodol. 1983; 17(4): 291-303.

Copyright

(Copyright © 1983, Elsevier Publishing)

DOI

10.1016/0191-2615(83)90047-4

PMID

unavailable

Abstract

The paper considers the assignment problem when there are junction interactions. We give an objective function which measures the extent to which a traffic distribution departs from equilibrium, and an algorithm which (under certain conditions) calculates equilibria by steadily reducing the objective function to zero. It is shown that the algorithm certainly works if the network cost-flow function is monotone and continuously differentiable, and a boundary condition is satisfied.

Language: en