Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017 (2017), Article ID 9562125, 6 pages
https://doi.org/10.1155/2017/9562125
Research Article

Can the Agent with Limited Information Solve Travelling Salesman Problem?

Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan

Correspondence should be addressed to Tomoko Sakiyama

Received 4 January 2017; Revised 14 March 2017; Accepted 29 March 2017; Published 11 April 2017

Academic Editor: Sergio Gómez

Copyright © 2017 Tomoko Sakiyama and Ikuo Arizono. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. Bullnheimer, R. F. Hartl, and C. Strauss, “A new rank based version of the ant system: a computational study,” Central European Journal of Operations Research, vol. 7, no. 1, pp. 25–38, 1999. View at Google Scholar
  2. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combination Optimization, John Wiley & Sons, New York, NY, USA, 1995.
  3. R. J. Sternberg and J. E. Pretz, Cognition and Intelligence: Identifying the Mechanisms of the Mind, Cambridge University Press, Cambridge, UK, 2005.
  4. A. M. Reynolds, M. Lihoreau, and L. Chittka, “A simple iterative model accurately captures complex trapline formation by bumblebees across spatial scales and flower arrangements,” PLoS Computational Biology, vol. 9, no. 3, Article ID e1002938, 2013. View at Publisher · View at Google Scholar · View at Scopus
  5. A. M. Reynolds, “Chemotaxis can provide biological organisms with good solutions to the travelling salesman problem,” Physical Review E, vol. 83, no. 5, Article ID 052901, 4 pages, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. A. E. Cramer and C. R. Gallistel, “Vervet monkeys as travelling salesmen,” Nature, vol. 387, no. 6632, p. 464, 1997. View at Google Scholar · View at Scopus
  7. G. Gutin, A. Yeo, and A. Zverovich, “Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP,” Discrete Applied Mathematics, vol. 117, no. 1–3, pp. 81–86, 2002. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Lihoreau, L. Chittka, and N. E. Raine, “Travel optimization by foraging bumblebees through readjustments of traplines after discovery of new feeding locations,” American Naturalist, vol. 176, no. 6, pp. 744–757, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Lihoreau, L. Chittka, and N. E. Raine, “Trade-off between travel distance and prioritization of high-reward sites in traplining bumblebees,” Functional Ecology, vol. 25, no. 6, pp. 1284–1292, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Lihoreau, L. Chittka, S. C. Le Comber, and N. E. Raine, “Bees do not use nearest-neighbour rules for optimization of multi-location routes,” Biology Letters, vol. 8, no. 1, pp. 13–16, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. C. Detrain and J.-L. Deneubourg, “Self-organized structures in a superorganism: do ants ‘behave’ like molecules?” Physics of Life Reviews, vol. 3, no. 3, pp. 162–187, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. P. Bak and D. R. Chialvo, “Adaptive learning by extremal dynamics and negative feedback,” Physical Review E, vol. 63, no. 3, Article ID 031912, 2001. View at Google Scholar · View at Scopus
  13. N. R. Franks, J. W. Hooper, A. Dornhaus, P. J. Aukett, A. L. Hayward, and S. M. Berghoff, “Reconnaissance and latent learning in ants,” Proceedings of the Royal Society B: Biological Sciences, vol. 274, no. 1617, pp. 1505–1509, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Ginelli and H. Chaté, “Relevance of metric-free interactions in flocking phenomena,” Physical Review Letters, vol. 105, no. 16, Article ID 168103, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. L.-P. Bigras, M. Gamache, and G. Savard, “The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times,” Discrete Optimization, vol. 5, no. 4, pp. 685–699, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. P. Schmid-Hempel, A. Kacelnik, and A. I. Houston, “Honeybees maximize efficiency by not filling their crop,” Behavioral Ecology and Sociobiology, vol. 17, no. 1, pp. 61–66, 1985. View at Publisher · View at Google Scholar · View at Scopus
  17. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
  18. J. Buhl, D. J. T. Sumpter, I. D. Couzin et al., “From disorder to order in marching locusts,” Science, vol. 312, no. 5778, pp. 1402–1406, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. S. A. Kauffman, At Home in the Universe: The Search for Laws of Self-Organization and Complexity, Oxford University Press, 1995.
  20. J. Jones and A. Adamatzky, “Computation of the travelling salesman problem by a shrinking blob,” Natural Computing, vol. 13, no. 1, pp. 1–16, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. R. Durbin and D. Willshaw, “An analogue approach to the travelling salesman problem using an elastic net method,” Nature, vol. 326, no. 6114, pp. 689–691, 1987. View at Publisher · View at Google Scholar · View at Scopus
  22. J. K. Lenstra and A. H. G. Rinnooy Kan, “Some simple applications of the travelling salesman problem,” Operational Research Quarterly, vol. 26, no. 4, pp. 717–733, 1975. View at Publisher · View at Google Scholar · View at Scopus
  23. D. Chhajed and T. Lowe, Building Intuition: Insights from Basic Operations Management Models and Principles, International Series in Operations Research and Management Science, Springer, 2008.
  24. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York, NY, USA, 1979.
  25. R. L. Graham, “Bounds for certain multiprocessing anomalies,” Bell System Technical Journal, vol. 45, no. 9, pp. 1563–1581, 1966. View at Publisher · View at Google Scholar · View at Scopus