返回
Simulation-based dynamic traffic assignment: Meta-heuristic solution methods with parallel computing
DOI:10.1111/mice.12577.png)
摘要
En 中文
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.
Keyword:
PATH-BASED ALGORITHM
SHORTEST-PATH
LARGE-SCALE
EQUILIBRIUM ASSIGNMENT
SUCCESSIVE AVERAGES
EFFICIENT ALGORITHM
OPTIMIZATION
MODEL
NETWORKS
CONVERGENCE
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
9.1
论文数:
2.0K
被引数:
10.0K
机构
引用论文
On the Convergence of the Method of Successive Averages for Calculating Equilibrium in Traffic Networks关于交通网络中计算平衡的连续平均方法的收敛性

