I have done a number of applications that have a flavor of the Traveling Salesman Problem (TSP). That is, they concern themselves with visiting a number of locations in an efficient manner. None of these applications have ever concerned themselves…

Third Landing
Investigations in Data

I have done a number of applications that have a flavor of the Traveling Salesman Problem (TSP). That is, they concern themselves with visiting a number of locations in an efficient manner. None of these applications have ever concerned themselves…

In a couple of previous posts, I reviewed the concept of using space filling curves as a heuristic for producing decent solutions for the traveling salesman problem (TSP). The attraction of this approach to me was the simplicity of implementation.…

As mentioned in a previous post, I had taken an interest in space filling curves as a method for approaching the traveling salesman problem. Bartholdi (link) presented an algorithm (p. 20) for generating such curves written in Modula-2. In this…

A number of projects I have done have had the flavor of the Traveling Salesman Problem (TSP). That is, they essentially look to solve a problem of visiting a number of sites of interest in an efficient manner. These include…

Whenever I make any sort of reference to the traveling (travelling) salesman problem (TSP), I can never remember the spelling of the adjective. I was particularly vexed when I used the word in the title of one of the sites,…

Top