Parallelism in Binary Hopfield Networks

Some neural networks have been proposed as a model of computation for solving combinatorial optimization problems. The ability to solve interesting classic problems has motivated the use of neural networks as models for parallel computing. In this paper the degree of parallelism of a binary Hopfield network is studied using the chromatic number of the graph G associated to the network. We propose a rule to coloring the vertices of the neural network associated to the Traveling Salesman Problem such that the neurons with the same color can be simultaneously updated.

[1]  Enrique Mérida Casermeiro,et al.  An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem , 2001, Neural Processing Letters.

[2]  Yoshiyasu Takefuji,et al.  Artificial neural networks for four-coloring map problems and K-colorability problems , 1991 .

[3]  Satoshi Matsuda,et al.  "Optimal" Hopfield network for combinatorial optimization with linear cost function , 1998, IEEE Trans. Neural Networks.

[4]  Sy-Yen Kuo,et al.  A New Technique for Optimization Problems in Graph Theory , 1998, IEEE Trans. Computers.

[5]  Mengkang Peng,et al.  An Investigation into the Improvement of Local Minima of the Hopfield Network , 1996, Neural Networks.

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

[7]  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.

[8]  José Muñoz-Pérez,et al.  Design and analysis of maximum Hopfield networks , 2001, IEEE Trans. Neural Networks.

[9]  Yi Sun.  A generalized updating rule for modified Hopfield neural network for quadratic optimization , 1998, Neurocomputing.

[10]  G. Pawley,et al.  On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank , 2004, Biological Cybernetics.

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

[12]  Marimuthu Palaniswami,et al.  Neural techniques for combinatorial optimization with applications , 1998, IEEE Trans. Neural Networks.

[13]  George Papageorgiou,et al.  Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing , 1998, Eur. J. Oper. Res..

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

[15]  Kuo-Chun Lee,et al.  Finding Knight's Tours on an M×N Chessboard with O(MN) Hysteresis McCulloch-Pitts Neurons , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[16]  Jiahai Wang,et al.  An improved optimal competitive Hopfield network for bipartite subgraph problems , 2004, Neurocomputing.

[17]  S Yi,et al.  A NEW TECHNIQUE FOR OPTIMIZATION PROBLEMS IN GRAPH THEORY , 2005 .

[18]  Chee-Kit Looi,et al.  Neural network methods in combinatorial optimization , 1992, Comput. Oper. Res..

[19]  Jun Wang,et al.  A general methodology for designing globally convergent optimization neural networks , 1998, IEEE Trans. Neural Networks.

[20]  Amparo Ruiz-Sepúlveda,et al.  Improving local minima of Hopfield networks with augmented Lagrange multipliers for large scale TSPs , 2000, Neural Networks.

[21]  S. C. Lee,et al.  Sensor value validation based on systematic exploration of the sensor redundancy for fault diagnosis KBS , 1994, IEEE Trans. Syst. Man Cybern..