AbstractThe aim of this study is to establish a method to calculate good quality user equilibrium assignments under time varying conditions. For this purpose, it introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it shows a novel route-based solution algorithm. This novel algorithm turns out to be convenient and logically plausible compared to the conventional [Frank, M., Wolfe, P., 1956. An algorithm for quadratic programming. Naval Research Logistics Quarterly 3, 95–110] algorithm, because the former does not require evaluation of an objective function and it finds solutions maintaining correct flow propagation in the time-varying network conditions. The application of novel dynamic network loading method and solution algorithm to test networks shows that we can find high quality dynamic user equilibrium assignment. This is illustrated in an example network using the deterministic queuing model for a link performance function and associating costs and flows in a predictive way in discrete time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A route-based solution algorithm for dynamic user equilibrium assignments


    Contributors:

    Published in:

    Publication date :

    2007-01-01


    Size :

    20 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Calculation of dynamic traffic equilibrium assignments

    Heydecker, B. / Verlander, N. / Association for European Transport | British Library Conference Proceedings | 1999


    Formulations of Extended Logit Stochastic User Equilibrium Assignments

    Bekhor, S. / Prashker, J. N. | British Library Conference Proceedings | 1999