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

An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network

Author

Listed:
  • Bing-Feng Si
  • Ming Zhong
  • Hao-Zhi Zhang
  • Wen-Long Jin

Abstract

Dial's algorithm is one of the most effective and popular procedures for a logit-type stochastic traffic assignment, as it does not require path enumeration over a network. However, a fundamental problem associated with the algorithm is its simple definition of ‘efficient paths’, which sometimes produces unrealistic flow patterns. In this paper, an improved algorithm based on the route extension coefficient is proposed in order to circumvent this problem, in which ‘efficient paths’ simultaneously consider link travel cost and minimum travel cost. Path enumeration is still not required and a similar computing efficiency with the original algorithm is guaranteed. A limitation of the algorithm is that it can only be applied to a directed acyclic network because a topological sorting algorithm is used to decide the order of the sequential calculation. A numerical example based on the Beijing subway network illustrates the effectiveness of the proposed algorithm. It is found that it is able to exclude most unrealistic paths, but include all reasonable paths when compared with path enumeration and the original Dial's algorithm.

Suggested Citation

  • Bing-Feng Si & Ming Zhong & Hao-Zhi Zhang & Wen-Long Jin, 2010. "An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network," Transportation Planning and Technology, Taylor & Francis Journals, vol. 33(2), pages 123-137, January.
    • Handle: RePEc:taf:transp:v:33:y:2010:i:2:p:123-137
    DOI: 10.1080/03081061003643705
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081061003643705
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081061003643705?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Selin Damla Ahipaşaoğlu & Uğur Arıkan & Karthik Natarajan, 2019. "Distributionally Robust Markovian Traffic Equilibrium," Transportation Science, INFORMS, vol. 53(6), pages 1546-1562, November.
    2. Yu, Qian & Fang, Debin & Du, Wei, 2014. "Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model," European Journal of Operational Research, Elsevier, vol. 239(1), pages 112-118.
    3. Yi-Wen Kuo & Cheng-Hsien Hsieh & Cheng-Min Feng & Wen-Ya Yeh, 2013. "Effects of price promotions on potential consumers of high-speed rail," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(8), pages 722-738, December.

    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:33:y:2010:i:2:p:123-137. 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.