ShortestPathFinder - Optimization for Multiple Paths

Hi Don,

This is what we are trying to do: find a suitable place to live for our employees. They must live within a range of say a 45 minutes drive from a number of interesting places (which would be industrial plants). There are about 15 places of interest (for a starter, ideas go up to about 3000 places). In the area live a lot of people and there is a dense road network. I tried to use only the main roads (about 60.000 roads) in our network and used a networkcost calculator to calculate driving distances, much as in this article. I cancelled the computations after two and a half day of processing. My next idea is to create a grid over the area and generate for all interesting points a line from the point to the center of all grids and do a networkcost calculation on just that line. For all the resulting lines I can hopefully generate the "3D" Cost network and calculate the isochones. That, however, implies that for each loop the complete road network should be read over and over again, since the shortestpathfinder only takes one path at the time. Is that a bit of a help to you? Any ideas on solving my problem? Regards, Helmoet.