Linear models for the approximate solution of the problem of packing equal circles into a given domain

The linear models for the approximate solution of the problem of packing the maximum number of equal circles of the given radius into a given closed bounded domain G are proposed. We construct a grid in G; the nodes of this grid form a finite set of points T, and it is assumed that the centers of circles to be packed can be placed only at the points of T. The packing problems of equal circles with the centers at the points of T are reduced to 0–1 linear programming problems. A heuristic algorithm for solving the packing problems based on linear models is proposed. This algorithm makes it possible to solve packing problems for arbitrary connected closed bounded domains independently of their shape in a unified manner. Numerical results demonstrating the effectiveness of this approach are presented.

[1]  T. Tarnai,et al.  UPPER BOUND OF DENSITY FOR PACKING OF EQUAL CIRCLES IN SPECIAL DOMAINS IN THE PLANE , 2000 .

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

[3]  José Mario Martínez,et al.  Optimizing the packing of cylinders into a rectangular container: A nonlinear approach , 2005, Eur. J. Oper. Res..

[4]  Yaodong Cui,et al.  Strips minimization in two-dimensional cutting stock of circular items , 2010, Comput. Oper. Res..

[5]  Andrea Grosso,et al.  Solving the problem of packing equal and unequal circles in a circular container , 2010, J. Glob. Optim..

[6]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[7]  Ernesto G. Birgin,et al.  New and improved results for packing identical unitary radius circles within triangles, rectangles and strips , 2010, Comput. Oper. Res..

[8]  Eckehard Specht,et al.  High density packings of equal circles in rectangles with variable aspect ratio , 2013, Comput. Oper. Res..

[9]  R. Graham,et al.  A Packing Inequality for Compact Convex Subsets of the Plane , 1969, Canadian Mathematical Bulletin.

[10]  Ronald L. Graham,et al.  Minimum perimeter rectangles that enclose congruent non-overlapping circles , 2009, Discret. Math..

[11]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[12]  Tao Ye,et al.  Global optimization method for finding dense packings of equal circles in a circle , 2011, Eur. J. Oper. Res..

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

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

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