Demo - Traffic Assignment Static Equilibrium - Frank–Wolfe vs. Algorithm B
Current Selection Flow
Much slower for large networks if turn on Sensitivity
Frank-Wolfe is easier to code, consumes least memory, but converges slowly
Sioux-Falls Network has the same shortest free flow time for certain OD pairs; for example OD pair 1 to 11, 1->3->4->11, 1->3->12->11 are both legal. Depending on your implementation of shortest path algorithm, first couple of runs might yield different link flows. However when iterations increase, the results will converge to the same.
Turn on the sensitivity analysis will be much slower