Abstract
In this work we propose a new stochastic optimization algorithm for solving the problem of optimal packing of n non-overlapping equal circles in a square. It will be shown that our procedure can find most of the optimal solutions for all the problems previously solved and reported in the literature. Results obtained by our algorithm for up to 100 circles are given in relevant numerical and graphical form. For n = 32, 37, 47, 62 and 72 the algorithm has obtained better solutions than those reported on in the literature on packing. In addition, forty new and unpublished packing results are reported on. The arrangements obtained were validated by interval arithmetic computations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Althöfer and K. U. Koschnick. On the convergence of threshold accepting. Appt. Math. Optim., 24:183–195,1991.
G. Dueck and T. Scheuer. Threshold accepting: a general purpose optimiza-tion algorithm appearing superior to simulated annealing. J. CompUt. Phys., 90:161–175,1990.
R. L. Graham and B. D. Lubachevsky. Repeated patterns of dense packings of equal disks in a square. The Electronic Journal of Combinatorics, 3:1–16, 1996.
D. C. Karnop. Random search techniques for optimization problems. AUto-matica, 1:111–121,1963.
M. Locatelli and U. Raber. A Deterministic Global Optimization Approach for Solving the Problem of Pacldng Equal Circles in a Square. International Workshop on Global Optimization (G0.99), Firenze, Italy, 1999
C. D. Maranas, C. A. Floudas, and P. M. Pardalos. New results in the packing of equal circles in a square. Discrete Mathematics, 142:287–293, 1995.
J. Matyas. Random optimization. Automatization and Remote Control, 26:244–251,1965.
J. R. McDonnell and D. Waagen. Evolving recurrent perceptrons for time-series modeling. IEEE Duns. on Neural Networks,5(1):24–38,1994.
M. Mollard and C. Payan. Some progress in the packing of equal circles in a square. Discrete Mathernatics, 84:303–307,1990.
K. J. Nurmela. Constructing combinatorial designs by local search. Series A: Research Reports 27, Digital Systems Laboratory, Helsinki University of Technology, 1993.
K. J. Nurmela and P. R. J. Östergard. Pacidng up to 50 equal circles in a square. Discrete Computational Geometry, 18:111–120,1997.
R. Peikert. Dichteste Packungen von gleichen Kreisen in einem Quadrat. Ele-mente der Mathematik, 49:16–26,1994.
R. Peikert, D. Wiirtz, M. Monagan, and C. de Groot. Packing circles in a square: a review and new results. In P. Kall (ed.), System Modelling and Op-timization, volume 180 of Lecture Notes in Control and Information Sciences, 45–54. Springer-Verlag, Berlin, 1992.
S. S. Rao. Optimization Theory and Applications. John Willey and Sons, New York, 1978.
F. J. Solis and J. B. Wets. Minimization by random search techniques. Math. of Operations Research, 6(1):19–50, 1981.
P. G. Szabó, T. Csendes, L. G. Casado and I. Garcia. Packing Equal Circles in a Square I. Problem Setting and Bounds for Optimal Solutions. This volume. Available at http://www.inf.u-szeged.hu/ ticsendes/packl.ps.gz
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this chapter
Cite this chapter
Casado, L.G., García, I., Szabó, P.G., Csendes, T. (2001). Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm. In: Giannessi, F., Pardalos, P., Rapcsák, T. (eds) Optimization Theory. Applied Optimization, vol 59. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0295-7_15
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0295-7_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-0009-6
Online ISBN: 978-1-4613-0295-7
eBook Packages: Springer Book Archive