Trajectory Stability in the Traveling Salesman Problem

Sergio Sánchez; Germinal Cocho; Jorge Flores; Carlos Gershenson; Gerardo Iñiguez; Carlos Pineda

doi:10.1155/2018/2826082

Trajectory Stability in the Traveling Salesman Problem

Sergio Sánchez
, Germinal Cocho
, Jorge Flores
, Carlos Gershenson
, Gerardo Iñiguez
, Carlos Pineda^*

^*Tämän työn vastaava kirjoittaja

Tietotekniikan laitos

Universidad Nacional Autónoma de México
Massachusetts Institute of Technology
St. Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO)
University of Vienna

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

1 Sitaatiot (Scopus)

178 Lataukset (Pure)

Abstrakti

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.

Alkuperäiskieli	Englanti
Artikkeli	2826082
Sivut	1-8
Julkaisu	Complexity
Vuosikerta	2018
DOI - pysyväislinkit	https://doi.org/10.1155/2018/2826082
Tila	Julkaistu - 1 tammik. 2018
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Rahoitus

The authors acknowledge support from UNAM-PAPIIT Grants nos. IN111015 and IG100518, CONACyT Grant no. 285754, and the Fundación Marcos Moshinsky.

Pääsy asiakirjaan

10.1155/2018/2826082

2826082Final published version, 3,91 MBLisenssi: CC BY

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@article{3b9ed393cacb45ff9c4a5094008bf98d,

title = "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.",

author = "Sergio S{\'a}nchez and Germinal Cocho and Jorge Flores and Carlos Gershenson and Gerardo I{\~n}iguez and Carlos Pineda",

year = "2018",

month = jan,

day = "1",

doi = "10.1155/2018/2826082",

language = "English",

volume = "2018",

pages = "1--8",

journal = "Complexity",

issn = "1076-2787",

publisher = "Wiley",

}

TY - JOUR

T1 - Trajectory Stability in the Traveling Salesman Problem

AU - Sánchez, Sergio

AU - Cocho, Germinal

AU - Flores, Jorge

AU - Gershenson, Carlos

AU - Iñiguez, Gerardo

AU - Pineda, Carlos

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

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.

UR - https://www.scopus.com/pages/publications/85048644005

U2 - 10.1155/2018/2826082

DO - 10.1155/2018/2826082

M3 - Article

AN - SCOPUS:85048644005

SN - 1076-2787

VL - 2018

SP - 1

EP - 8

JO - Complexity

JF - Complexity

M1 - 2826082

ER -

Trajectory Stability in the Traveling Salesman Problem

Abstrakti

Rahoitus

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä