SOM算法求解旅行商问题的一种有效方法

F. C. Vieira, A. Neto, J. A. F. Costa
{"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}
引用次数: 7

摘要

本文提出了一种利用竞争神经网络求解著名旅行商问题的方法。本研究采用的神经网络模型是Kohonen网络或自组织映射(SOM),其神经元结构具有重要的拓扑信息。本文主要研究了该算法的初始化、参数自适应和复杂度分析。与其他基于神经网络的TSP方法相比,本文提出的改进SOM算法显示出更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信