by christryon » Sat Nov 24, 2012 10:07 pm
True, overall this problem is very tough, but this specific situation (or one that could be limited to a small number of addresses) is not really tough at all given the saturation of the mapping data we now have. The TS problem to visit all addresses in a large number (100's or 1000's) of addresses is really where the problem is.
If i were to try and solve this manually, I would input all the addresses into google maps, then keep reordering them until i had a close to optimal route. Any mapping system today can do the same with a discrete number of addresses, and recalc after each destination is reached.