Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

4,502 views

Published on

pgRouting includes:

- Shortest path search (3 algorithms: Dijkstra, A-Star, Shooting Star)

- Traveling salesperson problem solver (TSP)

- Driving distance calculation

- NEW: Dial-a-ride-problem solver (DARP)

- NEW: All-pair-shortest-path algorithm (APSP)

pgRouting is an extension of PostgreSQL and PostGIS. A predecessor of pgRouting's pgDijkstra, written by Camptocamp, was later extended by Orkney and renamed to pgRouting. The project is now supported by Georepublic and a broad user community.

No Downloads

Total views

4,502

On SlideShare

0

From Embeds

0

Number of Embeds

24

Shares

0

Downloads

63

Comments

0

Likes

5

No embeds

No notes for slide

- 1. Shortest Path Search with pgRouting Daniel Kastl
- 2. What is pgRouting?
- 3. An Extension forPostgreSQL / 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 FunctionSELECT * 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 1minA D cost(A)=cost(A)+30sec cost(B)=cost(B)+30sec cost(C)=cost(C)+30sec cost(D)=cost(D)+30sec
- 24. Signs inform aboutrestrictions and rules
- 25. cost(A) = length(A) reverse_cost(A) = ∞A
- 26. Sometimes the costshave different meaning.
- 27. cost(A)=length(A)/2 reverse_cost(A)=length(A)*2 cost(B)=length(B)*3 reverse_cost(B)=length(B)/3 BA
- 28. Turn restrictions obviously restrict turns.
- 29. B C 1minA 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) =
- 30. Road typecan be used for costcalculation.
- 31. Not only road typesbut also conditions
- 32. Jughandle intersectionhttp://upload.wikimedia.org/wikipedia/commons/e/e4/Jughandle_signage.jpg
- 33. @ckrahe
- 34. And you knowwhat is great about pgRouting?
- 35. All costs are dynamic!… which is the opposite to pre-calculated
- 36. If the road is closed ...
- 37. … or there is an accident, ...
- 38. … there is a sign with restrictions limited to a certain time, ...
- 39. … bad weather conditions ...
- 40. … or any other obstacle, ...
- 41. You dont need torebuild and reload your network
- 42. … and wait forever.
- 43. You only need to adjust the cost for this particular road,and the next search will go another way.
- 44. Cost can be virtually anything
- 45. OpenStreetMap data
- 46. pgRouting can be used fordifferent kinds of networks
- 47. Canals and Rivers
- 48. Hiking trails
- 49. … or any otherkind of networks.
- 50. pgRouting Demo http://websi.openvrp.com http://map.veloland.ch http://www.ridethecity.comhttp://www.pgrouting.org/gallery.html
- 51. 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
- 52. www.pgrouting.orgworkshop.pgrouting.orgdaniel@georepublic.de
- 53. Photos from sxc.hu andflickr under Creative Commons Licence.

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment