scholarly journals A modified multilevel k-way partitioning algorithm for trip-based road networks

2019 ◽  
Vol 272 ◽  
pp. 01038
Author(s):  
C Withanage ◽  
D Lakmal ◽  
M Hansini ◽  
K Kankanamge ◽  
Y Witharanage ◽  
...  
Keyword(s):  
Urban Areas ◽  
Road Network ◽  
Road Networks ◽  
Optimal Number ◽  
Network Partitioning ◽  
Network Graph ◽  
Urban Road ◽  
The Road ◽  
Partitioning Algorithm ◽  
Traffic Systems

In today’s world, the traffic volume on urban road networks is multiplying rapidly due to the heavy usage of vehicles and mobility on demand services. Migration of people towards urban areas result in increasing size and complexity of urban road networks. When handling such complex traffic systems, partitioning the road network into multiple sub-regions and managing the identified sub regions is a popular approach. In this paper, we propose an algorithm to identify sub-regions of a road network that exhibit homogeneous traffic flow patterns. In a stage wise manner, we model the road network graph by using taxi-trip data obtained on the selected region. Then, we apply the proposed modified multilevel kway partitioning algorithm to obtain optimal number of partitions from the developed road graph. An interesting feature of this algorithm is, resulting partitions are geographically connected and consists minimal interpartition trip flow. Our results show that the proposed algorithm outperforms state-of-the-art multilevel partitioning algorithms for tripbased road networks. By this research, we demonstrate the ability of road network partitioning using trip data while preserving the partition homogeneity and connectivity.

scholarly journals Impact of Road Network Topology on Public Transportation Development

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Minzhi Chen ◽  
Fan Wu ◽  
Min Yin ◽  
Jiangang Xu
Keyword(s):  
Public Transportation ◽  
Road Network ◽  
Road Networks ◽  
Urban Road Network ◽  
Urban Road ◽  
The Road ◽  
Layout Structure ◽  
Per Capita ◽  
Transportation Development ◽  
The Impact

Planning of road networks is fundamental for public transportation. The impact of road network density on public transportation has been extensively studied, but few studies in this regard involved evaluation indicators for connectivity and layout of road networks. With 29 cities in China as the study cases, this paper quantifies the layout structure of the road network based on the network’s betweenness centralization and establishes a multivariate linear regression model to perform regression of the logarithm of the frequency of per capita public transportation on betweenness centralization. It is found in the present work that there is a significant correlation between the layout structure of an urban road network and the residents’ utilization degree of public transportation. A greater betweenness centralization of the urban road network, namely a more centralized road network, means a higher frequency of per capita public transportation of urban residents and a higher degree of the residents’ utilization of public transportation. In the development of public transportation, centralized and axial-shaped layout structures of road networks can be promoted to improve the utilization of public transportation.

PEAK HOUR FACTOR AT URBAN ROAD NETWORK SYSTEM WITH FIXED HOURLY INTERVAL AND MOVING HOURLY INTERVAL (A CASE STUDY AT URBAN ROAD IN CIMAHI CITY)

2020 ◽  
Vol 6 (01) ◽  
pp. 29
Author(s):  
Hendra Hendrawan
Keyword(s):  
Urban Areas ◽  
Road Network ◽  
Resource Constraints ◽  
Important Variable ◽  
Network System ◽  
Urban Road Network ◽  
Hourly Interval ◽  
Urban Road ◽  
The Road

The Peak Hour Factor (PHF) is an important variable for determining road capacity. The value of PHF will vary greatly depending on location characteristics and classification of road functions. This study aims to obtain the estimated value of PHF in the urban road network system with variations in the classification of functions and types of roads. In addition this study also aims to obtain a method of approaching the PHF value near to fluctuations in traffic flow which has limited resources for surveys based on the duration specified in the traffic survey guidelines in Indonesia. The method used is descriptive statistical analysis and parametric test using Independent T sample test. The PHF is calculated based on Fixed Hourly Interval and Moving Hourly Interval and their inverse. The results of the study show the value of PHF in the road network system in urban areas for variations function and type of road that is in the range of 0.79 to 0.98 with an average of 0.91. Other findings show that the inverse method of Moving Hourly Interval can be used as an approach to obtain the PHF value under conditions of resource constraints

Influence Models of Urban Road Network Operation Performance Base on Spatial Autocorrelation Theory

2012 ◽  
Vol 253-255 ◽  
pp. 1922-1929
Author(s):  
Jian Cheng Weng ◽  
Wen Jie Zou ◽  
Jian Rong
Keyword(s):  
Spatial Autocorrelation ◽  
Road Network ◽  
Road Networks ◽  
Operation Performance ◽  
Urban Road Network ◽  
Spatial Characteristics ◽  
Urban Road ◽  
The Road ◽  
Network Operation ◽  
The Impact

In order to better identify the spatial influence between adjacent parts of road networks, the paper introduces the spatial autocorrelation theory in evaluating the operation performance of urban road networks. The research proposes several spatial correlation validation indicators to verify the spatial characteristics among the road networks. Based on the analysis of spatial characteristics, the relationship between operation performance and influencing factors under the impact of spatial effect is examined. Furthermore, a spatial autocorrelation based influence models at three traffic flow levels is developed by using the data from a partial urban road network in Beijing. The model analysis shows that the spatial autocorrelation model is more effective in analyzing the urban road network operation performance under the influence of various factors. This model will be beneficial in identifying traffic network problems and improving traffic operations of the urban road network.

scholarly journals OPTIMAL CONTROL WITH THE DYNAMIC CHANGE OF THE STRUCTURE OF THE ROAD NETWORK

Transport ◽  
2014 ◽  
Vol 29 (1) ◽  
pp. 36-42 ◽  
Author(s):  
Zsuzsanna Bede ◽  
Tamás Péter
Keyword(s):  
Optimal Control ◽  
Road Network ◽  
Road Traffic ◽  
Dynamic Change ◽  
Time Of Day ◽  
Traffic Density ◽  
Special Method ◽  
Network Graph ◽  
The Road ◽  
Traffic Systems

Optimization of traffic on a large public road network is a complex task. Reversible direction lane theory is an interesting and special method within this subject. This can completely support the fluctuation or alteration of main congested directions existing in the traffic dynamics (time of day, seasonal, etc.) on the existing road surfaces. In such case, certain subsystems of the main network cease to exist, and subsystems working with new connections take their place. This type of routing therefore changes the structure of the system ‘in an optimal direction’, but many practical and safety questions arise. The authors have examined the modelling of a Reversible Lane System (RLS) created based on a simple part of a road network, which is segmented into elements. Functions of each network element and contacts between them cease operating in the course of such change while new contacts and new function elements are activated instead. The article presents the mathematical modelling of the problem. It points out the fundamental questions of the structure change and exemplifies the above using a simple example. The authors studied a general mathematical model describing the RLS. They examined the availability of the optimal control in a sample network depending on the traffic density, using a new principle, which responds to the dynamic change of the structure of the network graph. It can be shown, that the results from the model are in harmony with the real traffic values based on measurements made in road traffic systems working with RLS.

scholarly journals Mining Topological Dependencies of Recurrent Congestion in Road Networks

2021 ◽  
Vol 10 (4) ◽  
pp. 248
Author(s):  
Nicolas Tempelmeier ◽  
Udo Feuerhake ◽  
Oskar Wage ◽  
Elena Demidova
Keyword(s):  
Network Topology ◽  
Real World ◽  
Public Transportation ◽  
Road Network ◽  
Road Networks ◽  
Traffic Load ◽  
Data Mining Algorithm ◽  
Urban Road ◽  
The Road ◽  
Spatio Temporal

The discovery of spatio-temporal dependencies within urban road networks that cause Recurrent Congestion (RC) patterns is crucial for numerous real-world applications, including urban planning and the scheduling of public transportation services. While most existing studies investigate temporal patterns of RC phenomena, the influence of the road network topology on RC is often overlooked. This article proposes the ST-Discovery algorithm, a novel unsupervised spatio-temporal data mining algorithm that facilitates effective data-driven discovery of RC dependencies induced by the road network topology using real-world traffic data. We factor out regularly reoccurring traffic phenomena, such as rush hours, mainly induced by the daytime, by modelling and systematically exploiting temporal traffic load outliers. We present an algorithm that first constructs connected subgraphs of the road network based on the traffic speed outliers. Second, the algorithm identifies pairs of subgraphs that indicate spatio-temporal correlations in their traffic load behaviour to identify topological dependencies within the road network. Finally, we rank the identified subgraph pairs based on the dependency score determined by our algorithm. Our experimental results demonstrate that ST-Discovery can effectively reveal topological dependencies in urban road networks.

scholarly journals Urban Road Network Emergency: An Integrative Vulnerability Identification Method

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Huaikun Xiang
Keyword(s):  
Network Traffic ◽  
Road Network ◽  
Road Networks ◽  
Likelihood Method ◽  
Survey Method ◽  
Urban Road Network ◽  
Urban Road ◽  
The Road ◽  
Identification Method ◽  
The Impact

The vulnerability of an urban road network is affected by many factors, such as internal road network layout, network structure strength, and external destructive events, which have great uncertainty and complexity. Thus, there is still no unified and definite vulnerability analysis scheme available to cities. This paper proposes an integrative vulnerability identification method for urban road networks, which mainly relates to the vulnerability connotation and characteristics analysis of urban road networks during emergency, and vulnerability comprehensive evaluation indices design based on urban road network connectivity, traffic efficiency and performance, and an empirical study on a vulnerability identification method of an urban road network. In the empirical case, a real road network and traffic operation data were used from Science and Technology Park of Shenzhen City, China. In the context of one certain emergency scenario, the stated preference survey method and maximum likelihood method are used to solve the road users’ random travel choice behavior parameters; subsequently, based on the traffic equilibrium distribution prediction, the traffic vulnerability identification methods of the road network in this region were verified before and after the emergency. The method presented here not only considers the impact of network topology changes on road network traffic function during emergency but also considers the impact of dynamic changes in road network traffic demand on vulnerability; therefore, it is closer to the actual distribution of urban road network traffic vulnerability.

scholarly journals The Evolution and Growth Patterns of the Road Network in a Medium-Sized Developing City: A Historical Investigation of Changchun, China, from 1912 to 2017

2019 ◽  
Vol 11 (19) ◽  
pp. 5307 ◽  
Author(s):  
Shiguang Wang ◽  
Dexin Yu ◽  
Mei-Po Kwan ◽  
Huxing Zhou ◽  
Yongxing Li ◽  
...  
Keyword(s):  
Road Network ◽  
Temporal Evolution ◽  
Road Networks ◽  
Small World ◽  
Growth Patterns ◽  
Data Availability ◽  
Urban Road ◽  
The Road ◽  
And Function ◽  
Over Time

Understanding the evolution and growth patterns of urban road networks helps to design an efficient and sustainable transport network. The paper proposed a general study framework and analytical workflow based on network theory that could be applied to almost any city to analyze the temporal evolution of road networks. The main tasks follow three steps: vector road network drawing, topology graph generation, and measure classification. Considering data availability and the limitations of existing studies, we took Changchun, China, a middle-sized developing city that is seldom reported in existing studies, as the study area. The research results of Changchun (1912–2017) show the road networks sprawled and densified over time, and the evolution patterns depend on the historical periods and urban planning modes. The evolution of network scales exhibits significant correlation; the population in the city is well correlated with the total road length and car ownership. Each network index also presents specific rules. All road networks are small-world networks, and the arterial roads have been consistent over time; however, the core area changes within the adjacent range but is generally far from the old city. More importantly, we found the correlation between structure and function of the urban road networks in terms of the temporal evolution. However, the temporal evolution pattern shows the correlation varies over time or planning modes, which had not been reported

scholarly journals Approximative Network Partitioning for MFDs from Stationary Sensor Data

2019 ◽  
Vol 2673 (6) ◽  
pp. 94-103 ◽  
Author(s):  
Lukas Ambühl ◽  
Allister Loder ◽  
Nan Zheng ◽  
Kay W. Axhausen ◽  
Monica Menendez
Keyword(s):  
Large Scale ◽  
Road Networks ◽  
Sensor Data ◽  
Network Partitioning ◽  
Fundamental Diagram ◽  
The Road ◽  
Traffic Sensors ◽  
Optimal Network ◽  
Partitioning Algorithm ◽  
Large Scale Networks

The macroscopic fundamental diagram (MFD) measures network-level traffic performance of urban road networks. Large-scale networks are normally partitioned into homogeneous regions in relation to road network topology and traffic dynamics. Existing partitioning algorithms rely on unbiased data. Unfortunately, widely available stationary traffic sensors introduce a spatial bias and may fail to identify meaningful regions for MFD estimations. Thus, it is crucial to revisit and develop stationary-sensor-based partitioning algorithm. This paper proposes an alternative two-step partitioning algorithm for MFD estimations based on information collected solely from stationary sensors. In a first step, possible partitioning outcomes are generated in the road networks using random walks. In a second step, the regions’ MFDs are estimated under every possible partitioning outcome. Based on previous work, an indicator is proposed to evaluate the traffic heterogeneity in regions. The proposed partitioning approach is tested with an abstract grid network and empirical data from Zurich. In addition, the results are compared with an algorithm that disregards stationary detectors’ biases. The results demonstrate that the proposed approach performs well for obtaining the quasi-optimal network partitions yielding the lowest heterogeneity among all possible partition outcomes. The presented approach not only complements existing literature, but also offers practice-oriented solutions for transport authorities to estimate the MFDs with their available data.

scholarly journals Optimizing The Functional Performance of Road Network using Vulnerability Assessment to Cope with Unforeseen Road Incidents

2021 ◽  
pp. 67-80
Author(s):  
Mukhammad Rizka Fahmi Amrozi ◽  
Raihan Pasha Isheka
Keyword(s):  
Road Network ◽  
Functional Performance ◽  
Road Networks ◽  
Travel Speed ◽  
Vulnerability Index ◽  
Urban Road ◽  
The Road ◽  
Road Performance ◽  
Criticality Index ◽  
The Impact

An Urban Road network is often used for multipurpose trips, due to their transportation functions, such as attractiveness and orientation, as well as social, ecological, and economic features. In Indonesia, road incidents have reportedly increased during the last decade because of a higher frequency of natural hazards, accidents, and on-street mass demonstrations. These incidents are found to degrade or terminate road access, forcing users to utilize alternative routes and decreasing the service performance in adjacent directions. Due to the unexpected occurrences at any location and time, there is a need to investigate the impact of random incidents on road performances. Several accessibility indexes have also been used to evaluate the vulnerability of road networks. However, this is less practical in Indonesia, with the road authority using functional performances as the indicator. This indicates the need for an index to be developed based on road performance parameters. Therefore, this study aims to develop a road performance-based vulnerability index known as the RCI (Road Criticality Index). Combined with a traffic simulation tool, this system is used as an alternative index to assess vulnerabilities, by identifying the road(s) providing worse consequences due to unforeseen incidents. This simulation was conducted by using the PTV Visum, assuming a road section is closed due to the worst incident scenarios. The result showed that the RCI offered a more comprehensive assessment than the existing indicator (volume capacity ratio). The RCI included travel speed and mobility components for evaluating both local and global road performances. With the knowledge of the most vulnerable locations and their consequences, road authorities can prioritize maintenance and development strategies based on the criticality index. Also, preventive measures should be conducted to mitigate risk under a constrained budget. This methodology can be applied to sustainably enhance the resilience of urban road networks.

scholarly journals Comprehensive Evaluation of Urban Road Network Resilience Facing Earthquakes

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Lin Gao ◽  
Mingzhen Wang ◽  
Anshuang Liu ◽  
Huafeng Gong
Keyword(s):  
Road Network ◽  
Evaluation Method ◽  
Comprehensive Evaluation ◽  
Road Networks ◽  
Urban Road Network ◽  
Urban Road ◽  
The Road ◽  
Whole Process ◽  
Node Importance ◽  
Research Goal

The road network’s transport capacity and traffic function will be directly reduced if urban roads are damaged by earthquakes. To effectively improve the resistance and recovery ability of urban road networks facing earthquake disasters, the establishment of an aseismic resilience evaluation method for the urban road network is the research goal. This paper’s novelty introduces the concept of engineering resilience into the aseismic performance evaluation of urban road networks. It reveals the internal influence principle of nodes and independent pathways on the aseismic resilience of the network. This paper’s significant contribution is to establish a reasonable and comprehensive urban road network aseismic resilience evaluation method. This method can realize the calculation of the aseismic resilience for the existing network, reconstruction network, and new network and propose the optimization, transformation, and layout for the network. The MATLAB program for the whole process calculation of aseismic resilience is developed. The overall network’s aseismic resilience is obtained by the sum of the product of the node importance and the average number of the reliable independent pathways.

Sign in / Sign up

Export Citation Format

Share Document