A new heuristic algorithm for the one-dimensional cutting stock problem
Küçük Resim Yok
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Bin packing problem, Cutting stock problem, Dynamic programming, Heuristic algorithm, Subset-sum problem
Kaynak
Applied and Computational Mathematics
WoS Q Değeri
Scopus Q Değeri
Q1
Cilt
9
Sayı
1
