Abstract
One-dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which arises in many industrial applications. Since the setup costs for switching different cutting patterns become more dominant in recent cutting industry, we consider a variant of 1D-CSP, called the pattern restricted problem (PRP), to minimize the number of stock rolls while constraining the number of different cutting patterns within a bound given by users. For this problem, we propose a local search algorithm that alternately uses two types of local search processes with the 1-add neighborhood and the shift neighborhood, respectively. To improve the performance of local search, we incorporate it with linear programming (LP) techniques, to reduce the number of solutions in each neighborhood. A sensitivity analysis technique is introduced to solve a large number of associated LP problems quickly. Through computational experiments, we observe that the new algorithm obtains solutions of better quality than those obtained by other existing approaches.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Belov G. and Scheithauer G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, European Journal of Operational Research 171 (2006), 85–106.
Belov G. and Scheithauer G.: The number of setups (different patterns) in one-dimensional stock cutting, Technical Report MATH-NM-15-2003, Dresden University, 2003.
Burkard R. E. and Zelle C.: A local search heuristic for the real cutting problem in paper production, Technical Report SFB-257, Institute of Mathematics B, Technical University Graz, 2003.
Degraeve Z. and Schrage L.: Optimal integer solutions to industrial cutting stock problems, INFORMS Journal on Computing 11 (1999), 406–419.
Degraeve Z. and Peeters M.: Optimal integer solutions to industrial cutting-stock problems: Part2, benchmark results, INFORMS Journal on Computing 15 (2003), 58–81.
Dongarra J. J.: Performance of various computers using standard linear equations software, Technical Report No. CS-89-85, Computer Since Department, University of Tennessee, 2005 (available as http://www.netlib.org/benchmark/performance.ps).
Foerster H. and Wäscher G.: Pattern reduction in one-dimensional cutting stock problems, International Journal of Production Research 38 (2000), 1657–1676.
Garey M. R. and Johnson D. S.: Computers and Intractability – A Guide to the Theory of NP-Completeness -, W.H. Freeman and Company, 1979.
Gau T. and Wäscher G., CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, European Journal of Operational Research 84 (1995), 572–579.
Gilmore P. C. and Gomory R. E.: A linear programming approach to the cutting-stock problem, Operations Research 9 (1961), 849–859.
Gilmore P. C. and Gomory R.E.: A linear programming approach to the cutting-stock problem – part II, Operations Research 11 (1963), 863–888.
Haessler R. E.: A heuristic programming solution to a nonlinear cutting stock problem, Management Science 17 (1971), 793–802.
Haessler R. E.: Controlling cutting pattern changes in one-dimensional trim problems, Operations Research 23 (1975), 483–493.
Lourenço H. R., Martin O. C. and Stützle T.: Iterated local search F. Glover and G. A. Kochenberger eds. Handbook of Metaheuristics, Kluwer Academic Publishers (2003), 321–353
Umetani S., Yagiura M. and Ibaraki T.: An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E86-A (2003), 1093–1102.
Vance P. H.: Branch-and-price algorithms for the one-dimensional cutting stock problem, Computational Optimization and Applications 9 (1998), 211–228.
Vanderbeck F.: Computational study of a column generation algorithm for bin packing and cutting stock problems, Mathematical Programming A86 (1999), 565–594.
Vanderbeck F.: Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem, Operations Research 48 (2000), 915–926.
Zionts S.: The criss-cross method for solving linear programming problems, Management Science 15 (1969), 426–445.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Umetani, S., Yagiura, M. & Ibaraki, T. One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. J Math Model Algor 5, 43–64 (2006). https://doi.org/10.1007/s10852-005-9031-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-005-9031-0