IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v32y2009i6p461-497.html
   My bibliography  Save this article

A model and solution algorithm for dynamic deterministic user equilibrium assignment

Author

Listed:
  • Jin-Su Mun

Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.

Suggested Citation

  • Jin-Su Mun, 2009. "A model and solution algorithm for dynamic deterministic user equilibrium assignment," Transportation Planning and Technology, Taylor & Francis Journals, vol. 32(6), pages 461-497, September.
  • Handle: RePEc:taf:transp:v:32:y:2009:i:6:p:461-497
    DOI: 10.1080/03081060903374668
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060903374668
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03081060903374668?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:transp:v:32:y:2009:i:6:p:461-497. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    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.