A local search approach for two-dimensional irregular cutting

A two-dimensional irregular cutting problem is considered. In an earlier paper, two new approximation algorithms based on tabu search and simulated annealing, have been proposed and implemented. The advantage, in terms of the solution’s quality, of the tabu method over Albano-Sapuppo’s Gurel’s and simulated annealing ones has been shown in earlier work. This paper provides a study of the various versions of the tabu search approach used for the problem. The results obtained for different methods are presented and compared.