Project-OSRM/osrm-backend
Osrm Backend
osrm-backend is a high-performance routing engine and backend service designed to calculate shortest paths and travel distances using OpenStreetMap data. It functions as a graph-based pathfinding server and map data processing tool that converts raw map data into specialized formats optimized for high-speed routing calculations.
The system provides specialized route calculation for different transport modes, allowing for the definition of custom routing profiles with specific speed limits and travel constraints. It enables high-performance route planning and travel time estimation across large road networks with millisecond response times.
The engine utilizes map data processing and import tools to prepare road networks for navigation. It supports the calculation of the fastest routes and distance estimations between multiple coordinates.
Features
- Road Network Routing - Provides high-performance calculation of optimal paths across large-scale road networks using OpenStreetMap data.
- Geospatial Data Importers - Provides tools to import and convert raw OpenStreetMap data into specialized formats optimized for high-speed routing.
- Map Data Conversion Tools - Ships a specialized tool for importing and converting raw map data into formats optimized for routing.
- Map Data Processing - Processes raw map data into specialized formats required for high-speed path calculations.
- Geographic Routing Engines - Functions as a high-performance geographic routing engine specifically designed for OpenStreetMap data.
- Graph-Based Pathfinding Servers - Provides a graph-based pathfinding server utilizing contraction hierarchies for millisecond-latency routing.
- Routing Backend Services - Operates as a specialized routing backend service that processes map data to provide fast route calculations.
- Contraction Hierarchies - Uses contraction hierarchy preprocessing to precalculate shortcuts and achieve millisecond response times for shortest path queries.
- Network Distance Estimations - Determines travel distances between coordinates based on real road networks and specific transport modes.
- Fastest Route Calculation - Computes the most efficient path between locations based on network data and various transport modes.
- High-Performance Pathfinding - Computes optimal routes across large-scale road networks with millisecond response times for real-time integration.
- High-Performance Routing Calculations - Provides high-performance route calculation across large networks with millisecond response times.
- Multi-Level Dijkstra Routing - Implements multi-level Dijkstra routing to efficiently find long-distance paths by restricting the search space.
- Travel Time Estimation - Determines precise travel distance and time between coordinates based on real-world road network data.
- Memory-Mapped File Access - Employs memory-mapped file access to load preprocessed routing graphs from disk for high-speed read performance.
- Routing Constraint Tables - Provides customizable route tables to adjust path calculations based on transport-specific constraints without rebuilding graphs.
- Graph Representations - Implements an edge-based graph representation to optimize distance and time calculations across the road network.
- Geospatial Graph Partitioning - Implements cell-based partitioning to localize data access and reduce memory usage for global road networks.
- Routing Profile Configurations - Allows definition of routing profiles to specify speed limits and travel constraints for various transport modes.
- Transport Routing Profiles - Supports custom routing profiles to account for different vehicle types, speed limits, and accessibility constraints.
- Geospatial and Vector Mapping - Open Source Routing Machine backend.
- Geospatial Mapping - C++ backend for open source routing.
- Programming Libraries - Routing engine for C++ applications.
