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.

[1]  Richard Hans Robert Hahnloser,et al.  Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit , 2000, Nature.

[2]  H. Sebastian Seung,et al.  Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks , 2003, Neural Computation.

[3]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[4]  C. Koch,et al.  Recurrent excitation in neocortical circuits , 1995, Science.

[5]  Richard H. R. Hahnloser,et al.  On the piecewise analysis of networks of linear threshold neurons , 1998, Neural Networks.

[6]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[7]  J. Ramanujam,et al.  Mapping combinatorial optimization problems onto neural networks , 1995, Inf. Sci..

[8]  Stan Z. Li,et al.  Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers , 1996, IEEE Trans. Neural Networks.

[9]  Hidetomo Ichihashi,et al.  A simple steepest descent method for minimizing Hopfield energy to obtain optimal solution of the TSP with reasonable certainty , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[11]  Teuvo Kohonen,et al.  Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[12]  Alan F. Murray,et al.  IEEE International Conference on Neural Networks , 1997 .

[13]  H. K. Hartline,et al.  SPATIAL SUMMATION OF INHIBITORY INFLUENCES IN THE EYE OF LIMULUS, AND THE MUTUAL INTERACTION OF RECEPTOR UNITS , 1958, The Journal of general physiology.

[14]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[15]  Xiaohui Xie,et al.  Selectively Grouping Neurons in Recurrent Networks of Lateral Inhibition , 2002, Neural Computation.

[16]  Heiko Wersing,et al.  Dynamical Stability Conditions for Recurrent Neural Networks with Unsaturating Piecewise Linear Transfer Functions , 2001, Neural Computation.

[17]  A. Tesi,et al.  New conditions for global stability of neural networks with application to linear and quadratic programming problems , 1995 .

[18]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Zhang Yi,et al.  A columnar competitive model for solving combinatorial optimization problems , 2004, IEEE Transactions on Neural Networks.

[21]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[22]  K. Hadeler,et al.  Qualitative behaviour of some simple networks , 1996 .

[23]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[24]  Shuzhi Sam Ge,et al.  On parameter settings of Hopfield networks applied to traveling salesman problems , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[25]  Zhang Yi,et al.  Multistability Analysis for Recurrent Neural Networks with Unsaturating Piecewise Linear Transfer Functions , 2003, Neural Computation.

[26]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[27]  Helge Ritter,et al.  A Spatial Approach to Feature Linking , 1990 .

[28]  Kay Chen Tan,et al.  Qualitative analysis for recurrent neural networks with linear threshold transfer functions , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[29]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[30]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[31]  Jianfeng Feng,et al.  Lyapunov Functions for Neural Nets with Nondifferentiable Input-Output Characteristics , 1997, Neural Computation.

[32]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Kay Chen Tan,et al.  Dynamics analysis and analog associative memory of networks with LT neurons , 2006, IEEE Transactions on Neural Networks.