Evaluation of Traveling Salesman Problem Instance Hardness by Clustering
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241715" target="_blank" >RIV/61989100:27240/18:10241715 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-68527-4_41" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-68527-4_41</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-68527-4_41" target="_blank" >10.1007/978-3-319-68527-4_41</a>
Alternative languages
Result language
angličtina
Original language name
Evaluation of Traveling Salesman Problem Instance Hardness by Clustering
Original language description
Traveling salesman problem (TSP) is a well-known NP-hard combinatorial optimization problem. It has been solved by a number of exact and approximate algorithms and serves as a testbed for new heuristic and metaheuristic optimization algorithms. However, it is often not easy to evaluate the hardness (complexity) of a TSP instance. Simple measures such as the number of cities or the minimum (maximum) route length do not capture the internal structure of a TSP instance sufficiently. In this work, we propose a new method for the assessment of TSP instance complexity based on clustering. The new approach is evaluated on a set of randomized TSP instances with different structure and its relation to the performance of a selected metaheuristic TSP solver is studied. (C) 2018, Springer International Publishing AG.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ16-25694Y" target="_blank" >GJ16-25694Y: Multi-paradigm data mining algorithms based on information retrieval, fuzzy, and bio-inspired methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Article name in the collection
Advances in Intelligent Systems and Computing. Volume 682
ISBN
978-3-319-68526-7
ISSN
2194-5357
e-ISSN
neuvedeno
Number of pages
9
Pages from-to
379-387
Publisher name
Springer Verlag
Place of publication
Cham
Event location
Málaga
Event date
Oct 9, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—