...
A simple way to explain how this works is, if you can break a box of size 100 into two boxes of size 50. The same effort to run M trials on the large box allows you to run N trials on each of the smaller boxes. So instead of evaluating only M trials in the big box you are effectively seeing (1/4)*M**2 trials (or M-squared over 4). So if you can break the problem down into many decoupled pieces you can get a much better answer by examining many small problems. However in the real world you will have some pieces that are decoupled and independent of the rest of the problem, but usually you can divide the world down into "lightly-coupled" pieces. With the mesh solution you can generate Service Area Boundary BNA files, or build them hand. This will link take you to an article about creating SAB files in the form of Cluster Boundaries:Cluster bounds in Mesh What the solution does is separate the samples by which polygon(BNA) they are in.
A scheduling algorithm is used to schedule the solutions of the individual polygons in such a way that the first polygons solved may also help provide capacity to some of the later scheduled polygons. So the solution should be improved by breaking it down into separate polygons, solving them one at a time, but using the results of previously solved parts of the problem to influence the later solved polygons. Separating out any decoupled samples is good, and making many equally sized regions is also good to do.
...