[OSRM-talk] Shortest route given start and end point
julien at coupey.fr
Wed Dec 9 22:07:57 UTC 2015
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 and solution quality. My experience is
that 1000's can still be tackled in a matter of seconds with very decent
Hope this can help,
Le 09/12/2015 22:32, Patrick Niklaus a écrit :
> no sadly we don't support this yet. Corresponding ticket is here .
> 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
>  https://github.com/Project-OSRM/osrm-backend/issues/1623
> On Wed, Dec 9, 2015 at 11:38 AM, Kieran Caplice
> <kieran.caplice at temetra.com> wrote:
>> 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
>> looking for, but MapQuest is quite expensive, slow, and doesn't support
>> large batches (we need to support a couple of thousand points).
>> From what I've been told, OSRM doesn't support this - it only supports
>> travelling salesman (trip), using the same start and end point, or viaroute,
>> which doesn't do any optimisation. I'm wondering how easy/possible would it
>> be to implement in OSRM, or is there any pre/post processing that we can do
>> to achieve this?
>> Thanks in advance.
>> Kind regards,
>> Kieran Caplice
>> OSRM-talk mailing list
>> OSRM-talk at openstreetmap.org
> OSRM-talk mailing list
> OSRM-talk at openstreetmap.org
More information about the OSRM-talk