Abstract
An application of the equilibrium traffic assignment algorithm on a simplified highway network, such as might be used for sketch planning, is described. Analysis zones in the assignment are also substantially larger than in most conventional traffic assignments. The algorithm for equilibrium traffic assignment is introduced, followed by a discussion of the problems with equilibrium traffic assignment in a sketch-planning application. Next, the network coding procedures for the case study are examined. Results of the sketch-planning assignment are then evaluated against a comparable regional assignment of the same trips. Finally, there is a discussion of how this research fits into the programs of a transportation planning agency. (A)