РАСЧЕТ И ВИЗУАЛИЗАЦИЯ КАРТОГРАФИЧЕСКИХ МАРШРУТОВ С ИСПОЛЬЗОВАНИЕМ ПРОГРАММНОГО ОБЕСПЕЧЕНИЯ QGIS И PGROUTING

Abstract

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.