Abstract
A general route-allocation model which minimized a measure of average customer delay is proposed for fixed- topology transportation networks. Except for special configurations, the formulation leads to a convex programming problem can also be incorporated. The model is of primary value in systems planning, before detailed scheduling is needed.