An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem

In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical TSP onto a single-layered recurrent neural network by embedding the constraints of the problem directly into the dynamics of the network. The proposed method differs from the classical Hopfield network in the update of state dynamics as well as the use of network activation function. Furthermore, parameter settings for the proposed network are obtained using a genetic algorithm, which ensure a stable convergence of the network for different problems. Simulation results illustrate that the proposed network performs better than the classical Hopfield network for optimization. r 2007 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2008
• Where: IJON
• Authors: Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang, Chi Keong Goh
• Keywords: Classical Hopfield Network, IJON 2008, Recurrent Network, Recurrent Neural Network