The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.