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

改进的连续Hopfield网络求解组合优化问题——以TSP求解为例
引用本文:邱树伟. 改进的连续Hopfield网络求解组合优化问题——以TSP求解为例[J]. 湖南工业大学学报, 2011, 25(3): 42-46
作者姓名:邱树伟
作者单位:汕头职业技术学院计算机系,广东汕头,515078
摘    要:利用神经网络求解组合优化问题,是一种有效的途径。对连续Hopfield网络的数学模型及稳定性进行了分析;探讨了组合优化问题的神经网络求解方法,针对传统方法参数配置复杂、收敛速度慢等不足,提出了改进算法;最后,通过系统仿真与性能测试验证了该算法的可行性。

关 键 词:组合优化  神经网络  连续Hopfield网络  旅行商问题
收稿时间:2011-03-10

Improved Continuous Hopfield Neural Network for Solving CombinatorialOptimization Problems: An Example to Solve the TSP
Qiu Shuwei. Improved Continuous Hopfield Neural Network for Solving CombinatorialOptimization Problems: An Example to Solve the TSP[J]. Journal of Hnnnan University of Technology, 2011, 25(3): 42-46
Authors:Qiu Shuwei
Affiliation:Qiu Shuwei(Department of Computer Science,Shantou Polytechnic,Shantou Guangdong 515078,China)
Abstract:Using neural networks to solve combinatorial optimization problems is an effective approach. Analyzes the mathematical model and stability of continuous Hopfield neural network, discusses the use of CHNN to solve combinatorial optimization problem and puts forward the improved algorithm aiming at the insufficiency of the traditional method of parameters configuration complex and convergence rate slower. Finally, through the system simulation and performance testing, demonstrates the algorithm feasible.
Keywords:combinatorial optimization   neural network   continuous hopfield neural network   traveling salesman problem
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《湖南工业大学学报》浏览原始摘要信息
点击此处可从《湖南工业大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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