[1] ANGENIOL 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.[2] CORMEN T H, LEISERSON C E, RIVEST R L. Introduction to algorithms [M].北京:高等教育出版社, 2002:1027-1033.[3] AIVER S V B, NIRANJAN N, FALLSIDE M F. A theoretical investigation into the performance of the Hopfield model [J]. IEEE Transactions on Neural Networks, 1990, 1(2): 204-215.[4] HOPFIELD J J, TANK D W. Neural computation of decisions in optimization problems [J]. Biological Cybernetics, 1985, 52(3): 141-152.[5] ARAS N, ALTINEL I K, OOMMEN B. A Kohonen-like decomposition method for the Euclidean traveling salesman problem—KNIES_DECOMPOSE [J]. IEEE Transactions on Neural Networks, 2003, 14(4): 869-890.[6] VIEIRA F C, DRIA NETO A D, COSTA J A. An efficient approach to the travelling salesman problem using self-organizing maps [J]. International Journal of Neural Systems, 2003, 13(2): 59-66.[7] BUDINICH 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.[8] KOHONEN T. The self-organizing map [J]. Proceedings of the IEEE, 1990, 78(9): 74-90.[9] KOHONEN T. The self-organizing map [M]. Berlin: Springer, 1995.[10] ARAS N, OOMMEN B J, ALTINEL I K. The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem [J]. Neural Networks, 1999, 12(9): 1273-1284.[11] LEUNG K-S, JIN H-D, XU Z-B. An expanding self-organizing neural network for the traveling salesman problem [J]. Neuro-computing, 2004, 62: 267-292.[12] REINELT G. TSPLIB—A travelling salesman problem library [J]. ORSA Journal on Computing, 1991, 3(4): 376-384. |