Trajectory Stability in the Traveling Salesman Problem
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2018-01-01
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Complexity, Volume 2018, pp. 1-8
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.Description
Keywords
Other note
Citation
Sánchez, S, Cocho, G, Flores, J, Gershenson, C, Iñiguez, G & Pineda, C 2018, 'Trajectory Stability in the Traveling Salesman Problem', Complexity, vol. 2018, 2826082, pp. 1-8. https://doi.org/10.1155/2018/2826082