Shortest Path Search For Real Road Networks With pgRouting

Hal Seki (Georepublic Japan) with Mario Basa (Georepublic), Ko Nagase (Georepublic Japan)

14:30 on Thursday 19th September (in Session 17, starting at 2:30 p.m., Sir Clive Granger Building: A41)

Show in Timetable

Description: pgRouting adds routing functionality to PostGIS, and this presentation will give an overview of the current state of the project, and introduce the new and revised features of the new release in 2013.

pgRouting adds routing functionality to PostGIS. A completely revisioned version of the library will be released in 2013. This presentation will show the inside and current state of pgRouting development. 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 learn about difficulties and limitations of implementing routing functionality in GIS applications, the difference between algorithms and for which use case pgRouting is the right tool. pgRouting includes: Shortest path search (3 algorithms: Dijkstra, A-Star, Shooting Star) Traveling salesperson problem solver (TSP) Driving distance calculation … and many new features! pgRouting is an extension of PostgreSQL and PostGIS. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from Camptocamp, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by Georepublic, iMaptools and a broad user community.