Simulation‐based dynamic traffic assignment: Meta‐heuristic solution methods with parallel computing

The aim of this study is to solve the large‐scale dynamic traffic assignment (DTA) model using a simulation‐based framework, which is computationally a challenging problem. Many studies have been performed on developing an efficient algorithm to solve DTA. Most of the existing algorithms are based o...

Full description

Saved in:
Bibliographic Details
Published in:Computer-aided civil and infrastructure engineering 2020-10, Vol.35 (10), p.1047-1062
Main Authors: Ameli, Mostafa, Lebacque, Jean‐Patrick, Leclercq, Ludovic
Format: Article
Language:English
Subjects:
Algorithms
Computer simulation
Equilibrium conditions
Genetic algorithms
Heuristic methods
Iterative methods
Parallel processing
Simulated annealing
Simulation
Solution space
Traffic assignment
Traffic models
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The aim of this study is to solve the large‐scale dynamic traffic assignment (DTA) model using a simulation‐based framework, which is computationally a challenging problem. Many studies have been performed on developing an efficient algorithm to solve DTA. Most of the existing algorithms are based on path‐swapping descent direction methods. From the computational standpoint, the main drawback of these methods is that they cannot be parallelized. This is because the existing algorithms need to know the results of the last iteration to determine the next best path flow for the next iteration. Thus, their performance depends on the single initial or intermediate solution, which means they exploit a solution that satisfies the equilibrium conditions more than explore the solution space for the optimal solution. More specifically, the goal of this study is to overcome the drawbacks of serial algorithms by using meta‐heuristic algorithms known to be parallelizable and that have never been applied to the simulation‐based DTA problem. This study proposes two new solution methods: a new extension of the simulated annealing and an adapted genetic algorithm. With parallel simulation, the algorithm runs more simulations in comparison with existing methods, but the algorithm explores the solution space better and therefore obtains better solutions in terms of closeness to the optimal solution and computation time compared to classical methods.
ISSN:1093-9687
1467-8667
DOI:10.1111/mice.12577