scholarly journals CALCULATION AND VISUALIZATION OF MAP ROUTES USING QGIS AND PGROUTING SOFTWARE

2021 ◽  
Vol 26 (5) ◽  
pp. 86-98
Author(s):  
Andrei A. Basargin ◽  
◽  
Petr Yu. Bugakov ◽  
Tatyana Yu. Bugakova ◽  
◽  
...  
Keyword(s):  
Network Analysis ◽  
Road Network ◽  
Traveling Salesman ◽  
Shortest Path Algorithm ◽  
The Road ◽  
Shortest Route ◽  
Software Product ◽  
Geospatial Database ◽  
The Traveling Salesman Problem ◽  
Geospatial Databases

Recently, new tools have been created for working with geodata, which are used in various fields of human activity. Software for network analysis and routing solutions is of particular importance. The software product pgRouting is an example, distributed under the GPLv2 license. This program extends the capabilities of PostGIS / PostgreSQL geospatial databases. The article discusses the general principles of constructing routes on the graphs of the road network. It describes how to work with the geospatial database and the pgRouting software for building a route. The purpose of the work is to build a correct rout of a road graph in routing areas with a big number of objects and a poorly developed road network. The problem is solved by software pgRouting and QGIS on the basis of the Dijkstra shortest path algorithm, Johnson and Floyd-Warshall algorithms and allows you to solve the traveling salesman problem, and many others. The task is solved by means of software pgRouting и QGIS. As an experiment the article shows the solution for the task in which it is not enough to use only a road graph for building a correct route. Such situations may occur when routing the areas with a big number of objects and a poorly developed road network. In the process of the experiment described in the article it was found out that software pgRouting together with QGIS allows to rather effectively solve the task on calculation and visualization of the shortest route between two points on the map.

Slow-moving landslides interacting with the road network: Analysis of damage using ancillary data, in situ surveys and multi-source monitoring data

2019 ◽  
Vol 260 ◽  
pp. 105244 ◽  
Author(s):  
Nicoletta Nappo ◽  
Dario Peduto ◽  
Olga Mavrouli ◽  
Cees J. van Westen ◽  
Giovanni Gullà
Keyword(s):  
Network Analysis ◽  
Road Network ◽  
Source Monitoring ◽  
Monitoring Data ◽  
Ancillary Data ◽  
The Road ◽  
Slow Moving

scholarly journals Data-Driven Bicycle Network Analysis Based on Traditional Counting Methods and GPS Traces from Smartphone

2019 ◽  
Author(s):  
Federico Rupi ◽  
Cristian Poliziani ◽  
Joerg Schweizer
Keyword(s):  
Road Network ◽  
Smartphone Application ◽  
The Road ◽  
Total Deviation ◽  
Deviation Index ◽  
Shortest Route ◽  
Gps Traces ◽  
The Absolute ◽  
The City ◽  
Entire Network

This research describes numerical methods to analyze the absolute transport demand of cyclists and then to quantify the road network weaknesses of a city with the aim to identify infrastructure improvements in favor of cyclists. The methods are based on a combination of bicycle counts and map-matched GPS traces and are demonstrated with the city of Bologna, Italy: the dataset is based on approximately 27,500 GPS traces from cyclists, recorded over a period of one month on a volunteer basis using a smartphone application. A first method estimates absolute, city-wide bicycle flows, by scaling map-matched bicycle flows of the entire network to manual and instrumental bicycle counts of the main bikeways of the city. As there is a good correlation between the two sources of flow data, the absolute bike-flows on the entire network have been correctly estimated. A second method describes a novel link-deviation index, which quantifies for each network edge the total deviation generated for cyclists in terms of extra distances traveled with respect to the shortest possible route. The deviations are accepted by cyclists either to avoid unpleasant road attributes along the shortest route or to experience more favorable road attributes along the chosen route. The link deviation index indicates the planner which road links are contributing most to the total deviation of all cyclists – in this way, repelling and attracting road attributes for cyclists can be identified. This is why the deviation index is of practical help to prioritize bike infrastructure construction on individual road network links.

scholarly journals USE OF ROAPGRAPH IN NAVIGATION SYSTEMS ON THE EXAMPLE OF A COMPANY HERE TECHNOLOGIES

2019 ◽  
Vol 1 (2) ◽  
pp. 197-204
Author(s):  
Olesia Nikolaeva ◽  
Lyudmila Radchenko
Keyword(s):  
Network Analysis ◽  
Road Network ◽  
Navigation Systems ◽  
Years Of Experience ◽  
Main Layer ◽  
The Road ◽  
Road Congestion ◽  
Geoinformation Technologies ◽  
The Creation ◽  
A Company

The road graph is the main layer of a digital navigation map. With the development of geoinformation technologies it is possible to use the road graph to solve various tasks: route construction, analysis of the use of the road network, analysis of road congestion, geomarketing research, updating the database based on the discrepancy between the data in reality and in the application. The purpose of this research is to consider in detail the applied problems that are solved on the basis of the road graph of аn navigation application. These tasks are considered on the example of HERE Technologies, which has many years of experience in the creation and use of navigation applications.

scholarly journals OPTIMIZATION OF GOODS DISTRIBUTION ROUTE ASSISTED BY GOOGLE MAP WITH CHEAPEST INSERTION HEURISTIC ALGORITHM (CIH)

SINERGI ◽  
2018 ◽  
Vol 22 (2) ◽  
pp. 132
Author(s):  
L. Virginayoga Hignasari ◽  
Eka Diana Mahira
Keyword(s):  
Minimum Distance ◽  
Traveling Salesman ◽  
Optimal Distribution ◽  
Total Distance ◽  
Completion Problem ◽  
Shortest Route ◽  
The Difference ◽  
The Traveling Salesman Problem ◽  
The Relationship ◽  
Insertion Heuristic

In the distribution of goods, the efficiency of goods delivery one of which was determined by the path that passed to deliver the goods. The problem of choosing the shortest route was known as the Traveling Salesman Problem (TSP). To solve the problem of choosing the shortest route in the distribution of goods, the algorithm to be used was Cheapest Insertion Heuristic (CIH). This study aims to determine the minimum distance traveled by using the CIH algorithm.  Researchers determine the route and distance of each place visited by using google map. The concept in the CIH algorithm was to insert an unexpired city with an additional minimum distance until all cities are passed to get the solution of the problem. The step completion problem with CIH algorithm was: 1) search, 2) making sub tour; 3) change the direction of the relationship, 4) repeat the steps so that all places are included in the sub tour. Theoretically, the total distance calculated using the CIH algorithm is 20.2 km, while the total distance calculated previously traveled with the ordered route is 25.2 km. There was a difference of 5 km with the application of CIH algorithm. The difference between the distance certainly has an impact on the optimal distribution of goods to the destination. Therefore, CIH algorithm application can provide a solution for determining the shortest route from the distribution of goods delivery.

scholarly journals Road network optimization using heuristic and linear programming

2010 ◽  
Vol 56 (No. 3) ◽  
pp. 137-145 ◽  
Author(s):  
R. Ghaffariyan M ◽  
K. Stampfer ◽  
J. Sessions ◽  
T. Durston ◽  
CH. Kanzian ◽  
...  
Keyword(s):  
Network Analysis ◽  
Optimal Solution ◽  
Road Construction ◽  
Mixed Integer ◽  
Shortest Path Algorithm ◽  
Road Density ◽  
The Road ◽  
Constant Cost ◽  
The Cost ◽  
Installation Cost

&nbsp;To minimize the cost of logging, it is necessary to optimize the road density. The aim of this study was to determine optimal road spacing (ORS) in Northern Austria. The stepwise regression method was used in modelling. The production rate of tower yarder was 10.4 m<SUP>3</SUP>/PSHo (Productive system hours) and cost of 19.71 €.m<SUP>–3</SUP>. ORS was studied by calculating road construction cost, installation cost and yarding cost per m<SUP>3</SUP> for different road spacing. The minimum total cost occurred at 39.15 €.m<SUP>–3</SUP> and ORS would be 474 m assuming uphill and downhill yarding. The optimal road density and yarding distance are 21.1 m.ha<SUP>–1</SUP> and 90 m, respectively. A sample logging area was used to plan different roads and, using network analysis, the best solution was found based on a modified shortest path algorithm. The network analysis results were very different from the optimal road spacing results that assumed roads and logging corridors could be located anywhere in the planning area at a constant cost. Mixed integer programming was also used to get a real optimal solution.

scholarly journals Data-driven Bicycle Network Analysis Based on Traditional Counting Methods and GPS Traces from Smartphone

2019 ◽  
Vol 8 (8) ◽  
pp. 322 ◽  
Author(s):  
Federico Rupi ◽  
Cristian Poliziani ◽  
Joerg Schweizer
Keyword(s):  
Road Network ◽  
Choice Model ◽  
Smartphone Application ◽  
The Road ◽  
Total Deviation ◽  
Shortest Route ◽  
Gps Traces ◽  
The Absolute ◽  
The City ◽  
Entire Network

This research describes numerical methods to analyze the absolute transport demand of cyclists and to quantify the road network weaknesses of a city with the aim to identify infrastructure improvements in favor of cyclists. The methods are based on a combination of bicycle counts and map-matched GPS traces. The methods are demonstrated with data from the city of Bologna, Italy: approximately 27,500 GPS traces from cyclists were recorded over a period of one month on a volunteer basis using a smartphone application. One method estimates absolute, city-wide bicycle flows by scaling map-matched bicycle flows of the entire network to manual and instrumental bicycle counts at the main bikeways of the city. As there is a fairly high correlation between the two sources of flow data, the absolute bike-flows of the entire network have been correctly estimated. Another method describes a novel, total deviation metric per link which quantifies for each network edge the total deviation generated for cyclists in terms of extra distances traveled with respect to the shortest possible route. The deviations are accepted by cyclists either to avoid unpleasant road attributes along the shortest route or to experience more favorable road attributes along the chosen route. The total deviation metric indicates to the planner which road links are contributing most to the total deviation of all cyclists. In this way, repellant and attractive road attributes for cyclists can be identified. This is why the total deviation metric is of practical help to prioritize bike infrastructure construction on individual road network links. Finally, the map-matched traces allow the calibration of a discrete choice model between two route alternatives, considering distance, share of exclusive bikeway, and share of low-priority roads.

scholarly journals Evaluation of the China Pakistan Economic Corridor Road Network: Shortest Route, Regional Distribution, and Robustness

2019 ◽  
Vol 1 (1) ◽  
pp. 12-43
Keyword(s):  
Economic Development ◽  
Road Network ◽  
Regional Distribution ◽  
Transportation Cost ◽  
Knock Out ◽  
The Road ◽  
Shortest Route ◽  
Balanced Distribution ◽  
Belt And Road ◽  
Alternate Routes

Purpose - The transport road network plays a significant role in the economic development of any country. An appropriate road network not only reduces transportation cost but it also serves as an infrastructural enabler for further economic development. The China-Pakistan Economic Corridor (CPEC) is part of the Chinese “Belt and Road Initiative”, seeking better connectivity between Asia, Europe, and Africa. The major part of the CPEC project is the development of a road network linking the port city of Gwadar (Pakistan) with Kashgar (China). This paper focuses on the quantitative evaluation of alternate routes within the CPEC road network inside Pakistan with regard to travel times, road development in provinces, a balanced distribution of road network among provinces, and robustness against road closures. Methodology - The network is developed as an undirected graph with nodes as cities and edges as interlinking roads. Based on publicly available data, the paper identifies the shortest path from Gwadar to Khunjerab pass (Pakistan-China Border) and measures the distribution of the travelled distance among Pakistan’s provinces for each alternate route. Moreover, the robustness of road network is evaluated by a knock-out analysis. Results - The results showed that an unconsidered route by the planners promises the shortest travel time and that some proposed routes have significantly unbalanced share amongst provinces. There is a variation in robustness between the alternate routes, but with any route selected, the road network is able to remain functional even after closure of multiple connections. Practical Implications - This study provides a decision-making toolbox for analysis and policy-making related to economic corridors e.g. CPEC – which is at its inception phase, and still tied to limited availability of data. Originality - The present study is novel because no prior study has covered the road network analysis of CPEC. Also, robustness and topographical analyses with respect to CPEC have not previously been undertaken.

scholarly journals Mobile Application Searching of the Shortest Route on Delivery Order of CV. Alfa Fresh With Brute Force Algorithm

2019 ◽  
Vol 19 (3) ◽  
pp. 120
Author(s):  
Indri Ariyanti ◽  
M. Aris Ganiardi ◽  
Ulsa Oktari
Keyword(s):  
Problem Solving ◽  
Traveling Salesman Problem ◽  
Mobile Application ◽  
Traveling Salesman ◽  
Brute Force ◽  
Traveling Salesman Problems ◽  
Initial Node ◽  
Shortest Route ◽  
The Traveling Salesman Problem

Traveling Salesman Problem is a problem solving used in finding the shortest route to visit all nodes at once and then return to the initial node. Troubleshooting of the Traveling Salesman Problem using the Brute Force algorithm. The object of this research is the courier at CV. Alfa Fresh. The Brute Force algorithm provides a solution for Traveling Salesman Problems to select and determine the shortest routes to deliver orders from the office to the destination. The Brute Force algorithm is an algorithm that is used to match patterns with all routes to be traversed to find the shortest route pattern. The Brute Force algorithm works by enumerating all possible candidates. With this application can facilitate the courier in determining the closest route from the position of the courier.

scholarly journals A Deep Learning-Based Solution for Large-Scale Extraction of the Secondary Road Network from High-Resolution Aerial Orthoimagery

2020 ◽  
Vol 10 (20) ◽  
pp. 7272 ◽  
Author(s):  
Calimanut-Ionut Cira ◽  
Ramón Alcarria ◽  
Miguel-Ángel Manso-Callejo ◽  
Francisco Serradilla
Keyword(s):  
Deep Learning ◽  
High Resolution ◽  
Road Network ◽  
Large Scale ◽  
Performance Metrics ◽  
Great Effort ◽  
The Road ◽  
Remotely Sensed Imagery ◽  
Geospatial Databases ◽  
Segmentation Models

Secondary roads represent the largest part of the road network. However, due to the absence of clearly defined edges, presence of occlusions, and differences in widths, monitoring and mapping them represents a great effort for public administration. We believe that recent advancements in machine vision allow the extraction of these types of roads from high-resolution remotely sensed imagery and can enable the automation of the mapping operation. In this work, we leverage these advances and propose a deep learning-based solution capable of efficiently extracting the surface area of secondary roads at a large scale. The solution is based on hybrid segmentation models trained with high-resolution remote sensing imagery divided in tiles of 256 × 256 pixels and their correspondent segmentation masks, resulting in increases in performance metrics of 2.7–3.5% when compared to the original architectures. The best performing model achieved Intersection over Union and F1 scores of maximum 0.5790 and 0.7120, respectively, with a minimum loss of 0.4985 and was integrated on a web platform which handles the evaluation of large areas, the association of the semantic predictions with geographical coordinates, the conversion of the tiles’ format and the generation of geotiff results compatible with geospatial databases.

Sign in / Sign up

Export Citation Format

Share Document