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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
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)
Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. European Journal of Operational Research 54(1), 141–150 (1991)
Dowsland, K.A., Dowsland, W.B.: Packing problems. European Journal of Operational Research 56(1), 2–14 (1992)
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)
Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal disks in a circle. Discrete & Computational Geometry, 179–194 (1997)
Wenqi, H., Shuhao, Z.: A quasi-physical method for solving packing problems. Acta Mathematicae Applagatae Sinica 2(2), 176–180 (1979)
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)
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)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–689 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, D., Huang, W. (2004). A Simulated Annealing Algorithm for the Circles Packing Problem. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24685-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24685-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22114-2
Online ISBN: 978-3-540-24685-5
eBook Packages: Springer Book Archive