Global climate change is intensifying the impact of slope hazards,particularly rainfall-induced landslide hazards(RILH),on mountain road networks(MRNs).However,effective quantitative models for dynamically assessing M...Global climate change is intensifying the impact of slope hazards,particularly rainfall-induced landslide hazards(RILH),on mountain road networks(MRNs).However,effective quantitative models for dynamically assessing MRNs vulnerability under RILH disturbances are still lacking.To bridge this gap,this study develops a Cascading Failure Model for Rainfall-Induced Landslide Hazard(CFM-RILH).Validation via a case study of the GarzêTibetan Autonomous Prefecture Road Network(GTPRNs)reveals key characteristics of MRNs system vulnerability under RILH disturbances:(1)Under the disturbance effects of RILH,the vulnerability of the MRNs system follows a nonlinear phase transition law that intensifies with increasing disturbance intensity,exhibiting a distinct critical threshold.When the disturbance intensity exceeds this threshold,the system undergoes a global cascading failure phenomenon analogous to an“avalanche.”(2)Under RILH disturbances,the robustness of the MRNs system possesses a distinct safety boundary.Exceeding this boundary not only fails to improve hazard resistance but instead substantially elevates the risk of large-scale cascading failure.(3)Increasing network redundancy may be considered one of the primary engineering measures for enhancing MRNs resilience against such disturbances.Based on these findings,we propose a“Two-Stage Emergency Response and Hierarchical Fortification”strategy specifically to improve the resilience of GTPRNs impacted by RILH.The CFM-RILH model provides an effective tool for assessing road network vulnerability under such hazards.Furthermore,its modeling framework can also inform vulnerability assessment and resilience strategy development for road networks affected by other types of slope hazards.展开更多
The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicl...The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.展开更多
The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are a...The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.展开更多
In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic i...In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.展开更多
Before the emergence of modern modes of transport, the traditional road infra structure was the major historical means of carrying out nationwide socioeconomic exchange However, the history of transport infrastructure...Before the emergence of modern modes of transport, the traditional road infra structure was the major historical means of carrying out nationwide socioeconomic exchange However, the history of transport infrastructure has received little attention from researchers. Given this background, the work reported here examined the longterm development of transport networks in China. The national road network was selected for study and the 3500 years from 1600 BC to 1900 AD was chosen as the study period. Indicators were designed for the maturity level of road networks and an accessibility model was developed for the paths of the shortest distance. The evolution of the road network in China since the Shang Dynasty （1600 BC） was described and its major features were summarized to reveal longterm regu larities. The maturity level of the road network and its accessibility was assessed and regions with good and poor networks were identified. The relationship between China＇s natural, social and economic systems and the road network were discussed. Our analysis shows that the road network in China has a number of longterm regularities. The continuously expanding road network follows a path of inland expansion especially towards the border areas. How ever, its coverage and accessibility are characterized by a coreperipheral configuration, which has close relationships with, not only the natural conditions, but also national defense and warfare. The centralization of national power, national land governance, postal transport, the transport of specialized cargos, and international trade are also related to the develop ment of the road network. This research draws attention to the evolving regularities of trans port networks.展开更多
We investigated forest road networks and forestry operations before and after mechanization on aggregated forestry operation sites. We developed equations to estimate densities of road networks with average slope angl...We investigated forest road networks and forestry operations before and after mechanization on aggregated forestry operation sites. We developed equations to estimate densities of road networks with average slope angles, operational efficiency of bunching operations with road network density, and average forwarding distances with operation site areas. Subsequently, we analyzed the effects of aggregating forests, establishing forest road networks, and mechanization on operational efficiency and costs. Six ha proved to be an appropriate operation site area with minimum operation expenses. The operation site areas of the forest owners＇ cooperative in this region aggregated approximately 6 ha and the cooperative conducted forestry operations on aggregated sites. Therefore, 6 ha would be an appropriate operation site area in this region. Regarding road network density, higher-density road networks increased operational expenses due to the higher direct operational expenses of strip road establishment. Therefore, road network density should be reduced to approximately 200 m.展开更多
In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refe...In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.展开更多
In this paper,we propose a new method to achieve automatic matching of multi-scale roads under the constraints of smaller scale data.The matching process is:Firstly,meshes are extracted from two different scales road ...In this paper,we propose a new method to achieve automatic matching of multi-scale roads under the constraints of smaller scale data.The matching process is:Firstly,meshes are extracted from two different scales road data.Secondly,several basic meshes in the larger scale road network will be merged into a composite one which is matched with one mesh in the smaller scale road network,to complete the N∶1(N>1)and 1∶1 matching.Thirdly,meshes of the two different scale road data with M∶N(M>1,N>1)matching relationships will be matched.Finally,roads will be classified into two categories under the constraints of meshes:mesh boundary roads and mesh internal roads,and then matchings between the two scales meshes will be carried out within their own categories according to the matching relationships.The results show that roads of different scales will be more precisely matched using the proposed method.展开更多
In this paper, platoons of autonomous vehicles operating in urban road networks are considered. From a methodological point of view, the problem of interest consists of formally characterizing vehicle state trajectory...In this paper, platoons of autonomous vehicles operating in urban road networks are considered. From a methodological point of view, the problem of interest consists of formally characterizing vehicle state trajectory tubes by means of routing decisions complying with traffic congestion criteria. To this end, a novel distributed control architecture is conceived by taking advantage of two methodologies: deep reinforcement learning and model predictive control. On one hand, the routing decisions are obtained by using a distributed reinforcement learning algorithm that exploits available traffic data at each road junction. On the other hand, a bank of model predictive controllers is in charge of computing the more adequate control action for each involved vehicle. Such tasks are here combined into a single framework:the deep reinforcement learning output(action) is translated into a set-point to be tracked by the model predictive controller;conversely, the current vehicle position, resulting from the application of the control move, is exploited by the deep reinforcement learning unit for improving its reliability. The main novelty of the proposed solution lies in its hybrid nature: on one hand it fully exploits deep reinforcement learning capabilities for decisionmaking purposes;on the other hand, time-varying hard constraints are always satisfied during the dynamical platoon evolution imposed by the computed routing decisions. To efficiently evaluate the performance of the proposed control architecture, a co-design procedure, involving the SUMO and MATLAB platforms, is implemented so that complex operating environments can be used, and the information coming from road maps(links,junctions, obstacles, semaphores, etc.) and vehicle state trajectories can be shared and exchanged. Finally by considering as operating scenario a real entire city block and a platoon of eleven vehicles described by double-integrator models, several simulations have been performed with the aim to put in light the main f eatures of the proposed approach. Moreover, it is important to underline that in different operating scenarios the proposed reinforcement learning scheme is capable of significantly reducing traffic congestion phenomena when compared with well-reputed competitors.展开更多
The Gorkha earthquake in Nepal led to many landslides and severe damage to the transportation infrastructure. After careful comparison of the aerial photographs and satellite images before and after the earthquake, pa...The Gorkha earthquake in Nepal led to many landslides and severe damage to the transportation infrastructure. After careful comparison of the aerial photographs and satellite images before and after the earthquake, partially verified by a field study, more than 2,064 landslides and many road failures were observed. Many bridges, especially steel-truss and suspension bridges, suffered little damage from inertia loads during the earthquake, but were severely damaged due to rockfalls. Potential geological hazards hindered the delivery of supplies in mountainous areas, and road closures impeded the overall speed of rehabilitation.展开更多
In this research we proposed a strategy for location privacy protection which addresses the issues related with existing location privacy protection techniques. Mix-Zones and pseudonyms are considered as the basic bui...In this research we proposed a strategy for location privacy protection which addresses the issues related with existing location privacy protection techniques. Mix-Zones and pseudonyms are considered as the basic building blocks for location privacy; however, continuously changing pseudonyms process at multiple locations can enhance user privacy. It has been revealed that changing pseudonym at improper time and location may threat to user's privacy. Moreover, certain methods related to pseudonym change have been proposed to attain desirable location privacy and most of these solutions are based upon velocity, GPS position and direction of angle. We analyzed existing methods related to location privacy with mix zones, such as RPCLP, EPCS and MODP, where it has been observed that these methods are not adequate to attain desired level of location privacy and suffered from large number of pseudonym changes. By analyzing limitations of existing methods, we proposed Dynamic Pseudonym based multiple mix zone(DPMM) technique, which ensures highest level of accuracy and privacy. We simulate our data by using SUMO application and analysis results has revealed that DPMM outperformed existing pseudonym change techniques and achieved better results in terms of acquiring high privacy with small number of pseudonym change.展开更多
In recent years, a few researches focus on the similarity measure of semantic trajectories in road networks, since semantic trajectories in road networks have smaller volumes, higher qualities and can better reflect u...In recent years, a few researches focus on the similarity measure of semantic trajectories in road networks, since semantic trajectories in road networks have smaller volumes, higher qualities and can better reflect user behaviors. However, these works do not further discuss how to efficiently search similar trajectories. Thus, to implement an efficient similarity search, we design an index called SIET based on the structures of road networks. Then, we propose a novel algorithm called SSN-BF to search similar trajectories efficiently by using best-first strategy. At last, we take the experimental evaluations on real dataset and prove the efficiency of our algorithm.展开更多
A novel technique called the bitmap lattice index(BLI) is proposed, which combines the advantages of a wireless broadcasting environment with a road network. Existing road networks are based on the on-demand method: a...A novel technique called the bitmap lattice index(BLI) is proposed, which combines the advantages of a wireless broadcasting environment with a road network. Existing road networks are based on the on-demand method: a server's workload increases as the query request increases when a server sends a client information. To solve this problem, we propose the BLI. The BLI denotes an object and a node as 0 and 1 in the Hilbert curve(HC) map. The BLI can identify the position of a node and an object through bit information; it can also reduce the broadcasting frequency of a server by reducing the size of the index, thereby decreasing the access latency and query processing times. Moreover, the BLI is highly effective for data filtering, as it can identify the positions of both an object and a node. In a road network, if filtering is done via the Euclidean distance, it may result in an error. To prevent this, we add another validation procedure. The experiment is conducted by applying the BLI to kNN query, and the technique is assessed by a performance evaluation experiment.展开更多
As a disaster prevention measure based on self-assistance and mutual assistance,disaster prevention maps are being created with citizen participation throughout Japan.The process of creating disaster prevention maps i...As a disaster prevention measure based on self-assistance and mutual assistance,disaster prevention maps are being created with citizen participation throughout Japan.The process of creating disaster prevention maps is itself a disaster prevention measure that contributes to raising awareness of disaster prevention by promoting exchange and cooperation within the region.By focusing on relations between road networks and hazardous elements,we developed a system to support disaster prevention map creation that visualizes roads at high risk during a disaster and facilitates the study of evacuation simulations.This system leads to a completed disaster prevention map in three phases.In the first phase,we use a device with GPS logging functions to collect information related to hazardous elements.In the second phase,we use Google Maps(“online map,”below)to visualize roads with high evacuation risk.In the final phase,we perform a regional evaluation through simulations of disaster-time evacuations.In experimental verifications,by conducting usability tests after creating a disaster prevention map in the target area,we evaluated the system in terms of simple operability and visibility.We found that by implementing this series of processes,even users lacking specialized knowledge regarding disaster prevention can intuitively discover evacuation routes while considering the relations between visualized road networks and hazardous elements.These results show that compared with disaster prevention maps having simple site notations using existing WebGIS systems,disaster prevention maps created by residents while inspecting the target area raise awareness of risks present in the immediate vicinity even in normal times and are an effective support system for prompt disaster prevention measures and evacuation drills.展开更多
Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the m...Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the most fundamental operations of road networks computation.To alleviate privacy concerns about location privacy leaks during road distance computation,it is desirable to have a secure and efficient road distance computation approach.In this paper,we propose two secure road distance computation approaches,which can compute road distance over encrypted data efficiently.An approximate road distance computation approach is designed by using Partially Homomorphic Encryption and road network set embedding.An exact road distance computation is built by using Somewhat Homomorphic Encryption and road network hypercube embedding.We implement our two road distance computation approaches,and evaluate them on the real cityscale road network.Evaluation results show that our approaches are accurate and efficient.展开更多
Nowadays,location-based services are widely used,requiring instant responses to a large volume of multiple spatial queries over massive road networks,i.e.,single-pair shortest path(SPSP)query,k-nearest neighbor(kNN)qu...Nowadays,location-based services are widely used,requiring instant responses to a large volume of multiple spatial queries over massive road networks,i.e.,single-pair shortest path(SPSP)query,k-nearest neighbor(kNN)query,and range query.Creating index-based structure for each kind of query is costly,hence it is important to handle multiple spatial queries within one efficient structure.Partition-based hierarchical approaches show promising potential to meet the requirement.However,existing approaches require large search space on massive road networks especially for long-distance queries,which is inefficient and hard to scale.To overcome the drawbacks,we propose the shortcut-enhanced graph hierarchy tree(SCG-tree),which leverages shortcuts to effectively prune the search space over a hierarchical structure.With the SCG-tree,a pruned shortcut-based method is designed to answer SPSP query,and a two-phase expansion strategy is proposed to leverage shortcuts for kNN and range queries.Theoretical analyses show the superiority of proposed shortcut-based query algorithms.Extensive experiments demonstrate that our approach can achieve three times speedup for kNN query and an order of magnitude speedup for SPSP and range queries over existing methods on real road networks that scale up to 24 million nodes and 58 million edges.展开更多
Privacy preservation has recently received considerable attention for location-based mobile services. A lot of location cloaking approaches focus on identity and location protection, but few algorithms pay attention t...Privacy preservation has recently received considerable attention for location-based mobile services. A lot of location cloaking approaches focus on identity and location protection, but few algorithms pay attention to prevent sensitive information disclosure using query semantics. In terms of personalized privacy requirements, all queries in a cloaking set, from some user＇s point of view, are sensitive. These users regard the privacy is breached. This attack is called as the sensitivity homogeneity attack. We show that none of the existing location cloaking approaches can effectively resolve this problem over road networks. We propose a （K, L, P）-anonymity model and a personalized privacy protection cloaking algorithm over road networks, aiming at protecting the identity, location and sensitive information for each user. The main idea of our method is first to partition users into different groups as anonymity requirements. Then, unsafe groups are adjusted by inserting relaxed conservative users considering sensitivity requirements. Finally, segments covered by each group are published to protect location information. The efficiency and effectiveness of the method are validated by a series of carefully designed experiments. The experimental results also show that the price paid for defending against sensitivity homogeneity attacks is small.展开更多
Traffic congestion in road transportation networks is a persistent problem in major metropolitan cities around the world.In this context,this paper deals with exploiting underutilized road capacities in a network to l...Traffic congestion in road transportation networks is a persistent problem in major metropolitan cities around the world.In this context,this paper deals with exploiting underutilized road capacities in a network to lower the congestion on overutilized links while simultaneously satisfying the system optimal flow assignment for sustainable transportation.Four congestion mitigation strategies are identified based on deviation and relative deviation of link volume from the corresponding capacity.Consequently,four biobjective mathematical programming optimal flow distribution(OFD)models are proposed.The case study results demonstrate that all the proposed models improve system performance and reduce congestion on high volume links by shifting flows to low volumeto-capacity links compared to UE and SO models.Among the models,the system optimality with minimal sum and maximum absolute relative-deviation models(SO-SAR and SO-MAR)showed superior results for different performance measures.The SO-SAR model yielded 50%and 30%fewer links at higher link utilization factors than UE and SO models,respectively.Also,it showed more than 25%improvement in path travel times compared to UE travel time for about 100 paths and resulted in the least network congestion index of1.04 compared to the other OFD and UE models.Conversely,the SO-MAR model yielded the least total distance and total system travel time,resulting in lower fuel consumption and emissions,thus contributing to sustainability.The proposed models contribute towards efficient transportation infrastructure management and will be of interest to transportation planners and traffic managers.展开更多
In this paper, we discuss some fundamental properties of two idealized typical networks, namely, grid type and radial-circular type. The discussion is based on SPCP （Shortest Path Counting Problem）, which reflects t...In this paper, we discuss some fundamental properties of two idealized typical networks, namely, grid type and radial-circular type. The discussion is based on SPCP （Shortest Path Counting Problem）, which reflects the traffic density of a road segment. Furthermore, we compare their effectiveness based on the obtained results of the above two road networks, and suggest some proposals on the design of car lanes by considering the direction of a road segment in relation to these road networks.展开更多
Recent development of wireless communication technologies and the popularity of smart phones .are making location-based services （LBS） popular. However, requesting queries to LBS servers with users＇ exact locations...Recent development of wireless communication technologies and the popularity of smart phones .are making location-based services （LBS） popular. However, requesting queries to LBS servers with users＇ exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an efficient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query （k-NN） processing algorithms for a query region in road networks. To efficiently retrieve k-NN points of interest （POIs）, we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor （kRNN） algorithm in terms of network expansion cost and query processing time.展开更多
基金financially supported by the National Key R&D Program of China(2024YFE0111900)The National Natural Science Foundation of China(U2468214,52378370,52278372)+1 种基金The National Ten Thousand Talent Program for Young Top-notch Talents(2022QB04978)The Science and Technology Program of Hebei Province(2023HBQZYCSB004)。
文摘Global climate change is intensifying the impact of slope hazards,particularly rainfall-induced landslide hazards(RILH),on mountain road networks(MRNs).However,effective quantitative models for dynamically assessing MRNs vulnerability under RILH disturbances are still lacking.To bridge this gap,this study develops a Cascading Failure Model for Rainfall-Induced Landslide Hazard(CFM-RILH).Validation via a case study of the GarzêTibetan Autonomous Prefecture Road Network(GTPRNs)reveals key characteristics of MRNs system vulnerability under RILH disturbances:(1)Under the disturbance effects of RILH,the vulnerability of the MRNs system follows a nonlinear phase transition law that intensifies with increasing disturbance intensity,exhibiting a distinct critical threshold.When the disturbance intensity exceeds this threshold,the system undergoes a global cascading failure phenomenon analogous to an“avalanche.”(2)Under RILH disturbances,the robustness of the MRNs system possesses a distinct safety boundary.Exceeding this boundary not only fails to improve hazard resistance but instead substantially elevates the risk of large-scale cascading failure.(3)Increasing network redundancy may be considered one of the primary engineering measures for enhancing MRNs resilience against such disturbances.Based on these findings,we propose a“Two-Stage Emergency Response and Hierarchical Fortification”strategy specifically to improve the resilience of GTPRNs impacted by RILH.The CFM-RILH model provides an effective tool for assessing road network vulnerability under such hazards.Furthermore,its modeling framework can also inform vulnerability assessment and resilience strategy development for road networks affected by other types of slope hazards.
基金funded by the National Key Research and Development Program Project 2022YFB4300404.
文摘The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.
基金The National High Technology Research and Development Program of China(863 Program)(No.2007AA11Z202)the National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAJ18B03)
文摘The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.
基金The National Key Technology R& D Program of Chinaduring the 11th Five-Year Plan Period (No.2006BAJ18B03).
文摘In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.
基金Key Research Program of the Chinese Academy of Sciences, No.KZZD-EW-06-02 Exploratory Forefront Project for the Strategic Science Plan in IGSNRR, CAS, No.2012QY004 National Natural Science Foundation of China, No.41171108
文摘Before the emergence of modern modes of transport, the traditional road infra structure was the major historical means of carrying out nationwide socioeconomic exchange However, the history of transport infrastructure has received little attention from researchers. Given this background, the work reported here examined the longterm development of transport networks in China. The national road network was selected for study and the 3500 years from 1600 BC to 1900 AD was chosen as the study period. Indicators were designed for the maturity level of road networks and an accessibility model was developed for the paths of the shortest distance. The evolution of the road network in China since the Shang Dynasty （1600 BC） was described and its major features were summarized to reveal longterm regu larities. The maturity level of the road network and its accessibility was assessed and regions with good and poor networks were identified. The relationship between China＇s natural, social and economic systems and the road network were discussed. Our analysis shows that the road network in China has a number of longterm regularities. The continuously expanding road network follows a path of inland expansion especially towards the border areas. How ever, its coverage and accessibility are characterized by a coreperipheral configuration, which has close relationships with, not only the natural conditions, but also national defense and warfare. The centralization of national power, national land governance, postal transport, the transport of specialized cargos, and international trade are also related to the develop ment of the road network. This research draws attention to the evolving regularities of trans port networks.
文摘We investigated forest road networks and forestry operations before and after mechanization on aggregated forestry operation sites. We developed equations to estimate densities of road networks with average slope angles, operational efficiency of bunching operations with road network density, and average forwarding distances with operation site areas. Subsequently, we analyzed the effects of aggregating forests, establishing forest road networks, and mechanization on operational efficiency and costs. Six ha proved to be an appropriate operation site area with minimum operation expenses. The operation site areas of the forest owners＇ cooperative in this region aggregated approximately 6 ha and the cooperative conducted forestry operations on aggregated sites. Therefore, 6 ha would be an appropriate operation site area in this region. Regarding road network density, higher-density road networks increased operational expenses due to the higher direct operational expenses of strip road establishment. Therefore, road network density should be reduced to approximately 200 m.
基金supported in part by the National Natural Science Foundation of China (Grant No. 61901052)in part by the 111 project (Grant No. B17007)in part by the Director Funds of Beijing Key Laboratory of Network System Architecture and Convergence (Grant No. 2017BKL-NSACZJ-02)。
文摘In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.
基金The National Natural Science Foundation of China(Nos.4110136241471386)。
文摘In this paper,we propose a new method to achieve automatic matching of multi-scale roads under the constraints of smaller scale data.The matching process is:Firstly,meshes are extracted from two different scales road data.Secondly,several basic meshes in the larger scale road network will be merged into a composite one which is matched with one mesh in the smaller scale road network,to complete the N∶1(N>1)and 1∶1 matching.Thirdly,meshes of the two different scale road data with M∶N(M>1,N>1)matching relationships will be matched.Finally,roads will be classified into two categories under the constraints of meshes:mesh boundary roads and mesh internal roads,and then matchings between the two scales meshes will be carried out within their own categories according to the matching relationships.The results show that roads of different scales will be more precisely matched using the proposed method.
文摘In this paper, platoons of autonomous vehicles operating in urban road networks are considered. From a methodological point of view, the problem of interest consists of formally characterizing vehicle state trajectory tubes by means of routing decisions complying with traffic congestion criteria. To this end, a novel distributed control architecture is conceived by taking advantage of two methodologies: deep reinforcement learning and model predictive control. On one hand, the routing decisions are obtained by using a distributed reinforcement learning algorithm that exploits available traffic data at each road junction. On the other hand, a bank of model predictive controllers is in charge of computing the more adequate control action for each involved vehicle. Such tasks are here combined into a single framework:the deep reinforcement learning output(action) is translated into a set-point to be tracked by the model predictive controller;conversely, the current vehicle position, resulting from the application of the control move, is exploited by the deep reinforcement learning unit for improving its reliability. The main novelty of the proposed solution lies in its hybrid nature: on one hand it fully exploits deep reinforcement learning capabilities for decisionmaking purposes;on the other hand, time-varying hard constraints are always satisfied during the dynamical platoon evolution imposed by the computed routing decisions. To efficiently evaluate the performance of the proposed control architecture, a co-design procedure, involving the SUMO and MATLAB platforms, is implemented so that complex operating environments can be used, and the information coming from road maps(links,junctions, obstacles, semaphores, etc.) and vehicle state trajectories can be shared and exchanged. Finally by considering as operating scenario a real entire city block and a platoon of eleven vehicles described by double-integrator models, several simulations have been performed with the aim to put in light the main f eatures of the proposed approach. Moreover, it is important to underline that in different operating scenarios the proposed reinforcement learning scheme is capable of significantly reducing traffic congestion phenomena when compared with well-reputed competitors.
基金Scientific Research Fund of Institute of Engineering Mechanics,China Earthquake Administration under Grant No.2014B02China postdoctoral Science Foundation under Grant No.2013M531083+1 种基金National Natural Science Foundation of China under Grant No.51508535Natural Science Foundation of Hei Longjiang Province of China under Grant No.LC2012C32
文摘The Gorkha earthquake in Nepal led to many landslides and severe damage to the transportation infrastructure. After careful comparison of the aerial photographs and satellite images before and after the earthquake, partially verified by a field study, more than 2,064 landslides and many road failures were observed. Many bridges, especially steel-truss and suspension bridges, suffered little damage from inertia loads during the earthquake, but were severely damaged due to rockfalls. Potential geological hazards hindered the delivery of supplies in mountainous areas, and road closures impeded the overall speed of rehabilitation.
基金supported by the National Natural Science Foundation of China (Grant No.61401040,Grant No.61372110)
文摘In this research we proposed a strategy for location privacy protection which addresses the issues related with existing location privacy protection techniques. Mix-Zones and pseudonyms are considered as the basic building blocks for location privacy; however, continuously changing pseudonyms process at multiple locations can enhance user privacy. It has been revealed that changing pseudonym at improper time and location may threat to user's privacy. Moreover, certain methods related to pseudonym change have been proposed to attain desirable location privacy and most of these solutions are based upon velocity, GPS position and direction of angle. We analyzed existing methods related to location privacy with mix zones, such as RPCLP, EPCS and MODP, where it has been observed that these methods are not adequate to attain desired level of location privacy and suffered from large number of pseudonym changes. By analyzing limitations of existing methods, we proposed Dynamic Pseudonym based multiple mix zone(DPMM) technique, which ensures highest level of accuracy and privacy. We simulate our data by using SUMO application and analysis results has revealed that DPMM outperformed existing pseudonym change techniques and achieved better results in terms of acquiring high privacy with small number of pseudonym change.
基金Supported by the National Key Research and Development Program of the Ministry of Science and Technology of China(2016YFB1000700)
文摘In recent years, a few researches focus on the similarity measure of semantic trajectories in road networks, since semantic trajectories in road networks have smaller volumes, higher qualities and can better reflect user behaviors. However, these works do not further discuss how to efficiently search similar trajectories. Thus, to implement an efficient similarity search, we design an index called SIET based on the structures of road networks. Then, we propose a novel algorithm called SSN-BF to search similar trajectories efficiently by using best-first strategy. At last, we take the experimental evaluations on real dataset and prove the efficiency of our algorithm.
基金supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF2013R1A1A1004593, 2013R1A1A1A05012348)
文摘A novel technique called the bitmap lattice index(BLI) is proposed, which combines the advantages of a wireless broadcasting environment with a road network. Existing road networks are based on the on-demand method: a server's workload increases as the query request increases when a server sends a client information. To solve this problem, we propose the BLI. The BLI denotes an object and a node as 0 and 1 in the Hilbert curve(HC) map. The BLI can identify the position of a node and an object through bit information; it can also reduce the broadcasting frequency of a server by reducing the size of the index, thereby decreasing the access latency and query processing times. Moreover, the BLI is highly effective for data filtering, as it can identify the positions of both an object and a node. In a road network, if filtering is done via the Euclidean distance, it may result in an error. To prevent this, we add another validation procedure. The experiment is conducted by applying the BLI to kNN query, and the technique is assessed by a performance evaluation experiment.
基金This work was supported by JSPS KAKENHI Grant Number JP20K20122.
文摘As a disaster prevention measure based on self-assistance and mutual assistance,disaster prevention maps are being created with citizen participation throughout Japan.The process of creating disaster prevention maps is itself a disaster prevention measure that contributes to raising awareness of disaster prevention by promoting exchange and cooperation within the region.By focusing on relations between road networks and hazardous elements,we developed a system to support disaster prevention map creation that visualizes roads at high risk during a disaster and facilitates the study of evacuation simulations.This system leads to a completed disaster prevention map in three phases.In the first phase,we use a device with GPS logging functions to collect information related to hazardous elements.In the second phase,we use Google Maps(“online map,”below)to visualize roads with high evacuation risk.In the final phase,we perform a regional evaluation through simulations of disaster-time evacuations.In experimental verifications,by conducting usability tests after creating a disaster prevention map in the target area,we evaluated the system in terms of simple operability and visibility.We found that by implementing this series of processes,even users lacking specialized knowledge regarding disaster prevention can intuitively discover evacuation routes while considering the relations between visualized road networks and hazardous elements.These results show that compared with disaster prevention maps having simple site notations using existing WebGIS systems,disaster prevention maps created by residents while inspecting the target area raise awareness of risks present in the immediate vicinity even in normal times and are an effective support system for prompt disaster prevention measures and evacuation drills.
基金This work was partially supported by National Natural Science Foundation of China(Grant Nos.61601146,61732022)National Key R&D Program of China(Grant No.2016QY05X1000).
文摘Road networks have been used in a wide range of applications to reduces the cost of transportation and improve the quality of related services.The shortest road distance computation has been considered as one of the most fundamental operations of road networks computation.To alleviate privacy concerns about location privacy leaks during road distance computation,it is desirable to have a secure and efficient road distance computation approach.In this paper,we propose two secure road distance computation approaches,which can compute road distance over encrypted data efficiently.An approximate road distance computation approach is designed by using Partially Homomorphic Encryption and road network set embedding.An exact road distance computation is built by using Somewhat Homomorphic Encryption and road network hypercube embedding.We implement our two road distance computation approaches,and evaluate them on the real cityscale road network.Evaluation results show that our approaches are accurate and efficient.
基金supported by the Frontier Technology R&D Project of Jiangsu(BF2024059)the National Natural Science Foundation of China(Grant No.6240071854)+1 种基金the Natural Science Foundation of Jiangsu Province(BK20241381)the Jiangsu Association for Science and Technology Youth Science and Technology Talent Support Project(JSTJ-2023-XH055).
文摘Nowadays,location-based services are widely used,requiring instant responses to a large volume of multiple spatial queries over massive road networks,i.e.,single-pair shortest path(SPSP)query,k-nearest neighbor(kNN)query,and range query.Creating index-based structure for each kind of query is costly,hence it is important to handle multiple spatial queries within one efficient structure.Partition-based hierarchical approaches show promising potential to meet the requirement.However,existing approaches require large search space on massive road networks especially for long-distance queries,which is inefficient and hard to scale.To overcome the drawbacks,we propose the shortcut-enhanced graph hierarchy tree(SCG-tree),which leverages shortcuts to effectively prune the search space over a hierarchical structure.With the SCG-tree,a pruned shortcut-based method is designed to answer SPSP query,and a two-phase expansion strategy is proposed to leverage shortcuts for kNN and range queries.Theoretical analyses show the superiority of proposed shortcut-based query algorithms.Extensive experiments demonstrate that our approach can achieve three times speedup for kNN query and an order of magnitude speedup for SPSP and range queries over existing methods on real road networks that scale up to 24 million nodes and 58 million edges.
文摘Privacy preservation has recently received considerable attention for location-based mobile services. A lot of location cloaking approaches focus on identity and location protection, but few algorithms pay attention to prevent sensitive information disclosure using query semantics. In terms of personalized privacy requirements, all queries in a cloaking set, from some user＇s point of view, are sensitive. These users regard the privacy is breached. This attack is called as the sensitivity homogeneity attack. We show that none of the existing location cloaking approaches can effectively resolve this problem over road networks. We propose a （K, L, P）-anonymity model and a personalized privacy protection cloaking algorithm over road networks, aiming at protecting the identity, location and sensitive information for each user. The main idea of our method is first to partition users into different groups as anonymity requirements. Then, unsafe groups are adjusted by inserting relaxed conservative users considering sensitivity requirements. Finally, segments covered by each group are published to protect location information. The efficiency and effectiveness of the method are validated by a series of carefully designed experiments. The experimental results also show that the price paid for defending against sensitivity homogeneity attacks is small.
文摘Traffic congestion in road transportation networks is a persistent problem in major metropolitan cities around the world.In this context,this paper deals with exploiting underutilized road capacities in a network to lower the congestion on overutilized links while simultaneously satisfying the system optimal flow assignment for sustainable transportation.Four congestion mitigation strategies are identified based on deviation and relative deviation of link volume from the corresponding capacity.Consequently,four biobjective mathematical programming optimal flow distribution(OFD)models are proposed.The case study results demonstrate that all the proposed models improve system performance and reduce congestion on high volume links by shifting flows to low volumeto-capacity links compared to UE and SO models.Among the models,the system optimality with minimal sum and maximum absolute relative-deviation models(SO-SAR and SO-MAR)showed superior results for different performance measures.The SO-SAR model yielded 50%and 30%fewer links at higher link utilization factors than UE and SO models,respectively.Also,it showed more than 25%improvement in path travel times compared to UE travel time for about 100 paths and resulted in the least network congestion index of1.04 compared to the other OFD and UE models.Conversely,the SO-MAR model yielded the least total distance and total system travel time,resulting in lower fuel consumption and emissions,thus contributing to sustainability.The proposed models contribute towards efficient transportation infrastructure management and will be of interest to transportation planners and traffic managers.
文摘In this paper, we discuss some fundamental properties of two idealized typical networks, namely, grid type and radial-circular type. The discussion is based on SPCP （Shortest Path Counting Problem）, which reflects the traffic density of a road segment. Furthermore, we compare their effectiveness based on the obtained results of the above two road networks, and suggest some proposals on the design of car lanes by considering the direction of a road segment in relation to these road networks.
基金supported by the Korea Institute of Science and Technology Information (KISTI)
文摘Recent development of wireless communication technologies and the popularity of smart phones .are making location-based services （LBS） popular. However, requesting queries to LBS servers with users＇ exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an efficient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query （k-NN） processing algorithms for a query region in road networks. To efficiently retrieve k-NN points of interest （POIs）, we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor （kRNN） algorithm in terms of network expansion cost and query processing time.
