Real World Applications Using Parallel Computing Techniques in Dynamic Traffic Assignment and Shortest Path Search

2015 ◽  
Author(s):  
Alessandro Attanasi ◽  
Edmondo Silvestri ◽  
Pietro Meschini ◽  
Guido Gentile
Keyword(s):  
Parallel Computing ◽  
Shortest Path ◽  
Real World ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Dynamic Traffic ◽  
Real World Applications ◽  
Path Search ◽  
Shortest Path Search

A Parallel Calculation System for the Shortest Path in Traffic Network

2010 ◽  
Vol 143-144 ◽  
pp. 1240-1244 ◽  
Author(s):  
Lin Zhang ◽  
Zhao Sheng Yang ◽  
Hong Mei Jia ◽  
Bin Wang
Keyword(s):  
Shortest Path ◽  
Execution Time ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Traffic Network ◽  
Dynamic Traffic ◽  
Parallel Calculation ◽  
Network Decomposition ◽  
Decomposition Approach ◽  
Calculation System

The execution time of shortest path computing determines the efficiency and quality of dynamic traffic assignment. This paper focuses on the design of a parallel calculation system for the shortest path in traffic network aims to reduce the execution time of shortest path computing in dynamic traffic assignment. Here we mainly focus on the process of algorithm parallelization and network decomposition. As the core of the system, a two-queue parallel algorithm is designed for the shortest path in the traffic network which the recursive spectral bisection decomposition approach is employed to separate the network into several parts and the algorithm acts on every sub-network on each processor. The proposed system are experimented on real traffic network and a set of policies are employed that the number of processors is designed in each policy in the study case, and the performances of the parallel calculation system are discussed, the proposed algorithm is proved to be the efficient and effective.

Accelerating Traffic Assignment with Customizable Contraction Hierarchies

2020 ◽  
Vol 2674 (1) ◽  
pp. 188-196 ◽  
Author(s):  
Arne Schneck ◽  
Klaus Nökel
Keyword(s):  
Shortest Path ◽  
Traffic Assignment ◽  
Shortest Path Problem ◽  
Transport Modeling ◽  
The Past ◽  
Acceleration Techniques ◽  
Network Loading ◽  
Enormous Amount ◽  
Path Search ◽  
Shortest Path Search

In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conjugate Frank–Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra’s algorithm.

scholarly journals Large-scale, high-fidelity dynamic traffic assignment: framework and real-world case studies

2017 ◽  
Vol 25 ◽  
pp. 1290-1299 ◽  
Author(s):  
Qi Yang ◽  
Ramachandran Balakrishna ◽  
Daniel Morgan ◽  
Howard Slavin
Keyword(s):  
Case Studies ◽  
Real World ◽  
Large Scale ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
High Fidelity ◽  
Dynamic Traffic
Sign in / Sign up

Export Citation Format

Share Document