Solving the problem of packing equal and unequal circles in a circular container

In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles within a circular container with minimum radius. Extensive computational experiments have been performed both to analyze the problem at hand, and to choose in an appropriate way the parameter values for the proposed methods. Different improvements with respect to the best results reported in the literature have been detected.

[1]  Ernesto G. Birgin,et al.  Minimizing the object dimensions in circle and sphere packing problems , 2008, Comput. Oper. Res..

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

[3]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

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

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

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

[7]  Yu.G Stoyan,et al.  A mathematical model and a solution method for the problem of placing various-sized circles into a strip , 2004, Eur. J. Oper. Res..

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

[9]  De-fu Zhang,et al.  An effective hybrid algorithm for the problem of packing circles into a larger containing circle , 2005, Comput. Oper. Res..

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

[11]  Yu Li,et al.  A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container , 2003, CP.

[12]  Nenad Mladenovic,et al.  Reformulation descent applied to circle packing problems , 2003, Comput. Oper. Res..

[13]  Huaiqing Wang,et al.  An improved algorithm for the packing of unequal circles within a larger containing circle , 2002, Eur. J. Oper. Res..

[14]  János D. Pintér,et al.  Solving circle packing problems by global optimization: Numerical results and industrial applications , 2008, Eur. J. Oper. Res..

[15]  Jooyoung Lee,et al.  New optimization method for conformational energy calculations on polypeptides: Conformational space annealing , 1997, J. Comput. Chem..

[16]  J. Pintér,et al.  Nonlinear Optimization in Mathematica with MathOptimizer Professional , 2005 .

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

[18]  P. Hansen,et al.  Essays and surveys in global optimization , 2005 .

[19]  Tibor Csendes,et al.  Global Optimization in Geometry — Circle Packing into the Square , 2005 .

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

[21]  Mhand Hifi,et al.  Adaptive and restarting techniques-based algorithms for circular packing problems , 2008, Comput. Optim. Appl..

[22]  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.

[23]  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 .

[24]  Bernardetta Addis,et al.  Disk Packing in a Square: A New Global Optimization Approach , 2008, INFORMS J. Comput..

[25]  Josef Kallrath,et al.  Cutting circles and polygons from area-minimizing rectangles , 2009, J. Glob. Optim..

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

[27]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

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

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

[30]  Tibor Csendes,et al.  New Approaches to Circle Packing in a Square - With Program Codes , 2007, Optimization and its applications.

[31]  Ira M. Gessel,et al.  The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions , 1996, Electron. J. Comb..

[32]  Y. Stoyan,et al.  Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints , 1998 .

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