Heuristic algorithms for simulation-based dynamic traffic assignment

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.