pgRouting 2.0 presentation 2013
3 likes7,081 views
pgrouting is an open-source extension for PostgreSQL/PostGIS that provides advanced shortest path algorithms and utilities for routing and network analysis. New features include bi-directional Dijkstra and A-star algorithms, a traveling salesman solver, and dynamic cost adjustments for road conditions. Future updates planned for version 2.1 aim to enhance public transit routing and algorithm complexity.
pgRouting 2.0 presentation 2013
- 1. Shortest Path Search with pgRouting
- 2. What is pgRouting ?
- 3. An Extension for PostgreSQL / PostGIS, ...
- 9. v2.0
- 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. Big THANK YOU to - Steve Woodbridge - Regina Obe … and the pgRouting community!
- 13. Most users need pgRouting for Road Networks How do they look like?
- 14. Like this ...
- 15. … or like this ...
- 16. … or sometimes like this.
- 17. What makes them real? Traffic lights Signs Road marking
- 19. SQL Function SELECT * FROM pgr_dijkstra(' SELECT gid as id, source::integer, target::integer, length::float8 as cost FROM ways', 30, 60, false, false);
- 20. Query Result seq | node | edge | cost -----+------+------+--------------------0 | 30 | 53 | 0.0591267653820616 1 | 44 | 52 | 0.0665408320949312 2 | 14 | 15 | 0.0809556879332114 3 | 13 | 14 | 0.072694271986776 4 | 12 | 13 | 0.081239348480584 5 | 11 | 12 | 0.00746935522787469 6 | 10 | 6869 | 0.0164274192597773 7 | 59 | 72 | 0.0109385169537801 8 | 60 | -1 | 0 (9 rows)
- 22. Traffic lights slow down … so costs must increase.
- 23. B C 1 min A cost(A) = cost(A) + 30sec cost(B) = cost(B) + 30sec cost(C) = cost(C) + 30sec cost(D) = cost(D) + 30sec D
- 24. Signs inform about restrictions and rules
- 26. cost(A) = length(A) reverse_cost(A) = ∞ A
- 28. cost(A) = length(A) / 2 reverse_cost(A) = length(A) * 4 B A
- 29. Road type can be used for cost calculation.
- 30. Not only road types but also conditions
- 31. And you know what is great about pgRouting?
- 32. All costs are dynamic! … which is the opposite to pre-calculated
- 33. If the road is closed ...
- 34. … or there is an accident, ...
- 35. … there is a sign with restrictions limited to a certain time, ...
- 36. … bad weather conditions ...
- 37. You don't need to rebuild and reload your network
- 38. You only need to adjust the cost for this particular road, … and the next search will go another way.
- 40. Cost can be virtually anything
- 41. pgRouting can be used for different kinds of networks
- 43. Hiking trails
- 44. … or any other kind of networks
- 45. Roadmap for Version 2.1 ➔ Add “Multi-modal public transit routing” (GSoC 2011) ➔ Add “Time dependent shortest path” algorithm (GSoC 2011) ➔ Add “Two Queue” Algorithm (GSoC 2012) ➔ Add DARP and VRP (GSoC 2013) ➔ Add Graph network partitioning (GSoC 2013) ➔ …. further improvements and bug fixes.
- 47. More Information Website: pgrouting.org Documentation: Workshop: 日本語 NEW Support: docs.pgrouting.org workshop.pgrouting.org workshop.pgrouting.org/ja pgrouting.org/support.html … or talk contact us directly: ➔ Daniel Kastl daniel@georepublic.co.jp ➔ Hal Seki hal@georepublic.co.jp
- 48. Photos from sxc.hu and flickr under Creative Commons Licence.