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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On the Performance of Self-organizing Maps for the Non-Euclidean Traveling Salesman Problem in the Polygonal Domain Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.sciencedirect.com/science/article/pii/S0020025511002684
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. (en)
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 (en)
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 (en)
skos:notation	RIV/68407700:21230/11:00182180!RIV12-MSM-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(7E08006)
http://linked.open...iv/cisloPeriodika	19
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Faigl, Jan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	218255
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00182180
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Self-Organizing Map (SOM); Traveling Salesman Problem (TSP); Multi-Goal Path Planning (en)
http://linked.open.../riv/klicoveSlovo	Self-Organizing Map (SOM) Traveling Salesman Problem (TSP) Multi-Goal Path Planning
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[527D08AE6E9D]
http://linked.open...i/riv/nazevZdroje	Information Sciences
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Robotic Evolutionary Self-Programming and Self-Assembling Organisms
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	181
http://linked.open...iv/tvurceVysledku	Faigl, Jan
http://linked.open...ain/vavai/riv/wos	000293304600010
issn	0020-0255
number of pages	16 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.ins.2011.05.019
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software