摘要
货郎担问题(Traveling Salesm an Prob lem,TSP)作为组合数学中的经典问题,具有一定的研究价值.首先陈述了基于自组织网络(Self-O rgan izing M aps,SOM)的TSP问题的解决方案,然后着重分析为什么SOM网络能够体现这样的计算智能,并探讨了如何将其应用到其它的优化问题当中.
As a classical problem in Combinatorial Mathematics, Traveling Salesman Problem （TSP） has plenty of research potential both in theory and in practice. This paper presents solutions to SOM - based TSPs, analyzes the reason why SOM can display such computing intelligence, and probes into the ways to apply it to other optimization problems.
出处
《重庆工学院学报》
2005年第8期59-62,共4页
Journal of Chongqing Institute of Technology
关键词
货郎担问题
计算智能
自组织网络
Traveling Salesman Problem
Computing Intelligence
Self-Organizing Maps
