Heuristics for the Score-Constrained Strip-Packing Problem

  • Asyl L. HawaEmail author
  • Rhyd Lewis
  • Jonathan M. Thompson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11346)


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.


Strip-packing Heuristics Graphs and networks 


  1. 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. 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
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90–91. WH Freeman Co., San Francisco (1979)zbMATHGoogle Scholar
  4. 4.
    Goulimis, C.: Minimum score separation - an open combinatorial problem associated with the cutting stock problem. J. Oper. Res. Soc. 55(12), 1367–1368 (2004)CrossRefGoogle Scholar
  5. 5.
    Häggkvist, R.: On F-Hamiltonian graphs. University of Umeå, Department of Mathematics (1977)Google Scholar
  6. 6.
    Hawa, A.L., Lewis, R., Thompson, J.: Source code for algorithms in the article “Heuristics for the Score-Constrained Strip-Packing Problem” (2018).
  7. 7.
    Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)Google Scholar
  8. 8.
    Lewis, R.: A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput. Oper. Res. 36(7), 2295–2310 (2009)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lewis, R., Song, X., Dowsland, K., Thompson, J.: An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. 213(1), 52–65 (2011)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Mahadev, N.V., Peled, U.N.: Longest cycles in threshold graphs. Discrete Math. 135(1–3), 169–176 (1994)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20(2), 302–316 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28(1), 59–70 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Asyl L. Hawa
    • 1
    Email author
  • Rhyd Lewis
    • 1
  • Jonathan M. Thompson
    • 1
  1. 1.School of MathematicsCardiff UniversityCardiffUK

Personalised recommendations