| Hopf field网络解TSP的改进算法 |
| |
| 引用本文： | 王柏祥,姜国均.Hopf field网络解TSP的改进算法[J].浙江大学学报(理学版),1994,21(4):408-412. |
| |
| 作者姓名： | 王柏祥 姜国均 |
| |
| 作者单位： | 浙江大学CAD&CG国家重点实验室
(王柏祥)，浙江大学电机系
(姜国均)，杭州大学电子工程系(陆生勋) |
| |
| 摘 要： | 本文提出用神经网络解旅行商问题(TSP>的改进算法。简化了Hopfield神经网络的能量函数并讨论了Euler法取大步长时的迭代性质.计算机模拟表明主要有两大优点:一是迅速收敛到一个解，二是易获得有效路径.
|
| 关 键 词： | 神经网络 Hopfield网络 旅行商问题 算法 |
A Modified Algorithm of Hopfield Network to Solve TSP |
| |
| Wang Baixiang Jiang Guojun Lu Shengxun.A Modified Algorithm of Hopfield Network to Solve TSP[J].Journal of Zhejiang University(Sciences Edition),1994,21(4):408-412. |
| |
| Authors: | Wang Baixiang Jiang Guojun Lu Shengxun |
| |
| Institution: | Wang Baixiang Jiang Guojun Lu Shengxun
(State Key Laboratory of CAD & CG at Zhejiang University)
(Dept. of E. E. of Hangzhou University) |
| |
| Abstract: | This article proposes a modified algorithm for solving the travelling salesman problem (TSP) by neural network. The energy function of the Hopfield neural network is simplifed and some properties of the iterations with large step used in Euler's method are discussed. The computer simulations show that our approach seems to have two major advantages; (a) very fast convergence of the network towards a solutior.(b) easy to obtain the effective tours. |
| |
| Keywords: | neural network Hopfield network optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
