Disk Packing in a Square: A New Global Optimization Approach

We present a new computational approach to the problem of placing n identical nonoverlapping disks in the unit square in such a way that their radii are maximized. The problem has been studied in a large number of papers, from both a theoretical and a computational point of view. In this paper, we conjecture that the problem possesses a so-called funneling landscape, a feature that is commonly found in molecular conformation problems. Based on this conjecture, we develop a stochastic search algorithm that displays excellent numerical performance. Thanks to this algorithm, we could improve over previously known putative optima in the range n ≤ 130 in as many as 32 instances, the smallest of which is n = 53.

[1]  Patric R. J. Östergård,et al.  More Optimal Packings of Equal Circles in a Square , 1999, Discret. Comput. Geom..

[2]  Rex K. Kincaid,et al.  Approximate Solutions of Continuous Dispersion Problems , 2005, Ann. Oper. Res..

[3]  Dick den Hertog,et al.  Maximin Latin Hypercube Designs in Two Dimensions , 2007, Oper. Res..

[4]  Tibor Csendes,et al.  A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems , 2005, SIAM J. Optim..

[5]  Marco Locatelli,et al.  Packing equal circles in a square: a deterministic global optimization approach , 2002, Discret. Appl. Math..

[6]  J. Doye.  Physical Perspectives on the Global Optimization of Atomic Clusters , 2000, cond-mat/0007338.

[7]  Ronald L. Graham,et al.  Improving Dense Packings of Equal Disks in a Square , 2000, Electron. J. Comb..

[8]  Fabio Schoen,et al.  Global Optimization of Morse Clusters by Potential Energy Transformations , 2004, INFORMS J. Comput..

[9]  Patric R. J. Östergård,et al.  Packing up to 50 Equal Circles in a Square , 1997, Discret. Comput. Geom..

[10]  Bernardetta Addis,et al.  Efficiently packing unequal disks in a circle , 2008, Oper. Res. Lett..

[11]  Julian Lee,et al.  Unbiased global optimization of Lennard-Jones clusters for N < or =201 using the conformational space annealing method. , 2003, Physical review letters.

[12]  Doye.  Effect of compression on the global optimization of atomic clusters , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[13]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[14]  J. Doye,et al.  Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms , 1997, cond-mat/9803344.

[15]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[16]  Fabio Schoen,et al.  Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters , 2003, Comput. Optim. Appl..

[17]  Panos M. Pardalos,et al.  New results in the packing of equal circles in a square , 1995, Discret. Math..

[18]  Kenneth Falconer,et al.  Unsolved Problems In Geometry , 1991 .

[19]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2005, SIAM Rev..

[20]  Tibor Csendes,et al.  Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm , 2001 .

[21]  Appliquees Joseph Liouville.  Dense Packings of Equal Spheres in a Cube , 2004 .

[22]  A. Meir,et al.  On a Geometric Extremum Problem , 1965, Canadian Mathematical Bulletin.

[23]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[24]  J. Schaer.  The Densest Packing of 9 Circles in a Square , 1965, Canadian Mathematical Bulletin.

[25]  R. Peikert,et al.  Packing circles in a square: A review and new results , 1992 .

[26]  Robert H. Leary,et al.  Global Optimization on Funneling Landscapes , 2000, J. Glob. Optim..

[27]  Ronald L. Graham,et al.  Repeated Patterns of Dense Packings of Equal Disks in a Square , 1996, Electron. J. Comb..

[28]  Inmaculada García,et al.  Equal Circles Packing in a Square II. - New Results for up to 100 Circles Using the TAMSASS-PECS Alg , 2000 .

[29]  Aleksandar Donev,et al.  A linear programming algorithm to test for jamming in hard-sphere packings , 2002 .

[30]  Andrea Grosso,et al.  A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures , 2007, Math. Program..

[31]  Marco Locatelli,et al.  On the Multilevel Structure of Global Optimization Problems , 2005, Comput. Optim. Appl..