LAI Qing-wu~1,XIE Jian-ying~2,YE Xiao-li~1(1.College of Electronic Information and Electrical Engineering,Nanchang University,Nanchang 330029,China;(2.School of Electronic Information and Electrical Engineering,Shanghai Jiaotong University,Shanghai 20003
Abstract:A shortest-path routing algorithm based on the chaotic simulated annealing neural networks(CSA),can avoid local minimum problems like Hopfield,to get globally optimal solutions.But as to some networks with more nodes,it still suffer some drawbacks.So we i
赖青梧; 谢剑英; 叶小丽. 混沌模拟退火最短路由算法的事后处理技术[J]. 南昌大学学报(理科版), 2006, 30(02): 1-.
LAI Qing-wu~1,XIE Jian-ying~2,YE Xiao-li~1(1.College of Electronic Information and Electrical Engineering,Nanchang University,Nanchang 330029,China;(2.School of Electronic Information and Electrical Engineering,Shanghai Jiaotong University,Shanghai 20003. . , 2006, 30(02): 1-.