Skip to main content
SpringerLink
Log in

Simulated annealing: Use of a new tool in bin packing

  • Section III Quantitative Models, Data Structuring And Information Processing
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Simulated annealing (statistical cooling) is applied to bin packing problems. Different cooling strategies are compared empirically and for a particular 100 item problem a solution is given which is most likely the best known so far.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Bonomi and J.-L. Lutton, TheN-city traveling salesman problem: statistical mechanics and the Metropolis algorithm, SIAM Review 26 (1984) 551–568.

    Google Scholar 

  2. M. Garey and D. Johnson,Computers and Intractability (Freeman, San Francisco, 1979).

    Google Scholar 

  3. B. Gidas, Nonstationary Markov chains and convergence of the annealing algorithm, J. Stat. Physics 39 (1985).

  4. R.L. Graham, Combinatorial scheduling theory, in:Mathematics Today, ed. L.A. Steen (Springer, New York, 3rd printing, 1984).

    Google Scholar 

  5. R.L. Graham, private communication, 1986.

  6. B. Hajek, A tutorial survey of theory and applications of simulated annealing, IEEE Conf. on Decision and Control, 1985.

  7. B. Hajek, Cooling schedules for optimal annealing, to appear in Mathematics of OR.

  8. W. Kern, On the depth of combinatorial optimization problems, report no. 86/33, 1986, Math. Inst., Univ. Köln, W. Germany.

    Google Scholar 

  9. P. van Laarhoven and E. Aarts, Simulated annealing: a review of the theory and applications, preprint.

  10. M. Lundy and A. Mees, Convergence of an annealing algorithm, Math. Prog. 34 (1986) 111–124.

    Google Scholar 

  11. D. Mitra, F. Romeo and A. Sangiovanni-Vincentelli, Convergence and finite time behaviour of simulated annealing, Adv. Appl. Prob. 18 (1986) 747–771.

    Google Scholar 

  12. M. Weber and Th.M. Liebling, Eucledian matching problems and the Metropolis algorithm, ZOR Ser. A 30 (1986) 85–110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik und OR, Universität Passau, Postfach 2540, D-8390, Passau, W.-Germany

    Thomas Kämpke

Authors
  1. Thomas Kämpke
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work was partially done during the author's visit to the University of California, Berkeley, sponsored by the Humboldt-Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kämpke, T. Simulated annealing: Use of a new tool in bin packing. Ann Oper Res 16, 327–332 (1988). https://doi.org/10.1007/BF02283751

Download citation

  • Issue Date:

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

Keywords

Search

Navigation