AN APPROACH TO DYNAMIC TRAFFIC ASSIGNMENT INCLUDING SOLUTION METHODS

Most of the previous dynamic traffic assignment models are Limited to single destination networks. The reason is that link exit functions of multiple destination flows are not formulated correctly. Since link e xit functions of multiple destination flows have been formulated by Li u and Kawakami (1993), the previous dynamic traffic assignment models can be improved from many aspects by the aid of the link exit function . In this paper, the constraint set of the dynamic traffic assignment problem is qualified first. The qualified constraint set can be applie d to any dynamic traffic assignment problem. Then a continuous dynamic system optimum model and a discrete dynamic system optimum model are presented. The model can be applied to dynamic traffic assignment for multiple destination networks. Furthermore, an algorithm is developed to solve the discrete model. Test examples show that the algorithm can solve the discrete model efficiently.