Summary: As the cost associated with the change of cutting patterns become more important in recent industry, we consider 1D-CSP in which the number of different cutting patterns is constrained within a given bound. The proposed approach is based on metaheuristics, and incorporates an adaptive pattern generation technique. According to our computational experiments, it is observed that the proposed algorithm provides comparable solutions to other existing heuristic approaches for 1D-CSP.