Can the agent with limited information solve travelling salesman problem?

Research output: Contribution to journalArticle

Abstract

Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site. It is dependent on relative distances between the nearest site and the other site. Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB. Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous. On the other hand, asymmetric TSPmeans TSP where costs between sites are time-inhomogeneous. Furthermore, the agent exhibits critical properties in some benchmark data. These results suggest that the agent performs adaptive travel using limited information. Our results might be applicable to nonclairvoyant optimization problems.

Original languageEnglish
Article number9562125
JournalComplexity
Volume2017
DOIs
Publication statusPublished - 2017

Fingerprint

heuristics
cost
travel
method

ASJC Scopus subject areas

  • General

Cite this

Can the agent with limited information solve travelling salesman problem? / Sakiyama, Tomoko; Arizono, Ikuo.

In: Complexity, Vol. 2017, 9562125, 2017.

Research output: Contribution to journalArticle

@article{f07c0bbc944e4ba5925e9c0914fc1591,
title = "Can the agent with limited information solve travelling salesman problem?",
abstract = "Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site. It is dependent on relative distances between the nearest site and the other site. Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB. Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous. On the other hand, asymmetric TSPmeans TSP where costs between sites are time-inhomogeneous. Furthermore, the agent exhibits critical properties in some benchmark data. These results suggest that the agent performs adaptive travel using limited information. Our results might be applicable to nonclairvoyant optimization problems.",
author = "Tomoko Sakiyama and Ikuo Arizono",
year = "2017",
doi = "10.1155/2017/9562125",
language = "English",
volume = "2017",
journal = "Complexity",
issn = "1076-2787",
publisher = "John Wiley and Sons Inc.",

}

TY - JOUR

T1 - Can the agent with limited information solve travelling salesman problem?

AU - Sakiyama, Tomoko

AU - Arizono, Ikuo

PY - 2017

Y1 - 2017

N2 - Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site. It is dependent on relative distances between the nearest site and the other site. Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB. Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous. On the other hand, asymmetric TSPmeans TSP where costs between sites are time-inhomogeneous. Furthermore, the agent exhibits critical properties in some benchmark data. These results suggest that the agent performs adaptive travel using limited information. Our results might be applicable to nonclairvoyant optimization problems.

AB - Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site. It is dependent on relative distances between the nearest site and the other site. Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB. Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous. On the other hand, asymmetric TSPmeans TSP where costs between sites are time-inhomogeneous. Furthermore, the agent exhibits critical properties in some benchmark data. These results suggest that the agent performs adaptive travel using limited information. Our results might be applicable to nonclairvoyant optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=85018250972&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018250972&partnerID=8YFLogxK

U2 - 10.1155/2017/9562125

DO - 10.1155/2017/9562125

M3 - Article

VL - 2017

JO - Complexity

JF - Complexity

SN - 1076-2787

M1 - 9562125

ER -