A local search approach for the pattern restricted one dimensional cutting stock problem

Authors:
Shunji Umetani;Mutsunori Yagiura;Toshihide Ibaraki
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, Japan
Venue:
Metaheuristics
Year:
2004

Citing 4
Cited 1

Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem

Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

Operations Research
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Operations Research Letters

In situ column generation for a cutting-stock problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the setup cost of cutting patterns becomes more important in modern cutting industry, we consider the pattern restricted one dimensional cutting stock problem (1D-PRP), in which the number of stock rolls is minimized while the number of different cutting patterns is constrained within a bound given by a program parameter. For this problem, we propose a new heuristic algorithm based on local search, and incorporate a heuristic algorithm that provides a small subset of neighborhood which tends to contain good solutions in the original neighborhood. According to our computational experiments, the proposed algorithm attains a wide variety of good solutions which are comparable to the existing heuristic approaches for the one dimensional cutting stock problem (without pattern restriction).