Packing equal disks in a unit square: an immunological optimization approach

Packing equal disks in a unit square is a classical geometrical problem which arises in many industrial and scientific fields. Finding optimal solutions has been proved to be NP-hard, therefore, only local optimal solutions can be identified. We tackle this problem by means of the optimization Immune Algorithm (optIA), which has been proved to be among the best derivative-free optimization algorithms. In particular, OPTIA is used to pack up to 150 disks in a unit square. Experimental results show that the immune algorithm is able to locate the putative global optimum for all the instances. Moreover, a comparison with the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) shows that OPTIA is more robust.

[1]  Giuseppe Nicosia,et al.  An Advanced Clonal Selection Algorithm with Ad-Hoc Network-Based Hypermutation Operators for Synthesis of Topology and Sizing of Analog Electrical Circuits , 2008, ICARIS.

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

[3]  János D. Pintér,et al.  Solving circle packing problems by global optimization: Numerical results and industrial applications , 2008, Eur. J. 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]  Vincenzo Cutello,et al.  Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators , 2004, ICARIS.

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

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

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

[9]  Bernardetta Addis,et al.  Packing circles in a square: new putative optima obtained via global optimization , 2005 .

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

[11]  Tao Ye,et al.  Greedy vacancy search algorithm for packing equal circles in a square , 2010, Oper. Res. Lett..

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

[13]  Vincenzo Cutello,et al.  Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials , 2005, ICARIS.

[14]  Mhand Hifi,et al.  A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies , 2009, Adv. Oper. Res..

[15]  Vincenzo Cutello,et al.  An immune algorithm with hyper-macromutations for the Dill's 2D hydrophobic-hydrophilic model , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[16]  Vincenzo Cutello,et al.  A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems , 2005, WIRN/NAIS.

[17]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[18]  Giuseppe Nicosia,et al.  Clonal selection: an immunological algorithm for global optimization over continuous spaces , 2012, J. Glob. Optim..