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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00225364" target="_blank" >RIV/68407700:21230/14:00225364 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-07695-9_27" target="_blank" >http://dx.doi.org/10.1007/978-3-319-07695-9_27</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-07695-9_27" target="_blank" >10.1007/978-3-319-07695-9_27</a>

Result language
angličtina
Original language name
Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem
Original language 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 setof 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GP13-18316P" target="_blank" >GP13-18316P: Self-Organizing Maps for Multi-Goal Path Planning Tasks</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)