Skip to main content
Log in

A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem

  • Articles
  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

Abstract

A quantitative study is presented of the typical behavior of the simulated annealing algorithm based on a cooling schedule presented previously by the authors. The study is based on the analysis of numerical results obtained by systematically applying the algorithm to a 100-city traveling salesman problem. The expectation and the variance of the cost are analyzed as a function of the control parameter of the cooling schedule. A semiempirical average-case performance analysis is presented from which estimates are obtained on the expectation of the average final result obtained by the simulated annealing algorithm as a function of the distance parameter, which determines the decrement of the control parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. H. L. Aarts and P. J. M. van Laarhoven,Philips J. Res. 40:193–226 (1985).

    Google Scholar 

  2. E. H. L. Aarts and P. J. M. van Laarhoven, inProceedings International Conference on Computer-Aided Design (Santa Clara, November 1985), pp. 206–208.

  3. K. Binder,Monte Carlo Methods in Statistical Physics (Springer-Verlag, Berlin, 1986).

    Google Scholar 

  4. V. Černy,J. Optim. Theory Appl. 45:41–51 (1985).

    Google Scholar 

  5. G. S. Grest, C. M. Soukoulis, and K. Levin,Phys. Rev. Lett. 56:1148–1151 (1986).

    Google Scholar 

  6. B. Hajek, inProceedings 24th Conference on Decision and Control (Ft. Lauderdale, December 1985), pp. 755–760.

  7. R. Jonker and T. Volgenant,Oper. Res. 32:837–846 (1984).

    Google Scholar 

  8. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi,Science 220:671–680 (1983).

    Google Scholar 

  9. S. Kirkpatrick and G. Toulouse,J. Phys. (Paris) 46:1277–1292 (1985).

    Google Scholar 

  10. P. J. M. van Laarhoven and E. H. L. Aarts,Simulated Annealing: Theory and Applications (Kluwer, Dordrecht, 1987).

    Google Scholar 

  11. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys,The Traveling Salesman Problem (Wiley, Chichester, 1985).

    Google Scholar 

  12. S. Lin and B. W. Kernighan,Oper. Res. 21:498–516 (1973).

    Google Scholar 

  13. M. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller,J. Chem. Phys. 21:1087–1092 (1953).

    Google Scholar 

  14. E. Palmer,Graphical Evolution (Wiley Interscience, New York, 1985).

    Google Scholar 

  15. F. Romeo and A. L. Sangiovanni-Vincentelli, inProceedings 1985 Chapel Hill Conference on VLSI (May 1985), pp. 393–417.

  16. G. H. Sasaki and B. Hajek,J. ACM, to appear.

  17. S. Solla, G. Sorkin, and S. White, inDisordered Systems and Biological Organization (Springer-Verlag, Berlin, 1985).

    Google Scholar 

  18. S. R. White, inProceedings International Conference Computer Design (Port Chester, November 1984), pp. 646–651.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aarts, E.H.L., Korst, J.H.M. & van Laarhoven, P.J.M. A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. J Stat Phys 50, 187–206 (1988). https://doi.org/10.1007/BF01022991

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01022991

Key words

Navigation