Heuristics for the Score-Constrained Strip-Packing Problem
This paper investigates the Score-Constrained Strip-Packing Problem (SCSPP), a combinatorial optimisation problem that generalises the one-dimensional bin-packing problem. In the construction of cardboard boxes, rectangular items are packed onto strips to be scored by knives prior to being folded. The order and orientation of the items on the strips determine whether the knives are able to score the items correctly. Initially, we detail an exact polynomial-time algorithm for finding a feasible alignment of items on a single strip. We then integrate this algorithm with a packing heuristic to address the multi-strip problem and compare with two other greedy heuristics, discussing the circumstances in which each method is superior.
KeywordsStrip-packing Heuristics Graphs and networks
- 1.Becker, K.H.: Twin-constrained Hamiltonian paths on threshold graphs - an approach to the minimum score separation problem. Ph.D. thesis, London School of Economics (2010)Google Scholar
- 2.Dósa, G.: The tight bound of first fit decreasing bin-packing algorithm is \(FFD (I) \le 11/9 OPT (I)+ 6/9\). In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 1–11 (2007)Google Scholar
- 5.Häggkvist, R.: On F-Hamiltonian graphs. University of Umeå, Department of Mathematics (1977)Google Scholar
- 6.Hawa, A.L., Lewis, R., Thompson, J.: Source code for algorithms in the article “Heuristics for the Score-Constrained Strip-Packing Problem” (2018). https://doi.org/10.5281/zenodo.1311857
- 7.Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)Google Scholar