Authorization

 

Journal

Volume 9, №1


A new heuristic algorithm for the one-dimensional cutting stock problem (pages 19-30)
M.E. Berberler, U.G. Nuriyev


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. This way 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 constrained optimization problems, the results are compared with the others in the literature. The computational experiments show the efficiency of the algorithm.


Keywords: Cutting Stock Problem, Bin Packing Problem, Subset-Sum Problem, Dynamic Programming, Heuristic Algorithm.


AMS Subject Classification: 90C10, 90C39, 90C27, 68W25.

 



COIA 2027

7-9 July 2027
Baku, Azerbaijan

Search