Rotational Placement using Simulated Annealing and Collision Free Region

Abstract The packing problem, which considers how to arrange items on a container without overlaps, can increase the utility rate of the sheet stock. This paper investigates the irregular shape rotational packing problem. In this work the Simulated Annealing (SA) is combined with deterministic heuristics (larger first (LF), bottom left (BL) and translations only (Tr)). The problem is represented as an ordered list of items to be packed, and the items are placed touching already placed items or container. The items are placed on the vertices of the collision free region (CFR). The CRF is determined by a robust implementation of non manifold Boolean operations. Several results comparing the SA with deterministic heuristics are presented.

[1]  Xiang Song,et al.  A Comprehensive and Robust Procedure for Obtaining the Nofit Polygon Using Monkowski Sums , 2005 .

[2]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[3]  Kathryn A. Dowsland,et al.  An algorithm for polygon placement using a bottom-left strategy , 2002, Eur. J. Oper. Res..

[4]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

[5]  Kathryn A. Dowsland,et al.  Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting , 2001, Manag. Sci..

[6]  Thiago de Castro Martins,et al.  Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing , 2009 .

[7]  José Fernando Oliveira,et al.  Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming , 2006, Eur. J. Oper. Res..

[8]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[9]  Thiago de C. Martins,et al.  Comparison of Deterministic Heuristics and Simulated Annealing for the Rotational Placement Problem Over Containers with Fixed Dimensions , 2009 .

[10]  Thiago de Castro Martins,et al.  IRREGULAR ROTATIONAL PLACEMENT OF SHAPES OVER NON–CONVEX CONTAINERS WITH FIXED DIMENSIONS , 2007 .

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Graham Kendall,et al.  Complete and robust no-fit polygon generation for the irregular stock cutting problem , 2007, Eur. J. Oper. Res..

[13]  Thiago de Castro Martins,et al.  Simulated Annealing with Adaptive Neighborhood Applied to the Placement over Containers with Fixed Dimensions , 2008 .

[14]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[15]  Thomas Lengauer,et al.  A simulated annealing approach to the nesting problem in the textile manufacturing industry , 1995, Ann. Oper. Res..

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

[17]  Thiago de Castro Martins,et al.  Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions , 2010, Expert Syst. Appl..

[18]  Jens Egeblad,et al.  Fast neighborhood search for two- and three-dimensional nesting problems , 2007, Eur. J. Oper. Res..