Open Source Routing Machine

Open Source Routing Machine
Original author(s)Dennis Luxen, Christian Vetter
Stable release
6.0.0[1] Edit this on Wikidata / 21 April 2025; 12 days ago (21 April 2025)
Repository
Written inC++
Operating systemLinux, FreeBSD, OS X, Windows
TypeRoute planning software
LicenseSimplified BSD License[2]
Websiteproject-osrm.org Edit this at Wikidata

The Open Source Routing Machine (abbreviated OSRM) is an open-source route planning library and network service. Written in high-performance C++, OSRM runs on the Linux, FreeBSD, Windows, and macOS platforms. It is designed for compatibility with OpenStreetMap's road network data. FOSSGIS operates a free-to-use server that powers walking, cycling, and driving directions on OSM's homepage.

History

[edit]

OSRM powered Mapbox's navigation offerings during the 2010s.[3] OSRM participated in the 2011 Google Summer of Code.[4] In February 2015, OSRM was integrated into OpenStreetMap's homepage alongside two other routing engines, GraphHopper and Valhalla.[5][6] In 2025, a team at Roskilde University and the University of Waterloo used OSRM to solve the travelling salesman problem for a dataset of 81,998 bars from South Korea's National Police Agency, breaking a record set in 2021.[7]

Architecture

[edit]

OSRM implements multilevel Dijkstra's algorithm (MLD) as well as another routing algorithm, contraction hierarchies (CH), which is better suited for very large distance matrices. Shortest path computation on a continental sized network can take up to several seconds if it is done without a so-called speedup-technique. Via the CH preprocessing pipeline, OSRM can compute and output a shortest path between any origin and destination within a few milliseconds, whereby the pure route computation takes much less time. Most effort is spent in annotating the route and transmitting the geometry over the network. This high performance facilitates use cases such as user-interactive route manipulation.

In addition to solving the shortest path problem for road networks, OSRM also includes a map matching service and a travelling salesman problem solver for generating distance matrices.

References

[edit]
  1. ^ "Release 6.0.0". 21 April 2025. Retrieved 27 April 2025.
  2. ^ "osrm-backend/LICENSE.TXT at master · Project-OSRM/osrm-backend · GitHub". GitHub. 26 April 2020.
  3. ^ Luxen, Dennis (30 January 2014). "Smart Directions Powered by OSRM's Enhanced Graph Model". maps for developers. Washington, D.C.: Mapbox. Retrieved 3 May 2025.
  4. ^ "Improvements to the Open Source Routing Machine (OSRM)". Archived from the original on 2013-12-19.
  5. ^ Filney, Klint (11 November 2013). "Out in the Open: How to Get Google Maps Directions Without Google". Wired. Archived from the original on 11 November 2013. Retrieved 11 November 2013.
  6. ^ "Routing on OpenStreetMap.org". OpenStreetMap Blog. Cambridge: OpenStreetMap Foundation. Archived from the original on 1 March 2015. Retrieved 28 April 2015.
  7. ^ "korea81998". Traveling Salesman Problem. Waterloo, Ontario: University of Waterloo. 9 April 2025. Retrieved 3 May 2025.

As of 18 May 2012, this article is derived in whole or in part from Open Source Routing Machine. The copyright holder has licensed the content in a manner that permits reuse under CC BY-SA 3.0 and GFDL. All relevant terms must be followed.

Further reading

[edit]
[edit]
Stub icon

This free and open-source software article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Open_Source_Routing_Machine&oldid=1288642452"