pgRouting extends the PostGIS / PostgreSQL geospatial database to provide shortest path search and other network analysis functionality.
This presentation will show the inside and current state of the pgRouting development, from its wide range of shortest path search algorithms to driving distance calculation or “Traveling Sales Person” (TSP) optimization. Additionally we will give a brief outlook and introduction of upcoming new features like the “Vehicle Routing Problem” (VRP) solver, and what we have in mind for future releases.
We will explain the shortest path search in real road networks and how the data structure is important to get better routing results. Furthermore we will show how you can improve the quality of the search with dynamic costs and make the result look closer to the reality. You will also learn about difficulties and limitations of the library, and when pgRouting might not be not the right tool to solve your routing problem.
10. Feature Highlights
➔ Two new All Pairs Short Path algorithms
➔ Bi-directional Dijkstra and A-star algorithms
➔ One to many nodes shortest path search
➔ New TSP solver (with distance matrix)
➔ Turn Restricted shortest path (replaces Shooting
Star algorithm)
➔ A collection of useful utility and graph analytics
functions
11. More Highlights
➔ Modular library design
➔ Unit tests and automated tests with Travis
➔ Compatibility with PostgreSQL 9.1+ / PostGIS 2.0+
➔ Installs as PostgreSQL EXTENSION
➔ Added pgr_ prefix to functions and types
➔ Improved build process for Windows
➔ Better documentation in several languages
https://www.transifex.com/projects/p/pgrouting/
12. Most users need pgRouting for
Road Networks
How do they look like?
18. SQL Function
SELECT * FROM pgr_dijkstra('
SELECT gid as id,
source::integer,
target::integer,
length::float8 as cost
FROM ways',
30, 60, false, false);