Re: [OSM-talk] Path with Pit Stops
MapFactor Navigator Free does this. It's free with maps based on OSM data and runs out of the box without problems on Windows PC and Windows Mobile. http://wiki.openstreetmap.org/wiki/MapFactor_Navigator_Free On Fri, Feb 11, 2011 at 1:33 PM, Esben Stien wrote: > > Is there some kind of application that can help me with plotting the > smartest route in a set of points, if you're supposed to visit all the > points? > > Imagine a salesman, who has to visit 10 locations. Is there some > software that can assist me in visiting these 10 locations the smartest > and shortest way?. > > Any pointers?. ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
On Sat, Feb 12, 2011 at 10:34 AM, Steve Bennett wrote: > Anyway, there's also this to look at: > > http://sourceforge.net/apps/mediawiki/travelingsales/index.php?title=Main_Page Oh, just saw Richard W had already posted that link. Thought he posted this one: http://en.wikipedia.org/wiki/Travelling_salesman_problem Steve ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
On Sat, Feb 12, 2011 at 9:43 AM, Gregory wrote: > Actually I got in the 2nd year of my ugrad Computer Science course. > I like to remind people it is impossible* to solve** the travelling salesman > for even 10 cities without spending several years of computer processing. Well, 20 cities maybe. 10 only gives 3.6 million possible routes, computable in under a second. Anyway, there's also this to look at: http://sourceforge.net/apps/mediawiki/travelingsales/index.php?title=Main_Page Steve ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
On 11 February 2011 19:30, Elizabeth Dodd wrote: > On Fri, 11 Feb 2011 19:33:52 +0100 > Esben Stien wrote: > > Imagine a salesman, who has to visit 10 locations. Is there some > > software that can assist me in visiting these 10 locations the > > smartest and shortest way?. > > > > Any pointers?. > > There would be thousands of solutions to this puzzle, as it is a task > usually given to Computer Science students in the first year of their > course. > > Actually I got in the 2nd year of my ugrad Computer Science course. I like to remind people it is impossible* to solve** the travelling salesman for even 10 cities without spending several years of computer processing. *impossible, well nobody has an algorithm yet, thought they would be amazing and mega rich instantly. I guess some people might be working on it. **solve, be sure that you have the smartest/shortest way. The solutions/algorithms that are used make good attempts, and some will give you a result as good as you would choose manually so don't worry too much. -- Gregory o...@livingwithdragons.com http://www.livingwithdragons.com ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
Richard Weait writes: > http://wiki.openstreetmap.org/wiki/Traveling_salesman Thanks. I'll take a look at that. -- Esben Stien is b0ef@e s a http://www. s tn m irc://irc. b - i . e/%23contact sip:b0ef@ e e jid:b0ef@n n ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
If you wanted to do the routing analysis yourself, you could also use the following tools: pgRouting (PostGIS/Postgres) http://www.pgrouting.org/ VirtualNetwork (routing functionality in Spatialite) http://www.gaia-gis.it/spatialite-2.3.1/spatialite-network-2.3.1.html A service is definitely easier, but there are some pretty good tools available... David. On Fri, Feb 11, 2011 at 1:30 PM, Elizabeth Dodd wrote: > On Fri, 11 Feb 2011 19:33:52 +0100 > Esben Stien wrote: > >> Is there some kind of application that can help me with plotting the >> smartest route in a set of points, if you're supposed to visit all the >> points? >> >> Imagine a salesman, who has to visit 10 locations. Is there some >> software that can assist me in visiting these 10 locations the >> smartest and shortest way?. >> >> Any pointers?. > > There would be thousands of solutions to this puzzle, as it is a task > usually given to Computer Science students in the first year of their > course. > > ___ > talk mailing list > talk@openstreetmap.org > http://lists.openstreetmap.org/listinfo/talk > ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
On Fri, 11 Feb 2011 19:33:52 +0100 Esben Stien wrote: > Is there some kind of application that can help me with plotting the > smartest route in a set of points, if you're supposed to visit all the > points? > > Imagine a salesman, who has to visit 10 locations. Is there some > software that can assist me in visiting these 10 locations the > smartest and shortest way?. > > Any pointers?. There would be thousands of solutions to this puzzle, as it is a task usually given to Computer Science students in the first year of their course. ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
Hi Ant and Richard, Thanks for the information. This isn't actually going into a we based service. It is is based on data I have on people's trips, so I can easily adjust the number of requests I send in a day so as to keep it at its current resource use level. Dan On 02/11/2011 10:36 AM, Antony Pegg wrote: Barely any restrictions Check this page for full details: http://developer.mapquest.com/web/products/open/directions-service HTH Ant (the Limey) ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
Barely any restrictions Check this page for full details: http://developer.mapquest.com/web/products/open/directions-service HTH Ant (the Limey) ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
Hi Richard, Are you aware if they have a terms of use for these services? I can't find any on the link you sent, or on the MapQuest Open Platform Web Services page. I have an academic research project that this is perfect for, but I don't want to abuse my privileges. :-) Dan On 02/11/2011 09:51 AM, Richard Weait wrote: On Fri, Feb 11, 2011 at 1:33 PM, Esben Stien wrote: Is there some kind of application that can help me with plotting the smartest route in a set of points, if you're supposed to visit all the points? Imagine a salesman, who has to visit 10 locations. Is there some software that can assist me in visiting these 10 locations the smartest and shortest way?. Any pointers?. This is called the "traveling salesman" problem. ;-) Have a look at the wiki: http://wiki.openstreetmap.org/wiki/Traveling_salesman and the service built on OSM data at MapQuest http://open.mapquestapi.com/directions/ ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
Re: [OSM-talk] Path with Pit Stops
On Fri, Feb 11, 2011 at 1:33 PM, Esben Stien wrote: > > Is there some kind of application that can help me with plotting the > smartest route in a set of points, if you're supposed to visit all the > points? > > Imagine a salesman, who has to visit 10 locations. Is there some > software that can assist me in visiting these 10 locations the smartest > and shortest way?. > > Any pointers?. This is called the "traveling salesman" problem. ;-) Have a look at the wiki: http://wiki.openstreetmap.org/wiki/Traveling_salesman and the service built on OSM data at MapQuest http://open.mapquestapi.com/directions/ ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
[OSM-talk] Path with Pit Stops
Is there some kind of application that can help me with plotting the smartest route in a set of points, if you're supposed to visit all the points? Imagine a salesman, who has to visit 10 locations. Is there some software that can assist me in visiting these 10 locations the smartest and shortest way?. Any pointers?. -- Esben Stien is b0ef@e s a http://www. s tn m irc://irc. b - i . e/%23contact sip:b0ef@ e e jid:b0ef@n n ___ talk mailing list talk@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk
