The essential point of the dynamics of the chaotic Brownian network which c
an always find the shortest path (global minimum of energy) for almost arbi
trary initial conditions in the traveling salesman problem, is discussed. A
continuous-time model with the same character is proposed to study the mec
hanism allalytically.