Journal of Computer Applications ›› 2012, Vol. 32 ›› Issue (07): 1962-1964.DOI: 10.3724/SP.J.1087.2012.01962

• Artificial intelligence • Previous Articles     Next Articles

Modified self-organizing map network for Euclidean travelling salesman problem

ZHOU Xiao-meng, XU Xiao-ming   

  1. College of Sciences, Hohai University, Nanjing Jiangsu 211100, China
  • Received:2011-12-12 Revised:2012-02-09 Online:2012-07-05 Published:2012-07-01
  • Contact: Xiao-Meng ZHOU

改进的求解旅行商问题的自组织特征映射网络

周晓蒙,徐小明   

  1. 河海大学 理学院,南京211100
  • 通讯作者: 周晓蒙
  • 作者简介:周晓蒙(1988-),女,山东潍坊人,硕士研究生,主要研究方向:计算数学、人工神经网络;徐小明(1962-),男,江苏南京人,副教授,博士,主要研究方向:计算数学、计算水力学、神经网络。

Abstract: The Self-Organizing Map (SOM) was modified in this paper: the number of the neurons did not change with time and the neurons collectively maintained their mean to be the mean of the data point in the training phase. After training, every city was associated with a label of a neuron. Then there may be a problem that one or more than one cities have the same neuron. In order to avoid that, a dot labels index was adopted instead of the integer index. The virtue of this scheme is that different city has different index. Then the label would contribute to make sure the order of the city in the tour. Then the algorithm was applied to solve problems taken from a Traveling Salesman Problem Library (TSPLIB). The experimental results show that the proposed algorithm is feasible and effective.

Key words: Self-Organizing Map (SOM) network, Traveling Salesman Problem (TSP), Artificial Neural Network (ANN)

摘要: 对自组织特征映射(SOM)网络进行改进,要求神经元在训练过程中不仅数目保持不变而且在每次迭代中保持其权的均值与样本数据均值相同。当训练结束时,每一个城市都会对应于一个神经元的标号。此时,可能会出现两个及两个以上的城市对应于一个神经元的情况。为避免这个问题,采用小数标号代替整数标号。此时,每一个城市就对应于一个不同的实数索引标号,从而按照这个索引标号排列城市就得到了一条合理的路径。用此方法对旅行商问题(TSP)实验数据库(TSPLIB)中算例进行计算,实验结果表明所提算法是有效、可行的。

关键词: 自组织特征映射网络, 旅行商问题, 人工神经网络

CLC Number: