Optimized multi-stop route
POST/v2/route/optimized
Finds the most efficient order to visit a list of stops using a Travelling Salesman Problem (TSP) solver. The first and last stops are fixed anchors (e.g. depot → depot); only the intermediate stops are reordered. Minimum 4 stops required.
The response includes a stops array in optimized visit order. Each
entry has an original_index field that maps back to the input stops
array, so you can label the stops with your own data.
Use this for delivery routing, field-visit planning, or any scenario where a driver has multiple addresses to visit in one trip.
Request
Responses
- 200
- 400
- 404
- 422
- 503
Optimized route calculated
Fewer than 4 stops or invalid request body
No route could be found between the stops
A stop coordinate could not be snapped to the road network
Routing service temporarily unavailable