On Jan 7, 5:59 pm, Gregory Short <[email protected]> wrote: > Unfortunately, that (would-be awesome) example seems to be broken for > now, at least on OS X in both Safari and Firefox.
Works for me (4 locations) FF, IE on WinXP. > BpTspSolver not > being defined or some such. I didn't bother to investigate any > further. I'm curious, though...does that work based on GDirections, Uses GDirections. > i.e. following roads and such, or does it use great-circle distances? > I couldn't find out for myself, of course, since it chokes. ;) > > -G > > On Jan 7, 2009, at 7:19 PM, [email protected] wrote: > > > > > On Jan 7, 4:31 pm, Gregory Short <[email protected]> wrote: > >> 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. :) > > > Or even a search of this group: > >http://groups.google.com/group/Google-Maps-API/search?group=Google-Ma... > > > Yields an implementation on Google Maps: > >http://groups.google.com/group/Google-Maps-API/msg/a61bafe7ca993e6f > > > -- Larry > > >> 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?- Hide quoted text - > > >> - Show quoted text - --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
