[pgrouting-users] dijkstra for MANY sources
daniel at georepublic.de
Mon Nov 14 16:05:01 PST 2016
I would use the pgr_drivingDistance function starting from your 11 schools
(containing the area of your 15.000 students):
Then you get the distance for each point in your network area to each
school, and you jut need to select the school with the minimum distance.
On Tue, Nov 15, 2016 at 7:08 AM, Stephen Woodbridge <woodbri at swoodbridge.com
> On 11/14/2016 2:12 AM, Brian DeRocher wrote:
>> Hey there,
>> Can someone give me some guidance. I'm looking for the right
>> algorithm to use when solving this problem. I want to find the
>> distance and shortest path to 11 schools for about 15,000 students.
>> Does the many to many flavor of dijkstra scale up to these numbers?
>> Is there a better way to solve this?
> Hi Brian,
> It has a many to one function.
> Regarding performance, that depends on a lot of issues but I would think
> if your limiting your edge table to the roads in the school district that
> you should get reason able performance.
> You might want to try running it with 10, 100, 1,000, 15,000 so you have
> some idea of the performance at various numbers of nodes.
> you will need to map the locations to the node ids in the network, then
> pass the node ids to the function.
> Ask if you need more explicit help.
> -Steve W
> This email has been checked for viruses by Avast antivirus software.
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
Georepublic UG & Georepublic Japan
eMail: daniel.kastl at georepublic.de
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Pgrouting-users