Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Given a finite set of circles of different sizes we study the strip packing problem (SPP) as well as the Knapsack Problem (KP). The SPP asks for a placement of all circles within a rectangular strip of fixed width so that the variable length of the strip is minimized. The KP requires packing of a subset of the circles in a given rectangle so that the wasted area is minimized. To solve these problems some greedy algorithms were developed which enhance the algorithms proposed by Huang et al. (J Oper Res Soc 56:539–548, 2005). Furthermore, the new greedy algorithms were parallelized using a master slave approach. The resulting parallel methods were tested using the instances introduced by Stoyan and Yaskov (Eur J Oper Res 156:590–600, 2004). Additionally, two sets of 128 instances each for the SPP and for the KP were generated and results for these new instances are also reported.

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

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

[3]  Vangelis Th. Paschos,et al.  A simulated annealing approach for the circular cutting problem , 2004, Eur. J. Oper. Res..

[4]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[5]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[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]  H. Dyckhoff,et al.  Vorwort der Herausgeber zum Themenheft „Verpackungslogistik/Packaging logistics“ , 1991 .

[8]  Hermann Gehring,et al.  New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[9]  K. Dowsland.  Optimising the palletisation of cylinders in cases , 1991 .

[10]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[11]  Colin Reeves.  Genetic Algorithms , 2003, Handbook of Metaheuristics.

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

[13]  L. Tóth.  Lagerungen in der Ebene auf der Kugel und im Raum , 1953 .

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

[15]  R. A. Cuninghame-Green,et al.  Packing and Covering in Combinatorics , 1980 .

[16]  Mhand Hifi,et al.  Approximate algorithms for constrained circular cutting problems , 2004, Comput. Oper. Res..

[17]  Emanuel Falkenauer,et al.  Genetic Algorithms and Grouping Problems , 1998 .

[18]  Philip E. Gill,et al.  Practical optimization , 1981 .

[19]  Teodor Gabriel Crainic,et al.  Parallel Strategies for Meta-Heuristics , 2003, Handbook of Metaheuristics.

[20]  Kathryn A. Dowsland.  Modem heuristic techniques for combinatorial problems , 1993 .

[21]  Y. Li,et al.  Greedy algorithms for packing unequal circles into a rectangular container , 2005, J. Oper. Res. Soc..

[22]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[23]  J. A. George,et al.  Packing different-sized circles into a rectangular container , 1995 .

[24]  Hamish J. Fraser,et al.  Integrated container loading software for pulp and paper industry , 1994 .