期刊文献+

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

Modified self-organizing map network for Euclidean travelling salesman problem
下载PDF
导出
摘要 对自组织特征映射(SOM)网络进行改进,要求神经元在训练过程中不仅数目保持不变而且在每次迭代中保持其权的均值与样本数据均值相同。当训练结束时,每一个城市都会对应于一个神经元的标号。此时,可能会出现两个及两个以上的城市对应于一个神经元的情况。为避免这个问题,采用小数标号代替整数标号。此时,每一个城市就对应于一个不同的实数索引标号,从而按照这个索引标号排列城市就得到了一条合理的路径。用此方法对旅行商问题(TSP)实验数据库(TSPLIB)中算例进行计算,实验结果表明所提算法是有效、可行的。 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.
机构地区 河海大学理学院
出处 《计算机应用》 CSCD 北大核心 2012年第7期1962-1964,共3页 journal of Computer Applications
关键词 自组织特征映射网络 旅行商问题 人工神经网络 Self-Organizing Map(SOM) network Traveling Salesman Problem(TSP) Artificial Neural Network(ANN)
  • 相关文献

参考文献12

  • 1ANGENIOL B, de La CROIX VAUBOIS G, Le TEXIER J Y. Self-organizing feature maps and the travelling salesman problem [ J]. Neural Networks, 1988, 1(4): 289 -293.
  • 2CORMENTH,LEISERSONCE,RIVESTRL.Introductiontoal-gofithms[M].北京:高等教育出版社,2002:1027-1033.
  • 3AIVER S V B, NIRANJAN N, FALLSIDE M F. A theoretical in- vestigation into the performance of the Hopfield model [ J]. IEEE Transactions on Neural Networks, 1990, 1(2): 204-215.
  • 4HOPFIELD J J, TANK D W. Neural computation of decisions in op- timization problems [J]. Biological Cybernetics, 1985, 52(3): 141 - 152.
  • 5ARAS N, ALTINEL I K, OOMMEN B. A Kohonen-like decomposi- tion method for the Euclidean traveling salesman problem--KNIES_ DECOMPOSE [ J]. IEEE Transactions on Neural Networks, 2003, 14(4): 869 -890.
  • 6VIEIRA F C, DORIA NETO A D, COSTA J A. An efficient ap- proach to the travelling salesman problem using self-organizing maps [J]. International Journal of Neural Systems, 2003, 13(2): 59- 66.
  • 7BUDINICH M. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing [ J]. Neural Computation, 1996, 8(2): 267-292.
  • 8KOHONEN T. The self-organizing map [ J]. Proceedings of the IEEE, 1990, 78(9): 74-90.
  • 9KOHONEN T. The self-organizing map [ M]. Berlin: Springer, 1995.
  • 10ARAS N, OOMMEN B J, ALTINEL I K. The Kohonen network in- corporating explicit statistics and its application to the travelling salesman problem [J]. Neural Networks, 1999, 12(9): 1273 - 1284.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部