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.
For a lower volume/capacity ratio, a similar result is achieved as with best-route assignment, because the route search does not find new routes. In this case it is recommended to use an incremental assignment with suitable parameters as initial solution or the Equilibrium_Lohse procedure.
The computation time of the equilibrium assignment depends 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.
