Hello,
At the moment we're using the MapQuest Optimize Route API
(http://www.mapquestapi.com/directions/#optimized), which given a list
of points, computes the shortest route, using the first point as the
start and the last point as the end. This is the exactly the
functionality we're
Firing a query like:
http://
{IP_ADDRESS}:5000/trip?loc=18.9457243,72.8237605=18.9457243,72.8237605=18.9414821,72.8284626=18.9457243,72.8237605=18.9629992,72.8175748=18.9352599,72.8371511=19.1227498,72.8932321
The order of the points in the response in via_points object was:
1.
Hi Kieran,
You're correct, OSRM doesn't currently implement the query you want. All the
data you need to answer the question is in the response of the `/table` API.
In theory, supporting this exact situation (fixed start/end nodes) should be
a fairly simple change to the trip plugin.
Hey,
no sadly we don't support this yet. Corresponding ticket is here [1].
Chau suggests a approach in the ticket, but we never investigated if
its actually viable/correct. Let me know if you want to give this a
spin.
Cheers,
Patrick
[1] https://github.com/Project-OSRM/osrm-backend/issues/1623
Hi,
I have used a strategy close to what is described in the mentioned
ticket (see my comment there). It did work for another project to add
this specific feature to an existing TSP solver.
As for the "computationally expensive" side, it is all a matter of
trade-off between computing time
