ИСТИНА

The cutting stock problem is relevant in many industries. It is NP-hard, and in practice finding its exact solution requires a lot of both time and computing resources. Therefore, when solving the cutting problem in general, approximate algorithms are often used, while exact algorithms are used only for special cases. This paper presents the results of an analytical review and a comparative analysis of various approaches to solving the cutting stock problem based on classic heuristic and brute force algorithms. Two algorithms for its solution have been developed and implemented: a greedy algorithm and a simulated annealing algorithm. An experimental study of the properties of the developed algorithms was carried out, as well as a comparison of the results of their work.