Residual Recombination Heuristic in Solving The One-Dimensional Cutting Stock Problem Model Stephany Puspa Haryanti, Fitri Maya Puspita, Sisca Octarina
Faculty of Mathematics and Natural Sciences, Sriwijaya University
Abstract
In the world of optimization, the problem of cutting raw materials is known as the Cutting Stock Problem (CSP), and the remaining cuts are called trim loss. A one-dimensional Cutting Stock Problem (CSP) is an optimization problem in the case of combining raw material cutting patterns where the resulting trims loss only pays attention to one side of the cutting, namely the width or length side. This research uses the Pattern Generation (PG) algorithm to determine the cutting pattern with different trim losses for each cutting. The cut patterns are then implemented with the RRH method to achieve the most efficient cutting pattern, by reducing the trim loss as much as possible. Furthermore, it is formulated to the Cutting Stock Problem (CSP) model to solve the problem of iron cutting patterns by obtaining optimal cut results.
Keywords: Cutting Stock Problem (CSP), Pattern Generation (PG), Residual Recombination Heuristic (RRH), trim loss
