首页 | 本学科首页   官方微博 | 高级检索  
     

求解TSP的Hopfield网络权值修正算法分析
引用本文:张忆军 叶中行. 求解TSP的Hopfield网络权值修正算法分析[J]. 上海交通大学学报, 1995, 29(5): 144-147,164
作者姓名:张忆军 叶中行
基金项目:国家基础研究攀登计划,国家自然科学基金,国家教委优秀年轻教师基金
摘    要:针对Hopfield神经网络在求解巡回推销员问题(TSP)时出现的无效解和局部极小值问题,本文结合网络动态分析,利用权矩阵特征值在网络内部动力特性与外在解表现形式之间的关联作用,通过各特征值间关系协调,对基于原模型的权值修正方案作进一步理论分析与改进,探讨网络收敛于全局有效解的途径,并在全国31省、市、自治区TSP模拟中收到较好效果。

关 键 词:Hopfield网络 推销员问题 TSP 权值修正方案

Analysis of New Weight Strategies in Solving TSP by Hopfield Neural Network
Zhang Yijun, Ye Zhongxing. Analysis of New Weight Strategies in Solving TSP by Hopfield Neural Network[J]. Journal of Shanghai Jiaotong University, 1995, 29(5): 144-147,164
Authors:Zhang Yijun   Ye Zhongxing
Affiliation:Zhang Yijun; Ye Zhongxing
Abstract:In this paper, we study several models of Hopfield neural network to overcome the difficulties of the invalid solution and local minimum in solving the Travelling Saleman Problem(TSP). Using the analytic methods of neural dynamical property, we discover that the set of the eigenvalues of the network connected matrix is the link between the inner dynamic performance and the outside solution form. The modified strategies of the weight matrix was developed theoretically by coordinating the relationship of eigenvalues. These new models have achieved very satisfactory performance in numerical simulation with 31 Chinese cities.
Keywords:Hopfield net   connected matrix   eigenvalue   local minimum  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号