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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Heuristic algorithms for simulation-based dynamic traffic assignment


    Contributors:
    Tong, C.O. (author) / Wong, S.C. (author)

    Published in:

    Transportmetrica ; 6 , 2 ; 97-120


    Publication date :

    2010-04-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    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