Dynamic Traffic Network Based Multi-Modal Travel Mode Fusion Recommendation

2021 ◽  
pp. 299-317
Author(s):  
Nannan Jia ◽  
Mengmeng Chang ◽  
Zhiming Ding ◽  
Zunhao Liu ◽  
Bowen Yang ◽  
...  
Keyword(s):  
Traffic Network ◽  
Dynamic Traffic ◽  
Travel Mode

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.

Analysis of Dynamic Impedance Functions in Urban Traffic Flow Guidance System

2012 ◽  
Vol 238 ◽  
pp. 503-506 ◽  
Author(s):  
Zhi Cheng Li
Keyword(s):  
Traffic Flow ◽  
Network Model ◽  
Large Scale ◽  
Choice Model ◽  
Transportation Systems ◽  
Urban Traffic ◽  
Guidance System ◽  
Traffic Network ◽  
Dynamic Traffic ◽  
Run Time

The successful application of Intelligent Transportation Systems (ITS) depends on the traffic flow at any time with high-precision and large-scale assessments, it is necessary to create a dynamic traffic network model to evaluate and forecast traffic. Dynamic route choice model sections of the run-time function are very important to the dynamic traffic network model. To simplify the dynamic traffic modeling, improve the calculation accuracy and save computation time, the flow on the section of the interrelationship between the exit flow and number of vehicles are analyzed, a run-time functions into the flow using only sections of the said sections are established.

scholarly journals Distributed Dynamic Traffic Modeling and Implementation Oriented Different Levels of Induced Travelers

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yan Liu ◽  
Yao Yu
Keyword(s):  
Traffic Management ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Distributed Model ◽  
Traffic Network ◽  
Dynamic Traffic ◽  
Assignment Method ◽  
Proposed Model ◽  
Network Operation ◽  
Different Levels

In order to respond to the variable state of traffic network in time, a distributed dynamic traffic assignment strategy is proposed which can improve the intelligent traffic management. The proposed dynamic assignment method is based on utility theory and is oriented to different levels of induced users. A distributed model based on the marginal utility is developed which combines the advantages of both decentralized paradigm and traveler preference, so as to provide efficient and robust dynamic traffic assignment solutions under uncertain network conditions. Then, the solution algorithm including subroute update and subroute calculation is proposed. To testify the effectiveness of the proposed model in optimizing traffic network operation and minimizing traveler’s cost on different induced levels, a sequence numerical experiment is conducted. In the experiment, there are two test environments: one is in different network load conditions and the other is in different deployment coverage of local agents. The numerical results show that the proposed model not only can improve the running efficiency of road network but also can significantly decrease the average travel time.

scholarly journals A modification of local path marginal cost on the dynamic traffic network

2014 ◽  
Vol 22 (1) ◽  
pp. 12-19 ◽  
Author(s):  
Zheng-feng Huang ◽  
Gang Ren ◽  
Li-li Lu ◽  
Yang Cheng
Keyword(s):  
Marginal Cost ◽  
Traffic Network ◽  
Dynamic Traffic ◽  
Local Path
Sign in / Sign up

Export Citation Format

Share Document