A software for the one-dimensional cutting stock problem
Makaleler > Tam Makale · 2010
Yazarlar: MURAT ERŞEN BERBERLER, Urfat NURİYEV, Ahmet YILDIRIM
Journal of King Saud University - Science, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Scopus, 2010, cilt 23, ss 69-76
DOI: 10.1016/j.jksus.2010.06.009
Özet
In this paper, one-dimensional cutting stock problem is taken into consideration and a new heuristic algorithm is proposed to solve the problem. In this proposed algorithm, a new dynamic programming algorithm is applied for packing each of the bins. The algorithm is coded with Delphi and then by computational experiments with the real-life constraint optimization problems, and the obtained results are compared with the other one-dimensional cutting stock commercial packages. The computational experiments show the efficiency of the algorithm.