Abstract
In the previous paper we have proposed two types of time-of-day traffic assignment models which can predict the hourly volume of traffic on each network link. In these models, however, the phenomenon of congestion over a network has not been treated explicitly enough.
In this paper we propose an improved time-of-day traffic assignment model which can describe the congestion queues at bottlenecks in a network more explicitly and realistically by introducing new link performance functions. It is shown that this new model can be reduced to the variational inequality and can be solved by the use of the iteration method developed by M. Smith.
