Approach of using a density equalizing function to self-organizing learning for solving travelling salesman problem

Proposes a new approach which requires neither neuron addition nor deletion, and at the same time, N neurons are sufficient to solve an N-city travelling salesman problem. the authors begin with a description of their model, and then results for applying the model to solve the 30-city problem from Hopfield are presented. Results of practical testing show that the present approach always converges. It has the highest chance to achieve the optimal solution, and gives the best most probable solution, as compared to other self-organizing algorithms