Advertisement

A Local Search Approach for the Pattern Restricted One Dimensional Cutting Stock Problem

  • Shunji Umetani
  • Mutsunori Yagiura
  • Toshihide Ibaraki
Part of the Applied Optimization book series (APOP, volume 86)

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

Keywords

Cutting stock problem Local search Setup cost of cutting patterns Pattern generation. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A.A. Farley and K.V. Richardson. Fixed charge problems with identical fixed charges. European Journal of Operational Research, 18: 245–249, 1984.zbMATHCrossRefGoogle Scholar
  2. H. Foerster and G. Wäscher. Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 38: 1657–1676, 2000.zbMATHCrossRefGoogle Scholar
  3. M.R. Carey and D.S. Johnson. Computers and Intractability–A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.Google Scholar
  4. T. Gau and G. Wäscher. Cutgenl: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84: 572–579, 1995.zbMATHCrossRefGoogle Scholar
  5. P.C. Gilmore and R.E. Gomory. A linear programming approach to the cutting-stock problem. Operations Research, 9 (6): 849–859, 1961.MathSciNetzbMATHCrossRefGoogle Scholar
  6. P.C. Gilmore and R.E. Gomory. A linear programming approach to the cutting-stock problem — Part II. Operations Research, 11 (6): 863–888, 1963.zbMATHCrossRefGoogle Scholar
  7. C. Goulimis. Optimal solutions for the cutting stock problem. European Journal of Operational Research, 44: 197–208, 1990.zbMATHCrossRefGoogle Scholar
  8. R.E. Haessler. A heuristic programming solution to a nonlinear cutting stock problem. Management Science, 17 (12): 793–802, 1971.CrossRefGoogle Scholar
  9. R.E. Haessler. Controlling cutting pattern changes in one-dimensional trim problems. Operations Research, 23 (3): 483–493, 1975.zbMATHCrossRefGoogle Scholar
  10. R.E. Johnston. Rounding algorithm for cutting stock problems. In Journal of Asian-Pacific Operations Research Societies, volume 3, pages 166–171, 1986.Google Scholar
  11. O. Marcotte. The cutting stock problem and integer rounding. Mathematical Programming, 33: 82–92, 1985.MathSciNetzbMATHCrossRefGoogle Scholar
  12. G. Scheithauer and J. Teruo. Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Mathematical Methods of Operations Research, 48: 105–115, 1997.Google Scholar
  13. H. Stadtler. A one-dimensional cutting stock problem in the aluminium industry and its solution. European Journal of Operational Research, 44: 209–223, 1990.zbMATHCrossRefGoogle Scholar
  14. S. Umetani, M. Yagiura, and T. Ibaraki. One dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research, 146 (2): 388–402, 2003.MathSciNetzbMATHCrossRefGoogle Scholar
  15. P.H. Vance. Branch-and-price algorithm for the one-dimensional cutting stock problem. Computational Optimization and Applications, 9: 211–228, 1998.MathSciNetzbMATHCrossRefGoogle Scholar
  16. F. Vanderbeck. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming, 86: 565–594, 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  17. F. Vanderbeck. Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Operations Research, 48 (6): 915–926, 2000.MathSciNetzbMATHCrossRefGoogle Scholar
  18. W.E. Walker. A heuristic adjacent extreme point algorithm for the fixed charge problem. Managemant Science, 22 (5): 587–696, 1976.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Shunji Umetani
    • 1
  • Mutsunori Yagiura
    • 1
  • Toshihide Ibaraki
    • 1
  1. 1.Department of Applied Mathematics and Physics Graduate School of InformaticsKyoto UniversityKyotoJapan

Personalised recommendations