Resilience of Urban Street Network Configurations under Low Demands

Author(s):  
Zhengyao Yu ◽  
Vikash V. Gayah

Urban street networks are subject to a variety of random disruptions. The impact of movement restrictions (e.g., one-way or left-turn restrictions) on the ability of a network to overcome these disruptions—that is, its resilience—has not been thoroughly studied. To address this gap, this paper investigates the resilience of one-way and two-way square grid street networks with and without left turns under light traffic conditions. Networks are studied using a simplified routing algorithm that can be examined analytically and a microsimulation that describes detailed vehicle dynamics. In the simplified method, routing choices are enumerated for all possible origin–destination (OD) combinations to identify how the removal of a link affects operations, both when knowledge of the disruption is and is not available at the vehicle’s origin. Disruptions on two-way networks that allow left turns tend to have little impact on travel distances because of the availability of multiple shortest paths between OD pairs and the flexibility in route modification. Two-way networks that restrict left turns at intersections only have a single shortest-distance path between any OD pair and thus experience larger increases in travel distance, even when the disruption is known ahead of time. One-way networks sometimes have multiple shortest-distance routes and thus travel distances increase less than two-way network without left turns when links are disrupted. These results reveal a clear tradeoff between improved efficiency and reduced resilience for networks that have movement restrictions, and can be used as a basis to study network resilience under more congested scenarios and in more realistic network structures.

Author(s):  
Anthony J. DePrator ◽  
Owen Hitchcock ◽  
Vikash V. Gayah

The accommodation of left turns at signalized intersections plays a significant role in the overall operational efficiency of urban traffic networks. Allowing left turns in traditional ways (such as implementing protected, permitted, and protected–permitted phasing schemes) reduces available intersection capacity but provides vehicles the most direct routing options to reach their destinations. Prohibiting left turns allows simpler phasing plans but requires vehicles to travel longer distances. This paper uses macroscopic performance measures to quantify and compare the efficiency of urban grid networks when various left-turn treatments, including left-turn prohibitions, are implemented. The findings reveal that prohibiting left turns generally increases a network’s maximum trip completion rate, especially when trips are not very short; however, left-turn prohibitions reduce efficiency in very light or heavy traffic conditions. A dynamic strategy is proposed: left turns are allowed only during light traffic or heavy congestion and are prohibited for moderate congestion levels near capacity. This strategy allows the network to operate at the highest efficiency possible for any traffic accumulation. This strategy is identified and tested with analytical and simulation investigations of idealized grid networks. The results provide insight into how more realistic networks might be managed to maximize efficiency by changing only how left turns are treated at signalized intersections.


2000 ◽  
Vol 10 (01) ◽  
pp. 51-58 ◽  
Author(s):  
SVEN VENEMA ◽  
HONG SHEN ◽  
FRANCIS SURAWEERA

For a weighted, undirected graph G=(V, E) where |V|=n and |E|=m, we examine the single most vital edge with respect to all-pairs shortest paths (APSP) under two different measurements. The first measurement considers only the impact of the removal of a single edge from the APSP on the shortest distance between each vertex pair. The second considers the total weight of all the edges which make up the APSP, that is, calculate the sum of the distance between each vertex pair after the deletion of any edge belonging to a shortest path. We give a sequential algorithm for this problem, and show how to obtain an NC algorithm running in O( log n) time using mn2 processors and O(mn2) space on the MINIMUM CRCW PRAM. Given the shortest distance between each pair of vertices u and v, the diameter of the graph is defined as the longest of these distances. The Most vital edge with respect to the diameter is the edge lying on such a u–v shortest path which when removed causes the greatest increase in the diameter. We show how to modify the above algorithm to solve this problem using the same time and number of processors. Both algorithms compare favourably with the straightforward solution which simply recalculates the all pairs shortest path information.


2020 ◽  
Vol 53 (2) ◽  
pp. 14242-14247
Author(s):  
Arthur Le Rhun ◽  
Frédéric Bonnans ◽  
Giovanni De Nunzio ◽  
Thomas Leroy ◽  
Pierre Martinon

Author(s):  
Elise Henry ◽  
Angelo Furno ◽  
Nour-Eddin El Faouzi

Transport networks are essential for societies. Their proper operation has to be preserved to face any perturbation or disruption. It is therefore of paramount importance that the modeling and quantification of the resilience of such networks are addressed to ensure an acceptable level of service even in the presence of disruptions. The paper aims at characterizing network resilience through weighted degree centrality. To do so, a real dataset issued from probe vehicle data is used to weight the graph by the traffic load. In particular, a set of disrupted situations retrieved from the study dataset is analyzed to quantify the impact on network operations. Results demonstrate the ability of the proposed metrics to capture traffic dynamics as well as their utility for quantifying the resilience of the network. The proposed methodology combines different metrics from the complex networks theory (i.e., heterogeneity, density, and symmetry) computed on temporal and weighted graphs. Time-varying traffic conditions and disruptions are analyzed by providing relevant insights on the network states via three-dimensional maps.


2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Trung Kien Vu ◽  
Sungoh Kwon

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.


2021 ◽  
Vol 26 (5) ◽  
pp. 399-409
Author(s):  
M.A. Zapletina ◽  
◽  
S.V. Gavrilov ◽  
◽  

One of the main advantages of FPGA and CPLD is the high development speed; therefore, the importance of effective computer-aided design tools for modern microcircuits of these classes cannot be overestimated. Placement and routing are the most time-consuming stages of FPGA/CPLD design flow. The quality of results of these stages is crucial to the final perfor-mance of custom digital circuits implemented on FPGA/CPLD. The paper discusses an approach to accelerating the routing stage within the layout synthesis flow for FPGA/CPLD by introducing a few algorithmic improvements to a routing procedure. The basic routing algorithm under study is a modified Pathfinder for a mixed routing resource graph. Pathfinder is a well-known negotiation-based routing algorithm that works on the principle of iteratively eliminating congestions of chip routing resources. For experiments, the sets of test digital circuits ISCAS'85, ISCAS'89, LGSynth'89 and several custom industrial projects were used. The impact of the proposed algorithmic improvements was analyzed using four FPGA/CPLD architectures. It has been established that due to the improvements of the algorithm proposed in the paper, the average reduction in routing time was from 1.3 to 2.6 times, depending on the FPGA/CPLD architecture, with no significant negative effect on the timing characteristics of the designed circuits.


2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Qinrui Tang ◽  
Bernhard Friedrich

Urban road networks may benefit from left turn prohibition at signalized intersections regarding capacity, for particular traffic demand patterns. The objective of this paper is to propose a method for minimizing the total travel time by prohibiting left turns at intersections. With the flows obtained from the stochastic user equilibrium model, we were able to derive the stage generation, stage sequence, cycle length, and the green durations using a stage-based method which can handle the case that stages are sharing movements. The final output is a list of the prohibited left turns in the network and a new signal timing plan for every intersection. The optimal list of prohibited left turns was found using a genetic algorithm, and a combination of several algorithms was employed for the signal timing plan. The results show that left turn prohibition may lead to travel time reduction. Therefore, when designing a signal timing plan, left turn prohibition should be considered on a par with other left turn treatment options.


Sign in / Sign up

Export Citation Format

Share Document