Based on the Research of Simulation System of City Traffic Model

2013 ◽  
Vol 361-363 ◽  
pp. 2262-2265
Author(s):  
Pan Li He ◽  
Xin Xiao Dai ◽  
Xiao Wei Han
Keyword(s):  
Travel Time ◽  
Network Model ◽  
Road Network ◽  
Optimal Path ◽  
Major Elements ◽  
Simulation System ◽  
Traffic Model ◽  
Urban Network ◽  
Optimal Path Planning ◽  
Link Travel Time

In this paper, according to three major elements of road network "the collection of nodes, sections and the weight of road, established a combination model of static and dynamic of urban network based on graph theory. The model used the shortest travel time as the objective function for optimal path planning, focused on the analysis of link travel time, travel time is divided into free travel time of sections and intersection delay time to discuss and study. Finally, the Floyd algorithm was used to simulate this network model, in order to prove the effectiveness of the network model.

A Simplified Real-Time Road Network Model Considering Intersection Delay and its Application on Vehicle Navigation

2011 ◽  
Vol 58-60 ◽  
pp. 1959-1965 ◽  
Author(s):  
Zheng Yu Zhu ◽  
Wei Liu ◽  
Lin Liu ◽  
Ming Cui ◽  
Jin Yan Li
Keyword(s):  
Real Time ◽  
Network Model ◽  
Road Network ◽  
Intelligent Transportation System ◽  
Optimal Path ◽  
Network Models ◽  
Traffic Information ◽  
Vehicle Navigation ◽  
Traffic Data ◽  
New Model

The complexity of a real road network structure of a city and the variability of its real traffic information make a city’s intelligent transportation system (ITS) hard to meet the needs of the city’s vehicle navigation. This paper has proposed a simplified real-time road network model which can take into account the influence of intersection delay on the guidance for vehicles but avoid the calculation of intersection delay and troublesome collection of a city’s traffic data. Based on the new model, a navigation system has been presented, which can plan a dynamic optimal path for a vehicle according to the real-time traffic data received periodically from the city’s traffic center. A simulated experiment has been given. Compared with previous real-time road network models, the new model is much simpler and more effective on the calculation of vehicle navigation.

scholarly journals A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Kenetsu Uchida ◽  
Teppei Kato
Keyword(s):  
Travel Time ◽  
Network Model ◽  
Road Network ◽  
Choice Behavior ◽  
Risk Averse ◽  
Travel Time Reliability ◽  
Time Variance ◽  
Proposed Model ◽  
Risk Neutral ◽  
The Mean

This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows). In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.

scholarly journals Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 203
Author(s):  
Haitao Wei ◽  
Shusheng Zhang ◽  
Xiaohui He
Keyword(s):  
Network Model ◽  
Shortest Path ◽  
Road Network ◽  
Transportation Network ◽  
Optimal Path ◽  
Network Routing ◽  
Navigation Systems ◽  
Search Performance ◽  
Statistical Parameters ◽  
The Real

Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution.

scholarly journals System Optimum Fuzzy Traffic Assignment Problem

2019 ◽  
Vol 31 (6) ◽  
pp. 611-620
Author(s):  
Gizem Temelcan ◽  
Hale Gonce Kocken ◽  
Inci Albayrak
Keyword(s):  
Travel Time ◽  
Assignment Problem ◽  
Road Network ◽  
Traffic Assignment ◽  
Triangular Fuzzy Numbers ◽  
System Optimum ◽  
Average Speed ◽  
Traffic Assignment Problem ◽  
Path Lengths ◽  
Link Travel Time

This paper focuses on converting the system optimum traffic assignment problem (SO-TAP) to system optimum fuzzy traffic assignment problem (SO-FTAP). The SO-TAP aims to minimize the total system travel time on road network between the specified origin and destination points. Link travel time is taken as a linear function of fuzzy link flow; thus each link travel time is constructed as a triangular fuzzy number. The objective function is expressed in terms of link flows and link travel times in a non-linear form while satisfying the flow conservation constraints. The parameters of the problem are path lengths, number of lanes, average speed of a vehicle, vehicle length, clearance, spacing, link capacity and free flow travel time. Considering a road network, the path lengths and number of lanes are taken as crisp numbers. The average speed of a vehicle and vehicle length are imprecise in nature, so these are taken as triangular fuzzy numbers. Since the remaining parameters, that are clearance, spacing, link capacity and free flow travel time are determined by the average speed of a vehicle and vehicle length, they will be triangular fuzzy numbers. Finally, the original SO-TAP is converted to a fuzzy quadratic programming (FQP) problem, and it is solved using an existing approach from literature. A numerical experiment is illustrated.

Sign in / Sign up

Export Citation Format

Share Document