IAON - Iterated All or Nothing traffic assignment algorithm
Assigns the flow with the Iterated All or Nothing heuristic. Starting with a feasible flow assigned with AON the link costs are calculated with the travel time functions. The AON assignment is made now with the computed costs and then the costs are recomputed for the new assignment. This process is repeated until there is no change in the recalculated costs or the number of iterations k is reached.
The matrix ben contains intermediary informations on the algorithm. For each iteration it gives the iteration number, time spent, cost, memory used and an convergence error evaluation.
net=TrafficExample('Small');
[f,ta,ben]=IAON(net,10)