Moje představa je, že si do nějaké složky nakopíruji body (například památky ve městě nebo body, kterými musím projet třeba při soutěži). A pomocí funkce "Trasa po bodech zájmu" by mi pak Locus automaticky vytvořil nejkratší okružní trasu, která by zahrnovala všechny tyto body. V ideálním případě by pak body měly být zahrnuty i do hlášení navigace, abych věděl, že projíždím okolo něj.
Než zkusím vytvořit "nápad", tak se chci zeptat, zda by bylo něco takového vůbec možné naprogramovat. Případně, mohl poprosit o pomoc s vytvořením "nápadu" v angličtině?
I like this idea 
Hi,
Thare is workaround how to do it:
Hi,
Thare is workaround how to do it:
Hello,
whtat you explain means that i have to add all points manualy to the route? I do not have only 5 Points, i speak about more than 100 ;-)
I find some similar feature in Garmin Basecamp, there you can create a route from a list of points, abut not in the shortest order, only ordert by name... :-/
Hello,
whtat you explain means that i have to add all points manualy to the route? I do not have only 5 Points, i speak about more than 100 ;-)
I find some similar feature in Garmin Basecamp, there you can create a route from a list of points, abut not in the shortest order, only ordert by name... :-/
Hi
Yes, it means that you have to add points manually. But more then 100? thats different story. Maybe anybody from community knows some tool?
Hi
Yes, it means that you have to add points manually. But more then 100? thats different story. Maybe anybody from community knows some tool?
brouter only manages "from", "to" and 9 via points.... not enough for 100 :-(
brouter only manages "from", "to" and 9 via points.... not enough for 100 :-(
its not necessary to have it offline.... is the calcualtion is done online will be also fine... ;-)
its not necessary to have it offline.... is the calcualtion is done online will be also fine... ;-)
I think that this is a "Travelling Salesman Problem". The difficulty of that problem (seleceting the shortest route via N points) is O(N!). So work required grows as fast as the factorial of N. 100! = 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000
I think that this is a "Travelling Salesman Problem". The difficulty of that problem (seleceting the shortest route via N points) is O(N!). So work required grows as fast as the factorial of N. 100! = 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000
Nice :)
In case you want to also "optimize" route between points, then Stebu is perfectly right. For this already exists topic here http://help.locusmap.eu/responses/route_waypoints_optimization_tsp
Nice :)
In case you want to also "optimize" route between points, then Stebu is perfectly right. For this already exists topic here http://help.locusmap.eu/responses/route_waypoints_optimization_tsp
Talk about connect point to point from a given list.
"...All this points are stored in one folder/list"
means
look in line 1 for first point, look to line 2 for point 2...
or calcualtion with an algorithm
like "go from sw to NE from nearest point to point"
what ever - how many people will use this?
baoiva shared this idea 1 year ago
http://help.locusmap.eu/responses/route_waypoints_optimization_tsp
= 2 votes...
Well,
happy voting :)
Talk about connect point to point from a given list.
"...All this points are stored in one folder/list"
means
look in line 1 for first point, look to line 2 for point 2...
or calcualtion with an algorithm
like "go from sw to NE from nearest point to point"
what ever - how many people will use this?
baoiva shared this idea 1 year ago
http://help.locusmap.eu/responses/route_waypoints_optimization_tsp
= 2 votes...
Well,
happy voting :)
Dobrý den Josefe,
tento nápad nám leží na stole už 11 let, viz https://help.locusmap.eu/topic/create-route-routing-from-a-list-of-points... Bohužel jeho implementace vázne jednak z důvodu minimálního zájmu (dva hlasy za celou existenci), druhak z důvodu technické náročnosti, vyžadující zásadní změny routeru. Zamerguji tedy váš nápad do původního a držím palce.
Dobrý den Josefe,
tento nápad nám leží na stole už 11 let, viz https://help.locusmap.eu/topic/create-route-routing-from-a-list-of-points... Bohužel jeho implementace vázne jednak z důvodu minimálního zájmu (dva hlasy za celou existenci), druhak z důvodu technické náročnosti, vyžadující zásadní změny routeru. Zamerguji tedy váš nápad do původního a držím palce.
Replies have been locked on this page!