Research ArticleOpen AccessGoogle Scholar indexed
Information in the Traveling Salesman Problem
Yeshiva University, Department of Physics, New York, NY 10033, USA
Facultad de Ciencias, Departamento de Física, Montevideo, Uruguay
Yeshiva University, Department of Physics, New York, NY 10033, USA
Yeshiva University, Department of Physics, New York, NY 10033, USA
- 1 Yeshiva University, Department of Physics, New York, NY 10033, USA
- 2 Facultad de Ciencias, Departamento de Física, Montevideo, Uruguay
- 3 Yeshiva University, Department of Physics, New York, NY 10033, USA
- 4 Yeshiva University, Department of Physics, New York, NY 10033, USA
Applied Mathematics·Volume 03 (2012)·Pages 926–930·Published 28 August 2012·DOI10.4236/am.2012.38138
Copy link · social · email
Abstract
In the Simulated Annealing algorithm applied to the Traveling Salesman Problem, the total tour length decreases with temperature. Empirical observation shows that the tours become more structured as the temperature decreases. We quantify this fact by proposing the use of the Shannon information content of the probability distribution function of inter–city step lengths. We find that information increases as the Simulated Annealing temperature decreases. We also propose a practical use of this insight to improve the standard algorithm by switching, at the end of the algorithm, the cost function from the total length to information content. In this way, the final tour should not only be shorter, but also smoother.
KeywordsTraveling Salesman ProblemShannon Entropy
- W. J. Cook, “In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation,” Princeton University Press, Princeton, 2011.
- H. Fort, M. Kornbluth and F. Zypman, “Traveling Salesman Problem for Finite-Size Cities,” Mathematical Structures in Computer Science, Vol. 20, No. 6, 2010, pp. 1067-1078. doi:10.1017/S096012951000037X
- M. N. Ghosh, “Expected Travel among Random Points,” Calcutta Statistical Association, Vol. 2, 1949, pp. 83-87.
- J. Beardwood, J. H. Halton and J. M. Hammersley, “The Shortest Path through Many Points,” Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 55, No. 4, 1959, pp. 299-327. doi:10.1017/S0305004100034095
- A. G. Percus and O. C. Martin, “Finite Size and Dimensional Dependence of the Euclidean Traveling Salesman Problem,” Physical Review Letters, Vol. 76, 1996, pp. 1188-1191. doi:10.1103/PhysRevLett.76.1188
- L. Brillouin, “The Negentropy Principle of Information,” Journal of Applied Physics, Vol. 24, No. 9, 1953, p. 1152. doi:10.1063/1.1721463
- P. Fleurquin, H. Fort, M. Kornbluth, R. Sandler, M. Segall and F. Zypman, “Negentropy Generation and Fractality in the Dry Friction of Polished Surfaces,” Entropy, Vol. 12, No. 3, 2010, pp. 480-489. doi:10.3390/e12030480
- C. E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, Vol. 27, 1948, pp. 379-423.
- W. Press, S. A. Teukolsky, W. T. Vetterling and B. P. Flannery, “Numerical Recipes in C,” 2nd Edition, Cambridge University Press, Melboune, New York, 1992.
- S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, “Optimization by Simulated Annealing,” Science, New Series, Vol. 220, 1983, pp. 671-680.
- M. Held and R. M. Karp, “A Dynamic Programming Approach to Sequencing Problems,” Journal of the Society for Industrial and Applied Mathematics, Vol. 10, No. 1, 1962, pp. 196-210. doi:10.1137/0110015
- S. Lin, “Computer Solutions of the Traveling Salesman Problem,” Bell Systems Technical Journal, Vol. 44, 1965, pp. 2245-2269.
- J. Philip, “The Probability Distribution of the Distance between Two Random Points in a Box,” Technical Report Number TRITA MAT 07 MA 10, 1991. http://www.math.kth.se/~johanph/habc.pdf
- J. A. Wheeler, “Information, Physics, Quantum: The Search for Links,” Proceedings of 3rd International Symposium on the Foundations of Quantum Mechanics, Tokyo, 1989, pp. 354-368.