Method to solve the travelling salesman problem using the inverse of diffusion process

The travelling salesman problem, in which the best route between cities to be visited is chosen from a large number of possible routes, is reconsidered using the time reversal of physical dynamics, e.g. an inverse of the diffusion process. Information mediators assigned to every city diffuse as time passes, eventually merging into a single peak. When the time reversal of the dynamics is performed, the single peak splits into two peaks, each of which splits into two peaks, eventually resulting in peaks at all the cities. The hierarchy of the above bifurcations tells us how the distribution of the cities looks as the level of focus changes. This scheme is applied to a travelling salesman problem involving 532 US cities, the result of which is a 17% longer path than the optimal path.