One-dimensional cutting stock problem to minimize the number of different patterns

One-dimensional cutting stock problem to minimize the number of different patterns

0.00 Avg rating0 Votes
Article ID: iaor20042665
Country: Netherlands
Volume: 146
Issue: 2
Start Page Number: 388
End Page Number: 402
Publication Date: Apr 2003
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.