Building of Road Network Topology and the Shortest Path Analysis Based on MapX

2013 ◽  
Vol 380-384 ◽  
pp. 2573-2576 ◽  
Author(s):  
Qing Ge Zhang ◽  
Lu Wei Zhang ◽  
Xu Ri Yin
Keyword(s):  
Path Analysis ◽  
Shortest Path ◽  
Spatial Data ◽  
Road Network ◽  
Experimental Result ◽  
The Road ◽  
Application Systems ◽  
Control Product ◽  
Shortest Path Analysis ◽  
Map Analysis

MapX is an ActiveX control product with powerful map analysis functions offered by Maplnfo Company.Because It does not support the topology of spatial data, the shortest path analysis has become a hot potato for MapX users to develop application systems. In this paper, several key technologies to establish the road topology structure based on MapX are discussed. On the base, an algorithm for finding the shortest path in road network is presented, and experimental result shows that the proposed algorithm is more practical and effective. At last, a brief conclusion as well as the expectation for the further study is made.

Building Topological Structure of the Post-Disaster Road Network Based MapX

2014 ◽  
Vol 505-506 ◽  
pp. 995-998 ◽  
Author(s):  
Xu Ri Yin
Keyword(s):  
Shortest Path ◽  
Spatial Data ◽  
Road Network ◽  
Road Traffic ◽  
Weak Link ◽  
Application Systems ◽  
Control Product ◽  
Shortest Path Analysis ◽  
Map Analysis ◽  
Post Disaster

Road traffic is the most widely used for transport security, which have the significant disaster vulnerability. It often becomes the weak link when the evacuation and rescue. MapX is an ActiveX control product with powerful map analysis functions offered by MapInfo Company. Because it does not support the topology of spatial data, the shortest path analysis has become a hot potato for users to develop application systems. In this paper, several key technologies to establish topology structure of road network based on MapX are discussed. On the base, an algorithm for finding the shortest path in post-disaster road network is presented, and experimental results show that the proposed algorithm is more practical and effective. At last, a brief conclusion as well as the expectation for the further study is made.

scholarly journals Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions

2019 ◽  
Vol 18 (3) ◽  
pp. 558-582
Author(s):  
Anton Agafonov ◽  
Vladislav Myasnikov
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Road Network ◽  
Large Scale ◽  
Probability Distributions ◽  
Time Budget ◽  
Stochastic Networks ◽  
Computational Time ◽  
Transport Networks ◽  
The Road

An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in stochastic networks using actual information of the traffic flow parameters. We consider the following optimality criterion: maximization of the probability of arriving on time at a destination given a departure time and a time budget. The reliable shortest path takes into account the variance of the travel time of the road network segments, which makes it more applicable for solving routing problems in transport networks compared to standard shortest path search algorithms that take into account only the average travel time of network segments. To describe the travel time of the road network segments, it is proposed to use parametrically defined stable Levy probability distributions. The use of stable distributions allows replacing the operation of calculating convolution to determine the reliability of the path to recalculating the parameters of the distributions density, which significantly reduces the computational time of the algorithm. The proposed method gives a solution in the form of a decision, i.e. the route proposed in the solution is not fixed in advance, but adaptively changes depending on changes in the real state of the network. An experimental analysis of the algorithm carried out on a large-scale transport network of Samara, Russia, showed that the presented algorithm can significantly reduce the computational time of the reliable shortest path algorithm with a slight increase in travel time.

GIS-Analysis of Central Asian Transportation Systems’ Configuration

2019 ◽  
Vol 950 (8) ◽  
pp. 45-51
Author(s):  
P.M. Sapanov
Keyword(s):  
Spatial Data ◽  
Road Network ◽  
Road Transport ◽  
Transportation Systems ◽  
Transport Infrastructure ◽  
Gis Analysis ◽  
Road Transportation ◽  
The Road ◽  
Central Asian ◽  
High Degree

The author describes the performed GIS-analysis of the Central Asian transportation systems. The road transportation infrastructure of the whole region and its individual countries (Kazakhstan, Kyrgyzstan, Tajikistan, Turkmenistan and Uzbekistan) has been studied. The overview of the factors, influencing the formation of regional transportation systems, including historical, political and natural, has been done. The road network of Central Asian countries has been modeled using GIS network analysis toolset, with spatial data provided by OpenStreetMap. The so-called topological tiers of the network have been identified, showing the uneven provision of the studied area with road transport infrastructure. The proposed research method makes it possible to note a high degree of the road network integration between the countries. The areas with low transport accessibility, as well as autonomous parts of road network have been visualized. The research categorizes the countries’ transport networks configurations types formed under the influence of economic, social, agricultural, climatic and topographical factors.

scholarly journals Interactive Web-Map of the European Freeway Junction A1/A4 Development with the Use of Archival Cartographic Sources

2020 ◽  
Vol 9 (7) ◽  
pp. 438 ◽  
Author(s):  
Dariusz Lorek ◽  
Tymoteusz Horbiński
Keyword(s):  
19Th Century ◽  
Spatial Data ◽  
Road Network ◽  
The Road ◽  
Web Map ◽  
Comprehensive Method ◽  
Road Corridors ◽  
User Friendly ◽  
The 19Th Century ◽  
The Web

In the article, authors have analyzed cartographic materials presenting the spatial development of Gliwice with the use of multimedia tools. The materials prove that this area has played an important part in the road system of the region, country and even part of Europe since the 19th century. The six maps from the studied area were analyzed e.g., the Urmesstischblätter map, polish topographic maps, and the OpenStreetMap. Based on these maps and their legends, vectorization of the main roads of the analyzed area was carried out. The evolution of the main road corridors on the six maps was analyzed with respect to the location of the European freeway junction (A1/A4), constituting a basis for the web map. According to the authors, the use of the interactive web map is the most comprehensive method of all technologies used by modern cartography. Spatial data collected from different cartographic publications (from the first half of the 19th century till the present) consider the most significant aspects of changes in the road network of the analyzed area in a detailed and user-friendly way.

Sign in / Sign up

Export Citation Format

Share Document