A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapes

Abstract

The two‐dimensional layout (TDL) optimization problem consists of finding the minimal length layout of a set of both regular and irregular two‐dimensional shapes on a stock sheet of finite width but infinite length. The layout should not contain any overlap. In this paper, we solve the TDL problem by proposing two approximate algorithms. The first one is a new heuristic based on a constructive approach specifically designed for irregular shapes, but that works well with regular ones. The second is a hybrid method in which the constructive approach displays the layouts corresponding to the chromosomes yielded by the genetic algorithm. The resulting algorithm yields satisfactory results in relatively short computational times as shown by the extensive computational testing on problems from the literature.