AN APPROACH TO DYNAMIC TRAFFIC ASSIGNMENT INCLUDING SOLUTION METHODS

Shogo Kawakami and Zhengkai Liu

Papers in Regional Science, 1997, vol. 76, issue 3, 357-369

Abstract: ABSTRACT 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.

Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1435-5597.1997.tb00697.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:presci:v:76:y:1997:i:3:p:357-369

Access Statistics for this article

Papers in Regional Science is currently edited by Jouke van Dijk

More articles in Papers in Regional Science from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().