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

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 genera...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2003-04, Vol.146 (2), p.388-402
Main Authors: Umetani, Shunji, Yagiura, Mutsunori, Ibaraki, Toshihide
Format: Article
Language:English
Subjects:
Algorithms
Cutting stock problem
Heuristic
Local search
Metaheuristics
Optimization
Pattern generation
Pattern minimization
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(02)00239-4