arXiv · 1708.06945
Trajectory stability in the traveling salesman problem
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sergio Sánchez, Germinal Cocho, Jorge Flores, Carlos Gershenson, Gerardo Iñiguez, Carlos Pineda. 2017-08-23. Trajectory stability in the traveling salesman problem. https://doi.org/10.1155/2018%2F2826082
Cite the original work for its findings. Save a collection to share your selection of sources.