Developing a simulated annealing algorithm for the cutting stock problem

This paper presents an intuitive, simple and efficient simulated annealing searching technique to solve non-guillotine, two- or three-dimensional cutting stock problems. This algorithm considers the possibility of placing different sizes of small rectangles or boxes on a larger rectangle (pallet) or container, in such a way that the amount of trim loss is minimized. The algorithm we propose provides a basis for exploring the integration of the simulated annealing technique with artificial intelligence, and interval algebra. The algorithm is programmed in C and run on a personal computer with an Intel 486-based CPU. The algorithm is tested using randomly generated test cases and also using real data from a printing company in Hong Kong.