TY - JOUR T1 - Trajectory Stability in the Traveling Salesman Problem JF - Complexity Y1 - 2018 A1 - Sánchez, Sergio A1 - Cocho, Germinal A1 - Flores, Jorge A1 - Gershenson, Carlos A1 - Iñiguez, Gerardo A1 - Pineda, Carlos AB - 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. VL - 2018 UR - https://doi.org/10.1155/2018/2826082 ER -