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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název periodika

Neurocomputing

ISSN

0925-2312

e-ISSN

—

Svazek periodika

74

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

9

Strana od-do

671-679

Kód UT WoS článku

000287106100002

EID výsledku v databázi Scopus

—