Trajectory stability in the traveling salesman problem
classification
🌊 nlin.AO
keywords
rankchangeproblemsalesmantimetrajectorytravelinganalyze
pith:VV2IIYLB Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{VV2IIYLB}
Prints a linked pith:VV2IIYLB badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.