{"title":"SOM算法求解旅行商问题的一种有效方法","authors":"F. C. Vieira, A. Neto, J. A. F. Costa","doi":"10.1109/SBRN.2002.1181459","DOIUrl":null,"url":null,"abstract":"This paper presents an approach to the well-known traveling salesman problem (TSP) via competitive neural networks. The neural network model adopted in this work is the Kohonen network or self-organizing maps (SOM), which has important topological information about its neurons configuration. This paper is concerned with the initialization aspects, parameters adaptation, and the complexity analysis of the proposed algorithm. The modified SOM algorithm proposed in this paper has shown better results when compared with others neural network based approaches to the TSP.","PeriodicalId":157186,"journal":{"name":"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An efficient approach of the SOM algorithm to the traveling salesman problem\",\"authors\":\"F. C. Vieira, A. Neto, J. A. F. Costa\",\"doi\":\"10.1109/SBRN.2002.1181459\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an approach to the well-known traveling salesman problem (TSP) via competitive neural networks. The neural network model adopted in this work is the Kohonen network or self-organizing maps (SOM), which has important topological information about its neurons configuration. This paper is concerned with the initialization aspects, parameters adaptation, and the complexity analysis of the proposed algorithm. The modified SOM algorithm proposed in this paper has shown better results when compared with others neural network based approaches to the TSP.\",\"PeriodicalId\":157186,\"journal\":{\"name\":\"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBRN.2002.1181459\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRN.2002.1181459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient approach of the SOM algorithm to the traveling salesman problem
This paper presents an approach to the well-known traveling salesman problem (TSP) via competitive neural networks. The neural network model adopted in this work is the Kohonen network or self-organizing maps (SOM), which has important topological information about its neurons configuration. This paper is concerned with the initialization aspects, parameters adaptation, and the complexity analysis of the proposed algorithm. The modified SOM algorithm proposed in this paper has shown better results when compared with others neural network based approaches to the TSP.