A Boolean Neural Network Approach for the Traveling Salesman Problem

It is shown that the Boolean-neural network can be used to solve NP-complete problems. The problem under consideration is the traveling salesman problem. The Boolean neural network has been modified to include the iterative procedure for solving combinatorial optimization problems. An architecture that utilizes this modified Boolean neural network (MBNN) is proposed for solving this problem. The simulation results have been found to be comparable to the simulated annealing algorithm (SAA), which is used as a test base. The MBNN implementation involves low hardware complexity, good noise immunity, and fast circuitry. This is very important in real-time systems and commercial job scheduling applications. >

[1]  R. Palmer,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[2]  Judith E. Dayhoff,et al.  Neural Network Architectures: An Introduction , 1989 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  David M. Skapura,et al.  Neural networks - algorithms, applications, and programming techniques , 1991, Computation and neural systems series.

[5]  M. Day,et al.  Contrastive Hebbian learning and the traveling salesman problem , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

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

[7]  W. I. Clement,et al.  Synaptic Strengths For Neural Simulation Of The Traveling Salesman Problem , 1988, Defense, Security, and Sensing.

[8]  David Abramson,et al.  A very high speed architecture for simulated annealing , 1992, Computer.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Mansur R. Kabuka,et al.  A Novel Feature Recognition Neural Network and its Application to Character Recognition , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  Geoffrey E. Hinton,et al.  Connectionist Architectures for Artificial Intelligence , 1990, Computer.