A Greedy Heuristic Based on Corner Occupying Action for the 2D Circular Bin Packing Problem

The paper proposes a new two-dimensional circular bin packing problem (2D-CBPP) that is closely related to the well-known 2D rectangular bin packing problem and the single container circle packing problem. Inspired by Gold corner, silver side and strawy void for Chinese Go game, a greedy algorithm based on corner occupying action (GACOA) is proposed for solving the 2D-CBPP. We define the corner occupying action to pack the outside circles into a bin as compactly as possible, such that the number of used bins is minimized. As there are no existing benchmarks for this proposed problem, we generate two sets of benchmark instances with equal and unequal circles respectively. Experimental results show that the proposed algorithm performs quite well on these 2D-CBPP instances.

[1]  Paolo Toth,et al.  A Set-Covering-Based Heuristic Approach for Bin-Packing Problems , 2006, INFORMS J. Comput..

[2]  Ramón Alvarez-Valdés,et al.  A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing , 2010, Ann. Oper. Res..

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

[4]  John E. Beasley,et al.  A formulation space search heuristic for packing unequal circles in a fixed size circular container , 2016, Eur. J. Oper. Res..

[5]  Yan Jin,et al.  An efficient deterministic heuristic for two-dimensional rectangular packing , 2012, Comput. Oper. Res..

[6]  Daniele Vigo,et al.  Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..

[7]  Duanbing Chen,et al.  Two-dimensional equilibrium constraint layout using simulated annealing , 2010, Comput. Ind. Eng..

[8]  John E. Beasley,et al.  Packing unequal circles using formulation space search , 2013, Comput. Oper. Res..

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

[10]  Kun He,et al.  An action-space-based global optimization algorithm for packing circles into a square container , 2015, Comput. Oper. Res..

[11]  Tao Ye,et al.  A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints , 2013, Comput. Ind. Eng..

[12]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[13]  Kun He,et al.  An efficient placement heuristic for three-dimensional rectangular packing , 2011, Comput. Oper. Res..

[14]  Andrew Lim,et al.  A skyline heuristic for the 2D rectangular packing and strip packing problems , 2011, Eur. J. Oper. Res..

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

[16]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[17]  Henrik I. Christensen,et al.  Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..