Technical Report: DCC-2013-10

Fast Pattern-based Algorithms for Cutting Stock

Filipe Brandão, João Pedro Pedroso

DCC-FC & INESC Porto, Universidade do Porto
e-mail: {fdabrandao,jpp}
September 2013


The conventional assignment-based first/best fit decreasing algorithms (FFD/BFD) are not polynomial in the cutting stock input size in its most common format. Therefore, even for small instances with large demands, it is difficult to compute FFD/BFD solutions. We present pattern-based methods that overcome the main problems of conventional heuristics in cutting stock problems by representing the solution in a much more compact format. Using our pattern-based heuristics, FFD/BFD solutions for extremely large cutting stock instances, with billions of items, can be found in a very short amount of time.

Keywords: Cutting Stock, First Fit Decreasing, Best Fit Decreasing, FFD, BFD