In the spirit of this site, which 'borrows' and adapts software I have 'borrowed' some 'Travelling Salesman Problem' software and adapted it for the TOMTOM.
Does anyone want to give it try? See whether it is any good as it is?
A wee application to sort the locations in an itinerary for shortest route distance (as the crow flies). Starting and returning to the first point in the itinerary.
I'm using it on a truck core on a 540. It almost certainly works on many other machines.
I'm sure you all know the golden rule - Back up your TOMTOM
Download a zip file from "http://www.megaupload.com/?d=RR62M38N" 270kB
Unpack the .zip file
It contains the folder 'TravellingCrow'
which contains two folders 'sdkregistry' and 'TCrow'
Copy those two folders to the root directory on your sdcard (It won't run on the internal disk)
Reboot your TT
Create an itinerary with your points in it the first location being your start/end point. Save it as route 'Tc'
Go to the (new) fourth page of the main menu and click on the 'Travelling Crow' icon.
Nothing will happen! ... don't panic -- count to 10
Go back to the itinerary menu and load the new itinerary 'Tcrow'. Which starts at the first location in your given list and finishes at a location nearly back at that starting location (I never got round to actually adding the final return point into the itn file).
You may want to check that the waypoints/destinations are still set right for you.
Go on a short trip :-)
If you need a one way trip, say from London to Glasgow, then add (at the end of Tc) points in Trondheim, Copenhagen and Munich. These should form a return path that can be deleted from the end of the 'TCrow' itinerary.
It seems to do a bloody good job. Which is surprising, given:
1) It has no idea where the roads go -
It won't know about uncrossable rivers and impassable mountain ranges in the middle of your locations. If needed, placing extra way points on main routes and re-running it can improve its results on actual road journeys.
2) I don't do spherical geometry -
Each longitude value is multiplied by the cos of the first latitude value.
(I.E. you may get strange results for global or polar crossing tours)
3) The route finding algorithm is only approximate -
But very, very good. Quick, too.
Example: 47 points in and around Sarf London
Alphabetical order quickest route for car 20:31 hours 482 miles
Sorted quickest route for car 9:18 hours 201 miles
The tomtom only allows 48 points in an itinerary -
So I set that as a limit BUT PROBABLY DON'T CHECK FOR IT BEING EXCEEDED. CRASH!
With enough feedback and a bit of help I may write a decent interface with some more options