Premium
AN APPROACH TO DYNAMIC TRAFFIC ASSIGNMENT INCLUDING SOLUTION METHODS
Author(s) -
Kawakami Shogo,
Liu Zhengkai
Publication year - 1997
Publication title -
papers in regional science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.937
H-Index - 64
eISSN - 1435-5957
pISSN - 1056-8190
DOI - 10.1111/j.1435-5597.1997.tb00697.x
Subject(s) - constraint (computer aided design) , computer science , mathematical optimization , set (abstract data type) , assignment problem , penalty method , dynamic network analysis , function (biology) , mathematics , computer network , geometry , evolutionary biology , biology , programming language
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 exit functions of multiple destination flows have been formulated by Liu 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 applied 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.