Ontology highlight
ABSTRACT:
SUBMITTER: Mariescu-Istodor R
PROVIDER: S-EPMC8520904 | biostudies-literature | 2021
REPOSITORIES: biostudies-literature
Mariescu-Istodor Radu R Fränti Pasi P
Frontiers in robotics and AI 20211004
The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solve a TSP problem instance that is larger than 1 M nodes given only 1 h of computing time. In this article, we analyze the results and show which design choices are decisive in providing the best solution to the problem with the given constraints. Ther ...[more]