Corrigendum to “Methods for analyzing road network bottleneck and bottleneck chain corridor under disastrous events using graph theory” [Saf. Sci. 118 (2019) 925–932]

2020 ◽  
Vol 121 ◽  
pp. 697
Author(s):  
Qi-kai Qu ◽  
Fu-jian Chen ◽  
Xiao-jian Zhou
Keyword(s):  
2017 ◽  
Vol 8 (15) ◽  
pp. 259-267
Author(s):  
محسن مصطفی ◽  
شعبان شتایی جویباری ◽  
مجید لطفعلیان ◽  
امیر سعدالدین ◽  
◽  
...  

2010 ◽  
Vol 2 (6) ◽  
pp. 86-89
Author(s):  
Oksana Musyt ◽  
Oksana Nadtochij ◽  
Aleksandr Stepanchiuk ◽  
Andrej Beljatynskij

An intensive increase in road transport, particularly individual, in recent years has led to such consequences as increased time spent on travel, the number of forced stops, traffic accidents, the occurrence of traffic jams on the road network, reducing traffic speed and a deteriorated urban road network in cities. The most effective method for solving these problems is the use of graph theory, the main characteristics of which is reliability, durability and accessibility of a free as well as loaded network. Based on their analysis the methods for network optimization are proposed.


Author(s):  
Evgeny P. Dudkin ◽  
◽  
Abujwaid Husam Abbas Mohsin ◽  
Leonid A. Losin ◽  
◽  
...  

The transport network of cities can be represented as a complex of streets and passages, as well as elements of public transport infrastructure unconnected with the street and road network. It is reasonable to represent the real network in the form of a simplified network based on graph theory to analyze the properties of the transport network. There are various methods of network connectivity assessment, including those based on various indices. According to all indicators in the street and road network of the city of Petrozavodsk it is necessary to increase the number of units. The implementation of recommendations for changes of the street and road network of the city of Petrozavodsk will reduce traffic congestion, the number of accidents and transport expenses. It is recommended to use the proposed method to assess and improve the street and road network of cities.


2019 ◽  
Vol 24 (2) ◽  
pp. 131-138 ◽  
Author(s):  
Mhnd Farhan

Abstract Nobody in this world wants to be held hostage in a traffic jam for hours and hours. The need to have efficient traffic flow in our roads cannot be overemphasized. It is in this understanding that this paper delves into the study and implementation of a suitable algorithm for traffic routing. The implementation is based on graph theory, where a road network map is first converted to a graph with nodes and edges where the edges represent the roads and the nodes represent the various road intersections. The roads are given various weights depending on their distance and traffic density, and the time a motorist would take to move from one point to another is estimated. A suitable routing algorithm, which in this case is the Dijkstra’s algorithm is applied on the weighted graph.


2012 ◽  
Vol 22 (1) ◽  
pp. 23-27 ◽  
Author(s):  
Tamas Berta ◽  
Ádám Török

The main scope of this paper is to present the formulation and visualization of shortening travel time in road transport due to the improvement of road network in Hungary. The formulation of the travel time based model has been developed by the authors. The paper also presents the demonstration of the results. The approach followed is quite innovatory in terms of visualization. The travel times were taken into account as opposed to geographical distances. Also, graph theory is used in order to calculate the matrix of “travel time” distances. The data from more than 30 cities were included in the model so as to make it quite representative for Hungary. KEYWORDS: road transportation, reduction of travel time, positive external effect


Sign in / Sign up

Export Citation Format

Share Document