Because the procedure only terminates when all routes of any OD pair are in the balanced state, the procedure provides more realistic results than the incremental procedure.
In the vast majority of networks, equilibrium assignment achieves the best computation times. The computation time of the equilibrium assignment depends largely on the volume/capacity ratio in the network. Because new routes can be found in every iteration step for a strongly saturated network, more computation time is required in this case.
Compared to stochastic assignment procedures (Stochastic assignment and Dynamic stochastic assignment), equilibrium assignment provides distinct network volumes. Compared to the number of calculated iterations, the gap is a more objective termination criterion.
Compared to other equilibrium methods (e.g., Bi-conjugate Frank-Wolfe or LUCE), more accurate solutions, i.e. small gaps, are possible with equilibrium assignment in many networks.
