Rotational Placement using Simulated Annealing and Collision Free Region

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.