Content deleted Content added
→Additional sources: Fixed broken Umlauts |
|||
Line 3:
==Overview==
It combines sophisticated [[routing algorithm]]s with the open and free road network data of the [[OpenStreetMap]] (OSM) project. Shortest path computation on a continental sized network can take up to several seconds if it is done without a so-called speedup-technique. OSRM uses an implementation of Contraction Hierarchies and is able to compute and output a shortest path between any origin and destination within a few miliseconds, whereby the pure route computation takes much less time. Most effort is spent in annotating the route and transmitting the geometry over the network.
Since it is designed with OpenStreetMap compatibility in mind, OSM data files can be easily imported. A demo installation is sponsored by [[Karlsruhe Institute of Technology]] and previously by Geofabrik. OSRM is under active development. OSRM was part of the 2011 [[Google]] [[Summer of Code]] class.<ref>[http://www.google-melange.com/gsoc/project/google/gsoc2011/bharathv/13001 "Improvements to the Open Source Routing Machine (OSRM)."] [http://www.google-melange.com Google Summer of Code 2011]. Accessed May 2012.</ref>
| |||