A Fast Algorithm for Four -Coloring Map Problems Based on Chaos Neural Network

摘要：

This paper presents a fast algorithm based on the transient chaotic neural network (TCNN) model for solving four-coloring map problems with digital computers By eliminating the components of the eigenvectors with eminent negative eigenvalues of the weight matrix, this proposed method can avoid oscillation and offer a considerable acceleration of converging to the optimal solution when TCNN is used to search the optimal solution of four-coloring map problems. Numerical simulations of fourcoloring map problem show that TCNN with modified weight matrix requires less iteration than TCNN with standard weight matrix before reaching optimal solution.

关键词： Neural network transient chaos eigenvector four-coloring map problem

作者: Wang Xiu-hong Wang Zheng-ou Qiao Qing-li

作者单位: School of management Tianjin University,Tianjin ,PRC. 300072 School of Life Science & Biotechnology Shanghai Jiao Tong University,Shanghai, PRC.200030

会议类型: 国际会议

会议名称: 8th International Conference on Neural Information Processing(ICONIP 2001)(第八届国际神经信息处理大会)

会议地点: 上海

会议语种:英文

页码: 1472-1476

在线出版日期: 2001-11-14（万方平台首次上网日期，不代表论文的发表时间）