PgRouting is an open source library that provides routing functionality for PostgreSQL and PostGIS. It allows calculating the shortest path between points on a road network. Costs in the network can be made dynamic to model real-world factors like traffic, conditions, restrictions. This allows pgRouting to find alternate routes automatically in response to changes rather than requiring pre-calculated networks.

1. Shortest Path Search
with pgRouting
Daniel Kastl

2. What is pgRouting?

3. An Extension for
PostgreSQL / PostGIS, ...

4. An Open Source
project, ...

5. A Library providing, ...

6. Shortest Path

7. DD and TSP

8. DARP

9. @justjkk
@jay_mahadeokar

10. APSP and TDSP

11. Multi-Modal

12. https://github.com/pgRouting/pgrouting

13. SQL Function
SELECT * FROM shortest_path('
SELECT gid as id,
source::integer,
target::integer,
length::float8 as cost
FROM ways',
605, 359, false, false);

14. Query Result
vertex_id | edge_id | cost
-----------+---------+--------------------
605 | 599 | 0.19925085940845
604 | 598 | 0.100258103875674
603 | 597 | 0.201123583387407
602 | 596 | 0.204847680679676
601 | 595 | 0.158334540345002
4293 | 9602 | 0.0183273901669081
... | ... | ...

15. Most users need pgRouting for
Road Networks
How do they look like?

16. Like this ...

17. … or like this ...

18. … or sometimes like this.

19. What makes them real?
Traffic lights Signs Road marking

20. How can pgRouting help here?

21. gid,
source,
source target,
cost,
reverse_cost,
x1, y1,
x2, y2,
rule,
to_cost
target

22. Traffic lights slow down
… so costs must increase.

23. B
C
1min
A
D
cost(A)=cost(A)+30sec
cost(B)=cost(B)+30sec
cost(C)=cost(C)+30sec
cost(D)=cost(D)+30sec

24. Signs inform about
restrictions and rules

26. cost(A) = length(A)
reverse_cost(A) = ∞
A

27. Sometimes
the costs
have different
meaning.

28. cost(A)=length(A)/2
reverse_cost(A)=length(A)*2
cost(B)=length(B)*3
reverse_cost(B)=length(B)/3
B
A

29. Turn restrictions
obviously
restrict turns.

30. B
C
1min
A
D
cost(A)=cost(A)+1min
cost(B)=cost(B)+1min
rule(A) = "D"
cost(C)=cost(C)+1min
cost(D)=cost(D)+1min∞
to_cost(A, D) =

31. Road type
can be used
for cost
calculation.

32. Not only road types
but also conditions

33. Jughandle intersection
http://upload.wikimedia.org/wikipedia/commons/e/e4/Jughandle_signage.jpg

34. @ckrahe

35. And you know
what is great about pgRouting?

36. All costs are dynamic!
… which is the opposite to pre-calculated

37. If the road is closed ...

38. … or there is an accident, ...

39. … there is a sign with
restrictions limited
to a certain time, ...

40. … bad weather conditions ...

41. … or any other obstacle, ...

42. You don't need to
rebuild and reload
your network

43. … and wait forever.

44. You only need to adjust the cost
for this particular road,
and the next search will go another way.

45. Cost can be virtually anything

46. OpenStreetMap data

47. pgRouting can be used for
different kinds of networks

48. Canals and
Rivers

49. Hiking trails

50. … or any other
kind of networks.

51. pgRouting Demo
http://websi.openvrp.com
http://map.veloland.ch
http://www.ridethecity.com
http://www.pgrouting.org/gallery.html

52. Plans until FOSS4G 2012
●
Integrate new functions
●
All-Pair-Shortest-Path
●
Time-Dependent-Shortest-Path
●
Multi-Modal
●
Two-way A-Star, ...
●
Drop CGAL dependency
●
PostgreSQL 9.x & PostGIS 2.0 support
●
Source cleanup

53. www.pgrouting.org
workshop.pgrouting.org
daniel@georepublic.de

55. Photos from sxc.hu and
flickr under Creative Commons Licence.