scholarly journals The Analysis of Braess’ Paradox and Robustness Based on Dynamic Traffic Assignment Models

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Bai-Bai Fu ◽  
Chun-Xue Zhao ◽  
Shu-bin Li

The investigation of the paradox and robustness about the traffic network is an important branch of the traffic assignment. In this paper, Braess’ paradox and robustness of the dynamic traffic network are analyzed by the dynamic traffic assignment models. In addition, the relationship of total costs with different traffic assignment models is discussed. The results show that the paradox only occurs in certain range; the robustness of the network and the relationship of total traffic costs are changed as the traffic demand changes, which provides theoretical guidance for the urban transportation planning.

2011 ◽  
Vol 31 (4) ◽  
pp. 521-545 ◽  
Author(s):  
Luc Wismans ◽  
Eric Van Berkum ◽  
Michiel Bliemer

2010 ◽  
Vol 143-144 ◽  
pp. 1240-1244 ◽  
Author(s):  
Lin Zhang ◽  
Zhao Sheng Yang ◽  
Hong Mei Jia ◽  
Bin Wang

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.


2014 ◽  
Vol 587-589 ◽  
pp. 2040-2044
Author(s):  
Lu Zhang

At the beginning the paper summarizes the research status,models and algorithms of dynamic traffic assignment and analyzes the relationship between dynamic user optimal model and variational inequality.Secondly,a dynamic user optimal model of traffic assignment based on optimal signal timing is established,equivalent model of the variational inequality is built at the same time.Finally,we discuss the superiority of the model and apply this model to a simple example,the results show that the model can improve the network performance significantly.


Sign in / Sign up

Export Citation Format

Share Document