Thank you Ujaval,
I'll try this as well. Would you suggest to run it like a batch process on
all origin-destination pairs, as the one suggested at point 22 of the
tutorial?
Thanks a lot again and have a good weekend!
Francesca
Il giorno ven 6 mag 2022 alle ore 16:47 Ujaval Gandhi <
Hi,
I think the best way is too install Python with Anaconda. Then, you
will need to install geopandas, networkX and possibly pandas and
shapely libraries. I am not sure it it's a good idea to add these in
the Qgis Python distribution.
My algorithm currently uses 1 line input file and 1
You need to do Distance Matrix. See
https://www.qgistutorials.com/en/docs/3/origin_destination_matrix.html
On Fri, 6 May 2022 at 7:33 PM, Francesca Parente via Qgis-user <
qgis-user@lists.osgeo.org> wrote:
> Thank you very much indeed Nicolas, for your inputs and all the suggested
> materials!
>
Thank you very much indeed Nicolas, for your inputs and all the suggested
materials!
I have 50 targets and 532 origins. My goal is to define where is best to go
within the 50 destinations for each starting point - given the actual range
of choices though, so I'm not sure that running a batch
Hi,
How many shortest path calculations are you looking at? You could probably do a
all pairs shortest path dijkstra and filter the results. You could batch
multiple one to many (point to layers) In QGIS using the processing plug-in.
I did create an algorithm using networkX that could be
Hello everyone,
I'd need to identify optimal destinations (within a point layer of
geolocated facilities) for each territory of a given set of possible
origins.
I already calculated a distance matrix between the two point-layers, and
also applied the distance-to-nearest-hub tool to generate a
