Exploring orderliness by self-organization

In an attempt to explore the orderliness by self-organization among populations, we find the idea can be applied to solve the optimization problem. We illustrate the idea and method with many varieties of the travelling salesman problem (TSP) examples. In our method a simple geometric order of the neurons is implicitly designed for the problem. The loci of the cities are represented by proper templates. The solution of the round tour is displayed by self-organization of the templates on these ordered neurons. We test the efficiency of the proposed method by comparing the statistics of simulation results with an another potential methods. Our method can be extended to both problems of multi-dimensional distributed cities and non-straight route lengths between cities.