A Simulated Annealing Algorithm for the Circles Packing Problem

  • Defu Zhang
  • Wenqi Huang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3036)

Abstract

We present a heuristic simulated annealing algorithm to solve the circles packing problem. For constructing a special neighborhood and jumping out of the local minimum trap, some effective heuristic strategies are presented. These strategies are from nature and can allow the iterative process to converge fast. The HSA algorithm inherits the merit of the simulated annealing algorithm, and can avoid the disadvantage of blind search in the simulated annealing algorithm to some extent according to the special neighborhood. The computational results show that the performance of the presented algorithm outperforms that of the quasi-physical quasi-human algorithm.

Keywords

Simulated Annealing Algorithm Packing Problem Heuristic Strategy Special Neighborhood Blind Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  2. 2.
    Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery 1(32), 130–136 (1985)MathSciNetGoogle Scholar
  3. 3.
    Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. European Journal of Operational Research 54(1), 141–150 (1991)MATHCrossRefGoogle Scholar
  4. 4.
    Dowsland, K.A., Dowsland, W.B.: Packing problems. European Journal of Operational Research 56(1), 2–14 (1992)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Raidl, G.R., Kodydek, G.: Genetic Algorithms for the Multiple Container Packing Problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 875–884. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  6. 6.
    Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal disks in a circle. Discrete & Computational Geometry, 179–194 (1997)Google Scholar
  7. 7.
    Wenqi, H., Shuhao, Z.: A quasi-physical method for solving packing problems. Acta Mathematicae Applagatae Sinica 2(2), 176–180 (1979)Google Scholar
  8. 8.
    Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141, 440–453 (2002)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    George, J.A., George, J.M., Lammar, B.W.: Packing different-sized circles into a rectangular container. European Journal of Operational Research 84, 693–712 (1995)MATHCrossRefGoogle Scholar
  10. 10.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–689 (1983)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Defu Zhang
    • 1
  • Wenqi Huang
    • 2
  1. 1.Department of Computer ScienceXiamen UniversityChina
  2. 2.School of Computer ScienceHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations