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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Si, Bing-Feng (Autor:in) / Zhong, Ming (Autor:in) / Zhang, Hao-Zhi (Autor:in) / Jin, Wen-Long (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.03.2010




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt





    On the probabilistic origin of dial's multipath traffic assignment model

    Florian, Michael / Fox, Bennett | Elsevier | 1976


    Dynamic traffic assignment model based on mixed-logit

    Maolu, Chen / Lingjuan, Chen / Zengqiang, Wang | IEEE | 2017


    C-Logit Stochastic System Optimum Traffic Assignment

    Yong, Gui / Xu, Yan | Springer Verlag | 2016


    Combined multinomial logit modal split and paired combinatorial logit traffic assignment model

    Wang, Jian / Peeta, Srinivas / He, Xiaozheng et al. | Taylor & Francis Verlag | 2018