A heuristic for the circle packing problem with a variety of containers

In this paper we present a heuristic algorithm based on the formulation space search method to solve the circle packing problem. The circle packing problem is the problem of finding the maximum radius of a specified number of identical circles that can be fitted, without overlaps, into a two-dimensional container of fixed size. In this paper we consider a variety of containers: the unit circle, unit square, rectangle, isosceles right-angled triangle and semicircle. The problem is formulated as a nonlinear optimization problem involving both Cartesian and polar coordinate systems. Formulation space search consists of switching between different formulations of the same problem, each formulation potentially having different properties in terms of nonlinear optimization. As a component of our heuristic we solve a nonlinear optimization problem using the solver SNOPT. Our heuristic improves on previous results based on formulation space search presented in the literature. For a number of the containers we improve on the best result previously known. Our heuristic is also a computationally effective approach (when balancing quality of result obtained against computation time required) when compared with other work presented in the literature.

[1]  Yu Zheng,et al.  An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems , 2009, COCOA.

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

[3]  Alain Hertz,et al.  Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] , 2009, Discret. Appl. Math..

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

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

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

[7]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[8]  Yali Wang,et al.  Efficiently Packing Circles into a Larger Containing Circle , 2009, HPCA.

[9]  Nenad Mladenovic,et al.  Formulation Space Search for Circle Packing Problems , 2007, SLS.

[10]  Ulrich H E Hansmann,et al.  Global optimization by energy landscape paving. , 2002, Physical review letters.

[11]  Yuri Kochetov,et al.  FORMULATION SPACE SEARCH APPROACH FOR THE TEACHER/CLASS TIMETABLING PROBLEM , 2008 .

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

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

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

[15]  Shengjun Xue,et al.  An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle , 2009, Comput. Ind. Eng..

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

[17]  Alain Hertz,et al.  Variable space search for graph coloring , 2006, Discret. Appl. Math..

[18]  János D. Pintér,et al.  Nonlinear optimization with GAMS /LGO , 2007, J. Glob. Optim..

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

[20]  Zhangxin Chen,et al.  High Performance Computing and Applications , 2010, Lecture Notes in Computer Science.

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

[22]  Pierre Hansen,et al.  Les Cahiers Du Gerad Variable Neighborhood Search Methods , 1999 .