The procedure in Illustration 140 maintains the sequence of static stochastic iteration and differs essentially in the use of substeps for connections instead of for routes. It is broken down into an external iteration for the connection search and an internal iteration for the connection choice and network loading.
Illustration 140: The procedure of dynamic stochastic assignment
