An adaptive tabu search approach to cutting and packing problems
MetadataShow full item record
This research implements an adaptive tabu search procedure that controls the partitioning, ordering and orientation features of a two–dimensional orthogonal packing solution, details an effective fine-grained objective function for cutting and packing problems, and presents effective move neighborhoods to find very good answers in a short period of time. Results meet or exceed all other techniques presented in literature for a common test set for all 500 instances. These techniques have natural extension into both two dimensional arbitrarily shaped and three dimensional orthogonal packing heuristics that use rules based on given partitions, orders and orientations. Techniques to extend this research into those new horizons and methods that might improve the search are also presented.