Numerical experience with diagonalization algorithms for asymmetric demand traffic assignment

This paper reviews the concept of a diagonalization algorithm for use in solving traffic network equilibrium problems for which the arc cost and/or the origin-destination travel demand functions are asymmetric. Such functions are known to occur in realistic settings involving multiple modes or users. The computational performance of this algorithm for different degrees of travel demand asymmetry is then explored by a detailed numerical experiment since no previous results of this type have been reported. It is found that, through the use of progressive stopping tolerances, the impact of high degrees of travel demand function asymmetry on the computational burden associated with finding a traffic network equilibrium may be mitigated: in effect equilibrium problems with high degrees of demand asymmetry are little more difficult to solve than perfectly symmetric problems.