The TSP is the problem of a salesman who wants to find, starting from his home town, a shortest possible trip through a given set of customer cities and to return to his home town. Given a set of n nodes and distances for each pair of nodes, find a roundtrip of minimal total length visiting each node exactly once. Given a set of n nodes and distances for each pair of nodes, find a roundtrip of minimal total length visiting each node exactly once. The method developed incorporates message parsing between nodes in parallel. This is implemented as dilating circles centred on each node.
Any comments welcome.