| 用参数正交选优神经网络算法解货郎问题 |
| |
| 引用本文： | 余道衡,贾积有.用参数正交选优神经网络算法解货郎问题[J].电子学报,1993(7):16-22. |
| |
| 作者姓名： | 余道衡 贾积有 |
| |
| 作者单位： | 北京大学无线电电子学系，北京大学无线电电子学系 北京 100871，北京 100871 |
| |
| 摘 要： | 本文发现了货郎问题(TSP)能量函数的参数空间中的吸引域与全局性优化解之间存在着确定的对应关系，并找到了许多参数空间中的吸引域．在此基础上提出了一种新算法——参数正交选优神经网络算法求解TSP，30城市、31城市(中国)和300城市TSP的求解结果都十分满意，表明这种新算法的有效性．
|
| 关 键 词： | 货郎问题 参数正交选优神经网络 加权参数空间 正交表优化 吸引域 |
A Neural Network Algorithm with Optimized Parameters and Used to Solve the TSP |
| |
| Yu Daoheng,Jia Jiyou.A Neural Network Algorithm with Optimized Parameters and Used to Solve the TSP[J].Acta Electronica Sinica,1993(7):16-22. |
| |
| Authors: | Yu Daoheng Jia Jiyou |
| |
| Abstract: | A definite relation between the TSP'S optimal solution and the attracting region in the parameter space of TSP'S energy function is discovered.Many attracting regions corresponding with the global aptimal solution for TSP are also found.Then a neural network algorithm with the optimized parameters by using orthogoral array table is proposed and used to solve the Travelling Salesman Problem (TSP) for 30,31 and 300 cities.It is shown that the new algorithm is effective. |
| |
| Keywords: | Hopfield neural network model TSP Parameter space Attracting region Orthogonal array table method |
| 本文献已被 CNKI 维普 等数据库收录！ |
