Abstract
Every day optimization problems arise in our life and industry. Many of them require huge amount of calculations and need special type of algorithms to be solved. An important industrial problem is cutting stock problem (CSP). Cutting with less possible waste is significant in some industries. The aim of this work is to cut 2D items from rectangular stock, minimizing the waste. Even the simplified version of the problem, when the items are rectangular is NP hard. When the number of items increases, the computational time increases exponentially. It is impossible to find the optimal solution for a reasonable time. Only for very small problems the exact algorithms and traditional numerical methods can be applied. We propose a stochastic algorithm which solves the problem, when the items are irregular polygons.