Hybrid heuristic algorithm for two‐dimensional steel coil cutting problem

This paper is concerned with the problem of two‐dimensional cutting of small rectangular items, each of which has its own deadline and size, from a large rectangular plate, whose length are more than one thousand times its width, so as to minimize the trim loss and the reduction of the times of clamping and changing speed are also concerned. This problem is different with the classical two‐dimensional cutting problem. In view of the distinguishing features of the problem proposed, we put forward the definition of non‐classical cutting, that is to say, put a series of items on the rectangular plates in their best layout, so as to enhance utility and efficiency at the same time. These objectives may be conflicting and a balance should be necessary, so we present a Hybrid Heuristic Algorithm (HHA), consisting of clustering, ordering, striping and integer programming etc. We demonstrate the efficiency of the proposed algorithm through the comparison with the algorithm we studied before.