Trajectory Stability in the Traveling Salesman Problem
Name
COMPLEXITY.2018.2826082.pdf
Size
3 MB
Format
Adobe PDF
Checksum (MD5)
7390b748a31fb36e00b4b30488d8e999
Download all files submitted through automated deposit
Author(s)
Sánchez, Sergio
Cocho, Germinal
Flores, Jorge
Iñiguez, Gerardo
Pineda, Carlos
Gershenson Garcia, Carlos
Date Issued
April 2018
Journal
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Urban Studies and Planning
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1155/2018/2826082
