A hybrid algorithm for the orthogonal stock-cutting problem

Based on a simulated annealing algorithm and a bricklaying heuristic algorithm, a hybrid algorithm for the orthogonal stock-cutting problem is presented. The computational results on several classes of benchmark problems have shown that the presented algorithm can outperform the well-known algorithm BF+SA in terms of both solution quality and execution time.