Services

Start firing your requests up to 5.000 times a day. For free.

Directions

The openrouteservice directions service covers the globe and allows you to compute routes and all sorts of navigation information. To this end, we offer a wide range of travelling options for multiple modes of transport. Amongst these you can choose between car, different bicycle types, walking, hiking, wheelchair and heavy vehicle. Each of these modes uses a is a carefully compiled street network to suite the profiles requirements. To help you individualise your routes even further the API offers the possibility to customise your input with road type restrictions and vehicle characteristics.

Long distance routes

With openrouteservice you are able to determine routes for car and heavy vehicle with distances up to 6.000 km with any kind of options added.

Used by professionals

Openrouteservice’s heavy vehicle routing option has been developed hand in hand with logistics companies to ensure realistic routes all over the globe.

Geocoding

The openrouteservice geocoding api accesses global databases and transforms descriptions of locations, such as place names, street addresses or postal codes, into a normalised description of the location with a point geometry. Additionally our geocoding service offers a reverse geocoding service which does exactly the opposite. It transforms the coordinate of a point into the description of the next enclosing object which surrounds the given coordinate. To obtain more relevant results you may also set a radius tolerance around the requested coordinates.

Locations

Openrouteservice’s locations api helps you find places of interest around or within given location(s). This service has a global coverage and can be used for different kinds of use cases. You may either search for a single or list of category types contained around a point, path or even within a given geofence (refer to swaggerhub for the documentation). Furthermore you are also able to query and gather statistics featuring the amount of certain POIs in an area.

Isochrones

To determine reachability areas from any given location(s) on the map we offer the isochrones service which returns these regions as contours of polygons. You may specify 2 types of input, namely time or distance as well as corresponding intervals. If the input entails a list of points the service will return intersections of the computed isochrones if any exist. Within this API you are able to use the identical set of options that are found in the directions service.
A typical use case of isochrones is figuring out how far an object is able to travel within a given amount of time or distance. One may also want to find out which catchment or community areas a certain location has, e.g. schools or shopping precincts.

Extraordinarily large areas

The underlying technology generating the isochrones allows you to determine huge areas with unusually high performance. Make use of multiple locations at once and let the api find intersections of isochrones for you.

Multiple locations and intersections

To save time you can specify up to 5 locations of interest at once. And if you want to know where the isochrones intersect, simply let the API compute these for you.

Time-Distance Matrix

One to many, many to many or many to one. Openrouteservice’s time-distance matrix service allows you to obtain time and distance information between a set of locations (origins and destinations) and returns them to you in a structured JSON response. This API is extremely convenient and scalable for batch requests determining aggregated metrics of routes (it does not return detailed route information, use the directions api for this use case). Akin to locations and directions, you may specify the transportation mode and compute routes which adhere to certain restrictions, such as avoiding specific road types or object characteristics.
One prominent use case which can be built on top of this service is to easily explore the fastest or shortest combination of a set of destinations which should be reached – this is commonly referred to as the traveling sales person problem.

Up to 10.000 distance pairs

This basically means you are able to request a combination of 100 times 100 origins/destinations at once. Head over to our developers overview and find out how.

Fast response times

We make use of state of art graph traversal algorithms to guarantee stable and performant responses.