This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/resource/domain/vavai/subjekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n5http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00182180%21RIV12-MSM-21230___/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00182180%21RIV12-MSM-21230___
rdf:type
n14:Vysledek skos:Concept
rdfs:seeAlso
http://www.sciencedirect.com/science/article/pii/S0020025511002684
dcterms: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 and cooperative 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. 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 and cooperative 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.
dcterms:title
On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain
skos:prefLabel
On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain
skos:notation
RIV/68407700:21230/11:00182180!RIV12-MSM-21230___
n14:predkladatel
n18:orjk%3A21230
n3:aktivita
n13:P
n3:aktivity
P(7E08006)
n3:cisloPeriodika
19
n3:dodaniDat
n8:2012
n3:domaciTvurceVysledku
n9:7341520
n3:druhVysledku
n15:J
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
218255
n3:idVysledku
RIV/68407700:21230/11:00182180
n3:jazykVysledku
n19:eng
n3:klicovaSlova
Self-Organizing Map (SOM); Traveling Salesman Problem (TSP); Multi-Goal Path Planning
n3:klicoveSlovo
n6:Self-Organizing%20Map%20%28SOM%29 n6:Traveling%20Salesman%20Problem%20%28TSP%29 n6:Multi-Goal%20Path%20Planning
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[527D08AE6E9D]
n3:nazevZdroje
Information Sciences
n3:obor
n11:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n20:7E08006
n3:rokUplatneniVysledku
n8:2011
n3:svazekPeriodika
181
n3:tvurceVysledku
Faigl, Jan
n3:wos
000293304600010
s:issn
0020-0255
s:numberOfPages
16
n5:doi
10.1016/j.ins.2011.05.019
n17:organizacniJednotka
21230