Trajectory Stability in the Traveling Salesman Problem
DownloadCOMPLEXITY.2018.2826082.pdf (2.995Mb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2018-04Department
Massachusetts Institute of Technology. Department of Urban Studies and PlanningJournal
Complexity
Publisher
Hindawi Publishing Corporation
Citation
Sánchez, Sergio et al. "Trajectory Stability in the Traveling Salesman Problem." Complexity 2018 (April 2018): 2826082 © 2018 Sergio Sánchez et al
Version: Final published version
ISSN
1076-2787
1099-0526