| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 827533 | Journal of King Saud University - Science | 2011 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Chemistry
Chemistry (General)
Authors
Murat Erşen Berberler, Urfat Nuriyev, Ahmet Yıldırım,