I'm trying to find optimal area of interest (AOI) polygons to make request for image tiles. I have my service territory (an irregular shape) tiled and each tile knows how many request would be required as a numeric attribute. What I want to do is group the tiles so that each group has as close to a sum of 150,000 without going over. Then the outline of each group forms a polygon that can be used as an AOI.
The Dissolver just does too much. All the polygons are adjacent.
Or I could have one giant polygon and figure out a way to split it, and if the value (sum) is still too large, split it again.
Ideas?