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.
Heuristic algorithms for simulation-based dynamic traffic assignment
Transportmetrica ; 6 , 2 ; 97-120
2010-04-01
Article (Journal)
Electronic Resource
Unknown
An Heuristic Algorithm for Simulation-Based Dynamic Traffic Assignment
British Library Conference Proceedings | 2005
|Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator
British Library Conference Proceedings | 2006
|Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator
Online Contents | 2006
|An Heuristic Algorithm for Dynamic User-Optimal Assignment in Traffic Simulation Models
British Library Conference Proceedings | 2006
|