Abstract
A new solution technique for the equilibrium traffic assignment problem is described. As stated, the algorithm promises to be efficient for finding the equilibrium on a network with hundreds of nodes inasmuch as its most difficult computational requirements are identical to those of the iterated capacity restraint simulation models of traffic assignment currently used.