IDEAS home Printed from https://ideas.repec.org/a/bla/presci/v76y1997i3p357-369.html
   My bibliography  Save this article

An Approach To Dynamic Traffic Assignment Including Solution Methods

Author

Listed:
  • Shogo Kawakami
  • Zhengkai Liu

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.

Suggested Citation

  • Shogo Kawakami & Zhengkai Liu, 1997. "An Approach To Dynamic Traffic Assignment Including Solution Methods," Papers in Regional Science, Wiley Blackwell, vol. 76(3), pages 357-369, July.
    • Handle: RePEc:bla:presci:v:76:y:1997:i:3:p:357-369
    DOI: 10.1111/j.1435-5597.1997.tb00697.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1435-5597.1997.tb00697.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1435-5597.1997.tb00697.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:presci:v:76:y:1997:i:3:p:357-369. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=1056-8190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.