Tonight I was just dreaming. Dreaming and wondering. Dreaming of a day when I would leave for the trip of my life. Wondering how many miles would be the shortest distance to touch tires in each of the 48 states? I Googled it and found out that it was a problem that dates back several hundred years. It has even been given the name of “Travelling salesman problem”. In short, what is the shortest route he must go to cover all the cities he must cover.
The Travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find the shortest possible tour that visits each city exactly once. It is a special case of the Traveling purchaser problem. Wikipedia has a full discussion of this problem if you would like to study it in depth. I for one will leave this to others.
I have months to plan my route, but a quick search returned this one mans effort with which I am fairly pleased. His goal was to touch 48 states in 10 days. His 8,000 mile plus trip puts him on his motorcycle for 800 plus miles per day. I don’t like driving half that distance per day in a car. This is a very interesting read. I didn’t see his name attached to his post or I would give him credit for it.
I would hope to do the trip in 5 months on a $50 per day budget. Not that I have to take the shortest route or make the trip all in one trip for that matter. Main object of the trip is to see things I’ve never seen and places I’ve never been and meet people I’ve never met. I hope your one of them.