About: Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem

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

About: Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem 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
Description	In this paper, we propose novel adaptation rules for the self-organizing map to solve the prize-collecting traveling salesman problem (PC-TSP). The goal of the PC-TSP is to find a cost-efficient tour to collect prizes by visiting a subset of a given set of locations. In contrast with the classical traveling salesman problem, where all given locations must be visited, locations in the PC-TSP may be skipped at the cost of some additional penalty. Using the self-organizing map, locations for the final solution may be selected during network adaptation, and locations where visitation would be more expensive than their penalty can be avoided. We have applied the proposed self-organizing map learning procedure to autonomous data collection problems, where the proposed approach provides results competitive with an existing combinatorial solver. Springer International Publishing Switzerland 2014. In this paper, we propose novel adaptation rules for the self-organizing map to solve the prize-collecting traveling salesman problem (PC-TSP). The goal of the PC-TSP is to find a cost-efficient tour to collect prizes by visiting a subset of a given set of locations. In contrast with the classical traveling salesman problem, where all given locations must be visited, locations in the PC-TSP may be skipped at the cost of some additional penalty. Using the self-organizing map, locations for the final solution may be selected during network adaptation, and locations where visitation would be more expensive than their penalty can be avoided. We have applied the proposed self-organizing map learning procedure to autonomous data collection problems, where the proposed approach provides results competitive with an existing combinatorial solver. Springer International Publishing Switzerland 2014. (en)
Title	Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem (en)
skos:prefLabel	Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem (en)
skos:notation	RIV/68407700:21230/14:00225364!RIV15-GA0-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GP13-18316P)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Faigl, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	44341
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00225364
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	raveling salesman problem; Vector quantization Adaptation rules; Cost-efficient; Data collection; Map learning; Network adaptation; Prize-collecting (en)
http://linked.open.../riv/klicoveSlovo	Data collection Cost-efficient Map learning Network adaptation Prize-collecting Vector quantization Adaptation rules raveling salesman problem
http://linked.open...ontrolniKodProRIV	[B20224A27BB5]
http://linked.open...v/mistoKonaniAkce	Mittweida
http://linked.open...i/riv/mistoVydani	Düsseldorf
http://linked.open...i/riv/nazevZdroje	Advances in Intelligent Systems and Computing
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Self-Organizing Maps for Multi-Goal Path Planning Tasks
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Faigl, Jan Hollinger, G. A.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-06-02 (xsd:date)
issn	2194-5357
number of pages	11 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-07695-9_27
http://purl.org/ne...btex#hasPublisher	Springer-VDI-Verlag
https://schema.org/isbn	978-3-319-07694-2
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, 106 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software