On Wed, 18 Jul 2007 12:10, Mark Rossman wrote:
First off I think the largest amount of time would be to calculate the
distance between each possible combination of points, and I think most
people wouldn't really have that many points anyway. Now if UPS
decides to offload their routing onto the cell phones of their drivers
it would take forever, but most people don't really go that many
places.
Also if you set up the software to solve the TSP problem as an IP,
then used the LP relaxation as your actual problem you would greatly
reduce computation time, and get a list of possible next stops ordered
based on their weight, most of the time it would give you a near
optimal solution.
I think you said that much better than I did.
--Tim
_______________________________________________
OpenMoko community mailing list
[email protected]
http://lists.openmoko.org/mailman/listinfo/community
