A quick google or wikipedia search for "TSP" or "travelling salesman problem" would yield some very interesting literature on this...the wikipedia article paricularly so. :)
-G On Jan 7, 2009, at 6:02 PM, harvs wrote: > > Hi, > > I wonder if anyone knows if this is possible. > > I have a list of addresses with post codes...e.g.say 15 addresses. > I need to travel to all these addresses from my place of work in the > shortest time possible. Is there a way to find out the most efficient > route to get to all these addresses. ie put them in some sort of order > in terms of where the location so that i cover the least distance? > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/Google-Maps-API?hl=en -~----------~----~----~----~------~----~------~--~---
