NEW METHOD OF SOLVING THE TRAVELING SALESMAN PROBLEM-BASED ON REAL-SPACE RENORMALIZATION THEORY

We propose a new method of solving the traveling salesman problem in t his Letter. A new technique, whose concept comes from real space renor malization theory, is introduced to solve the combinatorial problem of operation research. Examples of the calculation applied from the 48-c ities to the 532-cities problem and a theoretical estimate of the comp utational effort are presented. It was found that the present method b elongs to the group of the fastest computing algorithm of the travelin g salesman problem. Throughout this work we show an interesting cross of operation research and statistical physics.