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

Hopfield网络求解旅行商问题有效性的研究
引用本文:赵建明,姚念民.Hopfield网络求解旅行商问题有效性的研究[J].科学技术与工程,2009,9(2).
作者姓名:赵建明  姚念民
作者单位:1. 福建师范大学福清分校,福建,350000
2. 哈尔滨工程大学计算机科学与技术学院,哈尔滨,150001
基金项目:国家自然科学基金,黑龙江省博士后科研启动基金 
摘    要:对Hopfield网络求解旅行商问题的有效性进行了研究,实验结果表明使用Hopfield网络求解TSP问题时存在两难问题,提高解有效性概率导致解的路径长度优化能力降低,而提高解的路径长度优化能力导致解有效性概率降低.

关 键 词:hopfield网络  旅行商问题  有效性概率

Study on the Efficiency of Solving TSP Based on Hopfield Network
ZHAO Jian-ming,YAO Nian-min.Study on the Efficiency of Solving TSP Based on Hopfield Network[J].Science Technology and Engineering,2009,9(2).
Authors:ZHAO Jian-ming  YAO Nian-min
Institution:Fuqing Branch of Fujian Normal University;Fnqing 350000 P.R.China;College of Computer Science and Technology1;Harbin Engineering University1;Harbin 150001;P.R.China
Abstract:The efficiency of solving the TSP problem based on CHNN Hopfield is studied.A lot of experiments of using Hopfield neural network to solve the TSP problem are done and the results are analyzed.It shows that using CHNN Hopfield to solve TSP problems will run into a dilemma that raising the probability of getting the right answer will reduce the optimization ability of TSP's path length and increasing the optimization ability of TSP's path length will reduce the probability of getting the right answer.
Keywords:
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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