Abstract
This paper introduces a new improvement heuristic for irregular cutting and packing problems. The method is based on a small number of repetitions of any leftmost placement policy and is particularly effective in situations where computation time is strictly limited but exceeds that required for a single pass approach. Both the algorithm and the geometry required for implementation are described in full and the results of computational experiments on a variety of data are presented. These results show that the algorithm is an effective technique for producing good packings.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dowsland, K., Dowsland, W. & Bennell, J. Jostling for position: local improvement for irregular cutting patterns. J Oper Res Soc 49, 647–658 (1998). https://doi.org/10.1057/palgrave.jors.2600563
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2600563