Shortest Path search in your Database and more with pgRouting

Daniel Kastl
Wednesday 10:00 - 10:25
Session 1, Track 8, Slot 1

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.