Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes

Abstract

In this paper, we are concerned with a natural extension of the standard cutting stock problem, in which there are multiple stock sizes available instead of a single one. Based on decomposing problem of this type into the standard cutting stock ones, a new model called OneDCSP_M is proposed and its solution algorithm is developed. The quality of the algorithm is evaluated by comparing its results with the ones obtained by Belov and Scheithauer.