Abstract
This paper studies parallel learning of growing self-organizing maps ( GSOMs ) and its application to traveling sales person problems ( TSPs ). Input space of city positions are divided into subspaces automatically through adaptive resonance theory ( ART ) map. One GSOM is allocated to each subspace and grows following input data. After all the GSOMs grow sufficiently they are fused and we obtain a tour. The algorithm performance can be controlled by four parameters: the number of subspaces, insertion interval, learning coefficient and final number of cells. In basic experiments for a data-set of 929 cities we can find semi-optimal solution much faster than serial methods although there exist trade-off between tour length and execution time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kohonen, T.: Self-organization and associative memory, 2nd edn. Springer, Berlin (1988)
Fritzke, B.: Growing cell structures - a self-organizing network for unsupervised and supervised learning. Neural Networks 7, 1441–1460 (1994)
Fritzke, B.: Growing neural gas network learns topologies. In: Advances in Neural Information Processing Systems, vol. 7, pp. 625–632 (1995)
Kawahara, S., Saito, T.: An adaptive self-organizing algorithm with virtual connection. J. Advanced Comput. Intelli. 2, 203–207 (1998)
Alahakoon, D., Halganmuge, S.K., Srinivasan, B.: Dynamic self-organizing maps with controlled growth for knowledge discovery. IEEE Trans. Neural Networks 11, 601–614 (2000)
Ohta, R., Saito, T.: A growing self-organizing algorithm for dynamic clustering. In: Proc. of IJCNN, pp. 469–473 (2001)
Carpenter, G.A., Grossberg, S., Rosen, D.B.: Fuzzy ART: Fast stable learning and categorization of analog patterns by an adaptive resonance system. Neural Networks 4, 759–771 (1991)
Ohki, M., Torikai, H., Saito, T.: A simple radial basis ART network: basic learning characteristics and application to area measurement. In: Proc. NOLTA, pp. 262–265 (2005)
Angeniol, B., de La, C., Vaubois, G., Le Texierr, J.Y.: Self-organizing feature maps and the traveling salesman problem. Neural Networks 1, 289–293 (1988)
Fujimura, K., Tokutaka, H., Ishikawa, M.: Performance of improved SOM-TSP algorithm for traveling salesman problem of many cities. Trans. IEE Japan 119- C, 875–882 (1997)
Durbin, R., Szeliski, R., Yuille, A.: An analysis of the elastic net approach to the traveling salesman problem. In: Obermayer, K., Sejnowski, T.J. (eds.) Self-organization map formation, pp. 407–417. MIT press, Cambridge (2001)
Sasamura, H., Ohta, R., Saito, T.: A simple learning algorithm for growing ring SOM and its application to TSP. In: Proc. ICONIP, CD-ROM#1508 (2002)
Ehara, T., Sasamura, H., Saito, T.: An Approach to the TSP based on Growing Self-Organizing Maps. In: Proc. NOLTA, pp. 709–712 (2004)
Singh, R., Cherkassky, V., Papanikolopoulos, N.: Self-organizing maps for the skeletonization of sparse shapes. IEEE Trans. Neural Networks 11, 241–248 (2000)
Sasamura, H., Saito, T.: A Simple learning algorithm for growing self-organizing maps and its application to the skeletonization. In: Proc. of IJCNN, pp. 787–790 (2003)
Sasamura, H., Saito, T., Ohta, R.: A simple learning algorithm for network formation based on growing self organizing maps. IEICE Trans. Fundamentals E87-A, 2807–2810 (2004)
Matsushita, H., Nishio, Y.: Competing Behavior of Two Kinds of SOMs and its Application to Clustering. In: Proc. of WSOM, pp. 355–362 (2005)
Matsushita, H., Nishio, Y.: Competing and Accommodating Behaviors of Peace SOM. In: Proc. of IEEE/ISCAS, pp. 3642–3645 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oshime, T., Saito, T., Torikai, H. (2006). ART-Based Parallel Learning of Growing SOMs and Its Application to TSP. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893028_112
Download citation
DOI: https://doi.org/10.1007/11893028_112
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46479-2
Online ISBN: 978-3-540-46480-8
eBook Packages: Computer ScienceComputer Science (R0)