This study reviews and compares two heuristic algorithms: methods of successive averages and route swapping, which are commonly used in simulation-based dynamic traffic assignment models. A new hybrid algorithm that has the advantages of both algorithms is introduced. As finding a unique solution cannot be guaranteed, the concept of solution reliability is suggested for the formulation of convergence criterion. An example network is used to illustrate the method.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Heuristic algorithms for simulation-based dynamic traffic assignment


    Beteiligte:
    Tong, C.O. (Autor:in) / Wong, S.C. (Autor:in)

    Erschienen in:

    Transportmetrica ; 6 , 2 ; 97-120


    Erscheinungsdatum :

    01.04.2010




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    An Heuristic Algorithm for Simulation-Based Dynamic Traffic Assignment

    Mahut, M. / IEEE | British Library Conference Proceedings | 2005



    Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator

    Barcelo, J. / Casas, J. / National Research Council (U.S.) | British Library Conference Proceedings | 2006


    An Heuristic Algorithm for Dynamic User-Optimal Assignment in Traffic Simulation Models

    Mahut, M. / Association for European Transport | British Library Conference Proceedings | 2006