| 一种基于粒子群算法和Hopfield网络求解TSP问题的方法 |
| |
| 引用本文： | 龚淑蕾,张煜东,吴含前,韦耿.一种基于粒子群算法和Hopfield网络求解TSP问题的方法[J].科学技术与工程,2009,9(8). |
| |
| 作者姓名： | 龚淑蕾 张煜东 吴含前 韦耿 |
| |
| 作者单位： | 东南大学信息科学与工程学院,南京,210096 |
| |
| 摘 要： | 针对Hopfield网络求解TSP问题经常出现局部最优解,将粒子群算法(PSO)与Hopfield神经网络结合,提出一种基于粒子群的Hopfield神经网络方法. 实验证实这种方法能够以更大概率收敛到全局最优.
|
| 关 键 词： | 旅行商问题 粒子群算法 Hopfield网络 |
Comparison on Solving TSP via Intelligent Algorithm |
| |
| GONG Shu-lei,ZHANG Yu-dong,WU Han-qian,WEI Geng.Comparison on Solving TSP via Intelligent Algorithm[J].Science Technology and Engineering,2009,9(8). |
| |
| Authors: | GONG Shu-lei ZHANG Yu-dong WU Han-qian WEI Geng |
| |
| Institution: | School of Information Science & Engineering;Southeast University;Nanjing 210096;P.R.China |
| |
| Abstract: | Since the Hopfield network solving traveling salesman problem often suffers from being trapped in local extrema,The particle swarm optimization(PSO) and Hopfield neural networks(HNN) are combined,and proposed a novel algorithm,PSO-HNN.Experiments showcase that the proposed method can converge on global extrema with a higher probability than Hopfield Solving TSP. |
| |
| Keywords: | traveling salesman problem particle swarm optimization Hopfield network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
