All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00182180" target="_blank" >RIV/68407700:21230/11:00182180 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0020025511002684" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0020025511002684</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2011.05.019" target="_blank" >10.1016/j.ins.2011.05.019</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain

  • Original language description

    In this paper, two state-of-the-art algorithms for the Traveling Salesman Problem (TSP) are examined in the multi-goal path planning problem motivated by inspection planning in the polygonal domain W. Both algorithms are based on the self-organizing map(SOM) for which an application in W is not typical. The first is Somhom's algorithm, and the second is the Co-adaptive net. These algorithms are augmented by a simple approximation of the shortest path among obstacles in W. Moreover, the competitive andcooperative rules are modified by recent adaptation rules for the Euclidean TSP, and by proposed enhancements to improve the algorithms' performance in the non-Euclidean TSP. Based on the modifications, two new variants of the algorithms are proposed that reduce the required computational time of their predecessors by an order of magnitude, therefore making SOM more competitive with combinatorial heuristics.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/7E08006" target="_blank" >7E08006: Robotic Evolutionary Self-Programming and Self-Assembling Organisms</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Information Sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    181

  • Issue of the periodical within the volume

    19

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    4214-4229

  • UT code for WoS article

    000293304600010

  • EID of the result in the Scopus database