Premium
An algorithm for the traffic assignment problem
Author(s) -
Weintraub Andrés,
González Jaime
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100303
Subject(s) - disjoint sets , algorithm , set (abstract data type) , computer science , mathematical optimization , assignment problem , traffic flow (computer networking) , mathematics , discrete mathematics , computer security , programming language
An optimization algorithm for the traffic assignment problem is presented. It is based on determining, for the flow corresponding to each origin at a time, a set of disjoint circuits with the most negative total marginal cost, followed by a unidimensional optimization along these circuits. The proposed method was compared to other well known approaches on randomly generated networks. In most cases the proposed method proved to be highly efficient, particularly when appropriate tighter stopping rules were used. In this sense, it was seen that when stopping rules were based on insufficiently tight tolerances, substantial errors could appear in the equilibrium traffic assignment.