An Application of the Self-Organizing Map in the non-Euclidean Traveling Salesman Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00174233" target="_blank" >RIV/68407700:21230/11:00174233 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.neucom.2010.08.026" target="_blank" >http://dx.doi.org/10.1016/j.neucom.2010.08.026</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.neucom.2010.08.026" target="_blank" >10.1016/j.neucom.2010.08.026</a>

Result language
angličtina
Original language name
An Application of the Self-Organizing Map in the non-Euclidean Traveling Salesman Problem
Original language description
An application of the self-organizing map (SOM) to the Traveling Salesman Problem (TSP) has been reported by many researchers, however these approaches are mainly focused on the Euclidean TSP variant.We consider the TSP as a problem formulation for the multi-goal path planning problem in which paths among obstacles have to be found.Weapply a simple approximation of the shortest path that seems to be suitable for the SOM adaptation procedure. The approximation is based on a geometrical interpretation ofSOM, where weights of neurons represent nodes that are placed in the polygonal domain. The approximation is verified in a set of real problems and experimental results show feasibility of the proposed approach for the SOM based solution of the non-Euclidean TSP.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)