As a representative combinatorial optimization problem, the Traveling Salesman Problem (TSP) has attracted extensive research. In this paper, we develop a new Self-Organizing Map (SOM) network for the TSP and call it the Integrated SOM (ISOM) network. Its learning rule embodies the effective mechanisms of three typical learning rules. In its single learning activity, the excited neuron first is dragged close to the input city, and then is expanded towards the convex-hull of the TSP, and finally, it is drawn close to the middle point of its two neighbor neurons. The elaborate cooperation among these three learning mechanisms is evolved by a genetic algorithm. The simulation results show that the finally established ISOM can generate more promising solutions, with similar computation time, than other neural networks like the SOM network, the Expanded SOM, and the Convex Elastic Net.
|Title of host publication||Advances in Neural Networks and Applications|
|Publication status||Published - 2001|
|Event||Advances in Neural Networks and Applications - Spain, Spain|
Duration: 1 Jan 2001 → 1 Jan 2001
|Conference||Advances in Neural Networks and Applications|
|Period||1/01/01 → 1/01/01|
|Other||World Scientific and Engineering Society|
Bibliographical noteThis research was partially supported by Hong Kong RGC CERG Grant CUHK 4161/97E.
JIN, H-D., LEUNG, K-S., & WONG, M-L. (2001). An Integrated Self-Organizing Map for the Traveling Salesman Problem. In N. MASTORAKIS (Ed.), Advances in Neural Networks and Applications (pp. 235-240) http://users.cecs.anu.edu.au/~hdjin/publications/2002before/WSESSpain2.pdf