[pgrouting-users] Multiple Origins/Multiple Destinations

Vicky Vergara vicky at georepublic.de
Thu Mar 30 11:26:21 PDT 2017

Hello Spencer:

Do you mean something like pgr_TSP? that visits all the nodes?

if you mean something like TSP, take into account that TSP is an
NP-problem, so it will not give "the shortest" route that visits all the
nodes, but "a" route that visits all the nodes that is a local minimum.
Suppose you used the pgr_dijkstraCostMatrix as input to pgr_TSP, once you
have the ordering of the visits, you can get the path by calling



On Thu, Mar 30, 2017 at 11:18 AM, Spencer Gardner <spencergardner at gmail.com>

> Is there an efficient strategy for obtaining the shortest route from
> multiple origins to multiple destinations?
> To be clear, I'm *not *talking about returning a shortest route for the
> pairing of each origin to each destination. (This is the current behavior
> when arrays are passed in for start and end vertices.) What I *am *talking
> about is returning a single shortest route that represents the shortest of
> all possibilities between the origin and destination vertices.
> I hope that makes sense.
> Thanks,
> Spencer
> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
> https://lists.osgeo.org/mailman/listinfo/pgrouting-users


Georepublic UG (haftungsbeschränkt)
Salzmannstraße 44,
81739 München, Germany

Vicky Vergara
Operations Research

eMail: vicky at georepublic.de
Web: https://georepublic.info

Tel: +49 (089) 4161 7698-1
Fax: +49 (089) 4161 7698-9

Commercial register: Amtsgericht München, HRB 181428
CEO: Daniel Kastl
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20170330/9dd2b112/attachment.html>

More information about the Pgrouting-users mailing list