A NEW HEURISTIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM


Berberler M. E. , NURİYEV U.

APPLIED AND COMPUTATIONAL MATHEMATICS, vol.9, no.1, pp.19-30, 2010 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 9 Issue: 1
  • Publication Date: 2010
  • Title of Journal : APPLIED AND COMPUTATIONAL MATHEMATICS
  • Page Numbers: pp.19-30

Abstract

This paper describes an attempt to solve the one-dimensional cutting stock problem heuristically by using dynamic programming used to solve subset-sum problem which is considered as a sub-problem. Thisway an optimal solution is found for the sub-problem, which yields solution for the original problem. Thus an economical gain is achieved by decreasing the rate of trim loss. Moreover the cutting-cost can be reduced by minimizing the number of different cutting-patterns by this algorithm. Toward this goal, a new mathematical model is proposed and a novel algorithm is developed. The proposed algorithm is coded with Delphi and then through computational experiments on real-life constrainted optimization problems, the results are compared with the others in the literature. The computational experiments show the efficiency of the algorithm.