On scaling time dependent shortest path computations for Dynamic Traffic Assignment

2014 ◽  
Author(s):  
Amit Gupta ◽  
Weijia Xu ◽  
Kenneth Perrine ◽  
Dennis Bell ◽  
Natalia Ruiz-Juri
Keyword(s):  
Shortest Path ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Time Dependent ◽  
Dynamic Traffic ◽  
Path Computations

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.

scholarly journals A simulation-based dynamic traffic assignment model with combined modes

2014 ◽  
Vol 26 (1) ◽  
pp. 65-73 ◽  
Author(s):  
Meng Meng ◽  
Chunfu Shao ◽  
Jingjing Zeng ◽  
Chunjiao Dong
Keyword(s):  
Simulation Model ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Transportation Network ◽  
Time Dependent ◽  
Dynamic Traffic ◽  
Mesoscopic Simulation ◽  
Assignment Model ◽  
Management Measures ◽  
Private Car

This paper presents a dynamic traffic assignment (DTA) model for urban multi-modal transportation network by con­structing a mesoscopic simulation model. Several traffic means such as private car, subway, bus and bicycle are con­sidered in the network. The mesoscopic simulator consists of a mesoscopic supply simulator based on MesoTS model and a time-dependent demand simulator. The mode choice is si­multaneously considered with the route choice based on the improved C-Logit model. The traffic assignment procedure is implemented by a time-dependent shortest path (TDSP) al­gorithm in which travellers choose their modes and routes based on a range of choice criteria. The model is particularly suited for appraising a variety of transportation management measures, especially for the application of Intelligent Trans­port Systems (ITS). Five example cases including OD demand level, bus frequency, parking fee, information supply and car ownership rate are designed to test the proposed simulation model through a medium-scale case study in Beijing Chaoy­ang District in China. Computational results illustrate excel­lent performance and the application of the model to analy­sis of urban multi-modal transportation networks.

scholarly journals A Strategic Model for Dynamic Traffic Assignment

2004 ◽  
Vol 4 (3) ◽  
pp. 291-315 ◽  
Author(s):  
Younes Hamdouch ◽  
Patrice Marcotte ◽  
Sang Nguyen
Keyword(s):  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Dynamic Traffic ◽  
Strategic Model
Sign in / Sign up

Export Citation Format

Share Document