We present an algorithm which calculates a list of routes in a street network, approximating the flows given on the streets by traffic counts. We prove optimality with respect to maximizing the flows treating the counts as constraints and show that the algorithm can cope very well with missing data using a real motorway example.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Route estimation based on network flow maximization


    Beteiligte:

    Kongress:

    2018 ; Berlin


    Erschienen in:

    Erscheinungsdatum :

    2018-05-01


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Deutsch




    Route Flow Entropy Maximization in Origin-Based Traffic Assignment

    Bar-Gera, H. / Boyce, D. | British Library Conference Proceedings | 1999


    Network Capacity Maximization Using Route Choice and Signal Control With Multiple OD Pairs

    Wang, Shangbo / Li, Changle / Yue, Wenwei et al. | IEEE | 2020


    Regret Minimization and Utility Maximization Mixed Route Choice Model

    Sun, Chenran / He, Shiwei / Li, Yubin | British Library Conference Proceedings | 2020


    Regret Minimization and Utility Maximization Mixed Route Choice Model

    Sun, Chenran / He, Shiwei / Li, Yubin | TIBKAT | 2020


    Regret Minimization and Utility Maximization Mixed Route Choice Model

    Sun, Chenran / He, Shiwei / Li, Yubin | Springer Verlag | 2020