期刊文献+

四色和K色图着色问题的瞬态混沌神经网络解法 被引量:4

Artificial Neural Network with Transient Chaos for Four-Coloring Map Problems and K-Colorability Problems
原文传递
导出
摘要 首先给出了用神经网络求解四色图着色问题的神经网络结构和能量函数 ,然后采用了具有瞬态混沌特性的神经网络 ( TCNN)来解四色图着色问题 .由于引入具有复杂动态特性的瞬态混沌使得该法具有很强的搜索全局最优解的能力 .仿真结果表明 ,用该法解四色图着色问题总能保证使能量函数收敛到最优解 ,有效避免了用传统的 Hopfield人工神经网络 ( HNN)解此问题时极易陷入局部极小的缺陷 ,并且收敛速度更快 .另外我们还用此法求解了属于 NP-完全问题的 Neural network and computational energy are presented for solving four-coloring map problem. Then, the four-coloring map problems are solved by a neural network model with transient chaos (TCNN) which have higher ability of quickly searching for the globally optimal solution because of its complicated chaotic dynamics. Numerical simulations of four-coloring map problem show that TCNN would not be stuck into local minima like the conventional Hopfield neural network (HNN) and always guaranteed that computational energy converged to the globally optimal solution. The TCNN is extended for solving $K$-colorability problem which is one of NP-complete problems.
出处 《系统工程理论与实践》 EI CSCD 北大核心 2002年第5期92-96,共5页 Systems Engineering-Theory & Practice
基金 国家自然科学基金 ( 79970 0 4 2 )
关键词 着色问题 神经网络 四色图 瞬态混沌 K色图 组合优化问题 运筹学 neural network transient chaos colorability problem
  • 相关文献

参考文献6

  • 1[1]Appel K, Haken W. The solution of the four-color-map problem[J]. Scientific American,1977,(10):108-121.
  • 2[2]Hopfield J J, Tank D W.`Neural' computation of decisions in optimization problems[J]. Biolog. Cybern, 1985,52(1):141-152.
  • 3[3]Dahl E D. Neural network algorithm for an NP-complete problem: map and graph coloring [A]. Proc. IEEE Int. Conf. Neural Networks[C].1987,III-133-120.
  • 4[4]Takefuji Y, Lee K C.Artificial neural networks for four-coloring map problems and K-colorability problems[J]. IEEE Trans. Neural Networks,1991,38(3):326-333.
  • 5[5]Kirkpatrick S, Gelatt C D, Vecchi P V. Optimizatiom by simulated annealing[J]. Science,1983,220: 671-680.
  • 6[6]Chen L, Aihara K.Chaotic simulated annealing by a neural network model with transient chaos[J]. Neural Networks,1995,8(6):915-930.

同被引文献16

  • 1王淑栋,刘文斌,许进.图顶点着色问题的DNA粘贴算法[J].系统工程与电子技术,2005,27(3):568-572. 被引量:13
  • 2Cui Guangzhao,Niu Yunyun,Wang Yanfeng,Zhang Xuncai,Pan Linqiang.A new approach based on PSO algorithm to find good computational encoding sequences[J].Progress in Natural Science:Materials International,2007,17(6):712-716. 被引量:11
  • 3Appel k ,Haken W.The solution of the four-color-map problem[J].Scientific American, 1977 ; (10) : 108-121.
  • 4Hopfield J,Tank D W."Neural"computation of decisions in optimization problems[J].Biology Cybern, 1985 ;52( 1 ) : 141-152.
  • 5Dahl E D.Neural network algorithm for an NP-complete problem: map and graph colofing[C].In:Proc IEEE Int Conf Neural Networks,1987; (3) : 120-133.
  • 6Takefuji Y, Lee K C.Artificial neural networks for four-coloring map problem and k-colorability problems[J].IEEE Tram,Neural Networks, 1991 ;38(3) :326-333.
  • 7Chen L,Althara K.Chaotic simulated annealing by a neural network model with transient chaos[J].Neural Networks, 1995;8(6) :915-930.
  • 8Appel K,Haken W. The solution of the four-color-map problem [J].Scientific American,197,Oct:108-121.
  • 9Colorni A,Dorigo M,Maniezzo V.An investigation of some properties of ant algorithm[C].Proc.of the Parallel Problem Solving from Nature Conference (PPSN'92).Belgium;Elsevier.
  • 10Colorni A, Dorigo M,Maniezo V.Colorni A,Ant system;optimization by a colony of cooperating agents[J].IEEE Trans On System,Man,and Cybernetis,1996,26(1):29-41.

引证文献4

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部