Optimal nesting of irregular convex blanks in strips via an exact algorithm

In manufacturing operations where identical blanks are cut from long strips of raw material, the orientation of the blank strongly affects material utilization. This paper describes a new algorithm for optimising the layout of an irregular convex polygonal blank in a strip. This algorithm orients a single blank such that the utilization of the strip material is maximized. It is efficient, running in O( n 2) time, and exact, producing orientation solutions which globally maximize material utilization. The utility of such an algorithm is that it may be incorporated into a computer-aided engineering (CAE) system for automated design and optimisation of parts made from sheet materials. An example demonstrates significant material savings can be obtained through proper blank orientation on the strip.