scholarly journals Examining the Road Networks and Locations of Firefighting Teams by Using GIS Techniques

2020 ◽  
pp. 173-180
Author(s):  
Taş İnanç ◽  
Akay Abdullah E.
Keyword(s):  
Response Time ◽  
Forest Fires ◽  
Road Network ◽  
Road Networks ◽  
Travel Speed ◽  
Effective Response ◽  
Critical Response ◽  
The Road ◽  
Gis Techniques ◽  
Optimum Route

For effective response to forest fires, the period of time necessary for the firefighting team to reach the fire site should not exceed the critical response time, where the fire is more likely to be taken under control. For this reason, the optimum route that allows the team to reach the fire site by a fire truck within the shortest time possible should be determined. Computer-aided methods such as the road network analysis are widely used in the solution of such transportation problems that require the shortest path analysis. In this study, the locations of the existing road networks and firefighting team were examined using GIS techniques in order to determine the optimum route that will provide the promptest access to the fire site. The study was carried out in the Adana Forest Enterprise Directorate, where first degree fire-sensitive forests are located. There are three firefighting teams located in the boundaries of the study area. The sites in the study area where previously occurred forest fires (15), which burned 1 ha or more forest areas, were evaluated as potential fire sites. The analysis results showed that 64,12% of the forest areas in the study area was reached by the firefighting teams within 20 minutes, which is the critical response time for first degree fire sensitive forests. It was found that the teams could reach 12 potential fire sites within the critical response time. This result revealed the necessity to establish new firefighting teams in the study area. In addition, it is thought that improving the road network density in the study area by building new roads or increasing the truck travel speed by improving the conditions of existing roads will help to solve the problem.

scholarly journals Critical Segments Identification for Link Travel Speed Prediction in Urban Road Network

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Xiaolei Ru ◽  
Xiangdong Xu ◽  
Yang Zhou ◽  
Chao Yang
Keyword(s):  
Information Acquisition ◽  
Prediction Accuracy ◽  
Road Network ◽  
Large Scale ◽  
Road Networks ◽  
Route Planning ◽  
Travel Speed ◽  
Traffic Information ◽  
Operational Conditions ◽  
The Road

Predicting traffic operational condition is crucial to urban transportation planning and management. A large variety of algorithms were proposed to improve the prediction accuracy. However, these studies were mainly based on complete data and did not discuss the vulnerability of massive data missing. And applications of these algorithms were in high-cost under the constraints of high quality of traffic data collecting in real-time on the large-scale road networks. This paper aims to deduce the traffic operational conditions of the road network with a small number of critical segments based on taxi GPS data in Xi’an city of China. To identify these critical segments, we assume that the states of floating cars within different road segments are correlative and mutually representative and design a heuristic algorithm utilizing the attention mechanism embedding in the graph neural network (GNN). The results show that the designed model achieves a high accuracy compared to the conventional method using only two critical segments which account for 2.7% in the road networks. The proposed method is cost-efficient which generates the critical segments scheme that reduces the cost of traffic information collection greatly and is more sensible without the demand for extremely high prediction accuracy. Our research has a guiding significance on cost saving of various information acquisition techniques such as route planning of floating car or sensors layout.

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 Modeling of Emergency Supply Scheduling Problem Based on Reliability and Its Solution Algorithm under Variable Road Network after Sudden-Onset Disasters

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15 ◽  
Author(s):  
Tinggui Chen ◽  
Shiwen Wu ◽  
Jianjun Yang ◽  
Guodong Cong ◽  
Gongfa Li
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Sudden Onset ◽  
The Road ◽  
Bee Colony ◽  
Proposed Model ◽  
Effectiveness And Efficiency ◽  
In Transit ◽  
Emergency Supply

It is common that many roads in disaster areas are damaged and obstructed after sudden-onset disasters. The phenomenon often comes with escalated traffic deterioration that raises the time and cost of emergency supply scheduling. Fortunately, repairing road network will shorten the time of in-transit distribution. In this paper, according to the characteristics of emergency supplies distribution, an emergency supply scheduling model based on multiple warehouses and stricken locations is constructed to deal with the failure of part of road networks in the early postdisaster phase. The detailed process is as follows. When part of the road networks fail, we firstly determine whether to repair the damaged road networks, and then a model of reliable emergency supply scheduling based on bi-level programming is proposed. Subsequently, an improved artificial bee colony algorithm is presented to solve the problem mentioned above. Finally, through a case study, the effectiveness and efficiency of the proposed model and algorithm are verified.

scholarly journals A Parallel-Computing Approach for Vector Road-Network Matching Using GPU Architecture

2018 ◽  
Vol 7 (12) ◽  
pp. 472 ◽  
Author(s):  
Bo Wan ◽  
Lin Yang ◽  
Shunping Zhou ◽  
Run Wang ◽  
Dezhi Wang ◽  
...  
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Graphics Processing Unit ◽  
Road Networks ◽  
Processing Unit ◽  
Data Partition ◽  
Matching Method ◽  
The Road ◽  
Central Processing ◽  
Relaxation Matching

The road-network matching method is an effective tool for map integration, fusion, and update. Due to the complexity of road networks in the real world, matching methods often contain a series of complicated processes to identify homonymous roads and deal with their intricate relationship. However, traditional road-network matching algorithms, which are mainly central processing unit (CPU)-based approaches, may have performance bottleneck problems when facing big data. We developed a particle-swarm optimization (PSO)-based parallel road-network matching method on graphics-processing unit (GPU). Based on the characteristics of the two main stages (similarity computation and matching-relationship identification), data-partition and task-partition strategies were utilized, respectively, to fully use GPU threads. Experiments were conducted on datasets with 14 different scales. Results indicate that the parallel PSO-based matching algorithm (PSOM) could correctly identify most matching relationships with an average accuracy of 84.44%, which was at the same level as the accuracy of a benchmark—the probability-relaxation-matching (PRM) method. The PSOM approach significantly reduced the road-network matching time in dealing with large amounts of data in comparison with the PRM method. This paper provides a common parallel algorithm framework for road-network matching algorithms and contributes to integration and update of large-scale road-networks.

scholarly journals Road Networks Winter Risk Estimation Using On-Board Uncooled Infrared Camera for Surface Temperature Measurements over Two Lanes

2011 ◽  
Vol 2011 ◽  
pp. 1-8 ◽  
Author(s):  
M. Marchetti ◽  
M. Moutton ◽  
S. Ludwig ◽  
L. Ibos ◽  
V. Feuillet ◽  
...  
Keyword(s):  
Data Analysis ◽  
Road Network ◽  
Risk Estimation ◽  
Risk Index ◽  
Road Networks ◽  
Infrared Camera ◽  
Atmospheric Parameters ◽  
The Road ◽  
Measurement Rate

Thermal mapping has been implemented since the late eighties to establish the susceptibility of road networks to ice occurrence with measurements from a radiometer and some atmospheric parameters. They are usually done before dawn during wintertime when the road energy is dissipated. The objective of this study was to establish if an infrared camera could improve the determination of ice road susceptibility, to build a new winter risk index, to improve the measurements rate, and to analyze its consistency with seasons and infrastructures environment. Data analysis obtained from the conventional approved radiometer sensing technique and the infrared camera has shown great similarities. A comparison was made with promising perspectives. The measurement rate to analyse a given road network could be increased by a factor two.

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.

Taxi Global Positioning System Data in Urban Road Network: A Methodology to Identify Key Road Clusters Based on Travel Speed–Traffic Volume Correlation

2021 ◽  
pp. 036119812110366
Author(s):  
Yi Li ◽  
Weifeng Li ◽  
Qing Yu ◽  
Han Yang
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Travel Speed ◽  
Detection Algorithm ◽  
Traffic Volume ◽  
Urban Traffic ◽  
Mitigation Strategies ◽  
Operating Characteristics ◽  
The Road ◽  
Road Segments

Urban traffic congestion is one of the urban diseases that needs to be solved urgently. Research has already found that a few road segments can significantly influence the overall operation of the road network. Traditional congestion mitigation strategies mainly focus on the topological structure and the transport performance of each single key road segment. However, the propagation characteristics of congestion indicate that the interaction between road segments and the correlation between travel speed and traffic volume should also be considered. The definition is proposed for “key road cluster” as a group of road segments with strong correlation and spatial compactness. A methodology is proposed to identify key road clusters in the network and understand the operating characteristics of key road clusters. Considering the correlation between travel speed and traffic volume, a unidirectional-weighted correlation network is constructed. The community detection algorithm is applied to partition road segments into key road clusters. Three indexes are used to evaluate and describe the characteristic of these road clusters, including sensitivity, importance, and IS. A case study is carried out using taxi GPS data of Shanghai, China, from May 1 to 17, 2019. A total of 44 key road clusters are identified in the road network. According to their spatial distribution patterns, these key road clusters can be classified into three types—along with network skeletons, around transportation hubs, and near bridges. The methodology unveils the mechanism of congestion formation and propagation, which can offer significant support for traffic management.

scholarly journals Analysis of Traffic Evolution on Road Networks of a Roundabout

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Tolesa Hundesa Muleta ◽  
Legesse Lemecha Obsu
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Road Networks ◽  
Point Of View ◽  
Traffic Dynamics ◽  
Demand And Supply ◽  
The Road ◽  
On The Road ◽  
Detailed Mathematical Analysis ◽  
Control Traffic

In this paper, the analyses of traffic evolution on the road network of a roundabout having three entrances and three exiting legs are conducted from macroscopic point of view. The road networks of roundabouts are modeled as a merging and diverging types 1×2 and 2×1 junctions. To study traffic evolution at junction, two cases have been considered, namely, demand and supply limited cases. In each case, detailed mathematical analysis and numerical tests have been presented. The analysis in the case of demand limited showed that rarefaction wave fills the portion of the road network in time. In the contrary, in supply limited case, traffic congestion occurs at merging junctions and shock wave propagating back results in reducing the performance of a roundabout to control traffic dynamics. Also, we illustrate density and flux profiles versus space discretization at different time steps via numerical simulation with the help of Godunov scheme.

scholarly journals A Privacy-Preserving Location-Based System for Continuous Spatial Queries

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Doohee Song ◽  
Kwangjin Park
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Nearest Neighbors ◽  
Privacy Preserving ◽  
Spatial Queries ◽  
The Road ◽  
Mobile Clients ◽  
Previous Location

K-anonymization generated a cloaked region (CR) that was K-anonymous; that is, the query issuer was indistinguishable from K-1 other users (nearest neighbors) within the CR. This reduced the probability of the query issuer’s location being exposed to untrusted parties (1/K). However, location cloaking is vulnerable to query tracking attacks, wherein the adversary can infer the query issuer by comparing the two regions in continuous LBS queries. This paper proposes a novel location cloaking method to resist this attack. The target systems of the proposed method are road networks where the mobile clients’ trajectories are fixed (the road network is preknown and fixed, instead of the trajectories), such as subways, railways, and highways. The proposed method, called adaptive-fixed K-anonymization (A-KF), takes this issue into account and generates smaller CRs without compromising the privacy of the query issuer’s location. Our results show that the proposed A-KF method outperforms previous location cloaking methods.

scholarly journals Continuous Anonymity with Users in the Same Direction in Road Networks

2018 ◽  
Vol 220 ◽  
pp. 10001
Author(s):  
Yu Lili ◽  
Zhang Lei ◽  
Su Xiaoguang ◽  
Li Jing ◽  
Zhang Xu ◽  
...  
Keyword(s):  
Euclidean Space ◽  
Privacy Protection ◽  
Road Network ◽  
Location Privacy ◽  
Road Networks ◽  
The Road ◽  
Shortest Distance ◽  
Location Privacy Protection ◽  
Road Segments

Compared with the Euclidean space, road network is restricted by its direction in traveling, velocity and some other attribute profiles. So the algorithms that designed for the Euclidean space are usually invalid and difficult to provide privacy protection services. In order to cope with this problem, we have proposed an algorithm to provide the service of collecting anonymous users that their directions in traveling similar with the initiator in the road networks. In this algorithm, the shortest distance between multiple road segments is calculated, and then utilizes the distance to select the user who has the same direction in traveling with the initiator. Consequently, the problem of the discrepancy of the anonymous users in the routing that invalidates the location privacy protection is solved. At last, we had compared this algorithm with other similar algorithms, and through the results of the comparison and the cause of this phenomenon, we have concluded that this algorithm is better not only in the level of privacy protection, but in the performance of execution efficiency.

Sign in / Sign up

Export Citation Format

Share Document