IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9562125.html
   My bibliography  Save this article

Can the Agent with Limited Information Solve Travelling Salesman Problem?

Author

Listed:
  • Tomoko Sakiyama
  • Ikuo Arizono

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 TSP means 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.

Suggested Citation

  • Tomoko Sakiyama & Ikuo Arizono, 2017. "Can the Agent with Limited Information Solve Travelling Salesman Problem?," Complexity, Hindawi, vol. 2017, pages 1-6, April.
    • Handle: RePEc:hin:complx:9562125
    DOI: 10.1155/2017/9562125
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2017/9562125.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2017/9562125.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/9562125?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Audrey E. Cramer & C. R. Gallistel, 1997. "Vervet monkeys as travelling salesmen," Nature, Nature, vol. 387(6632), pages 464-464, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mathieu Lihoreau & Nigel E Raine & Andrew M Reynolds & Ralph J Stelzer & Ka S Lim & Alan D Smith & Juliet L Osborne & Lars Chittka, 2012. "Radar Tracking and Motion-Sensitive Cameras on Flowers Reveal the Development of Pollinator Multi-Destination Routes over Large Spatial Scales," PLOS Biology, Public Library of Science, vol. 10(9), pages 1-13, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:9562125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.