Create route /routing from a list of points
Gathering feedback
Sometimes i like to route to more than one point which are stored in Locus. All this points are stored in one folder/list. It whould be great if Locus can generate the shortest route/track, so that i can go to each of this points in an optimal way.
Additional: create route only from selected points.
I think this will be a greate new feature for Locus.
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 :)
Replies have been locked on this page!