|
|
|
|
A software for the one-dimensional cutting stock problem
|
|
|
|
|
|
|
|
نویسنده
|
Berberler Murat Erşen ,Nuriyev Urfat ,Yıldırım Ahmet
|
|
منبع
|
journal of king saud university - science - 2011 - دوره : 23 - شماره : 1 - صفحه:69 -76
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Cutting stock problem; Bin packing problem; Dynamic programming; Heuristic algorithm; Packet program
|
|
آدرس
|
Ege University, Science Faculty, Department of Mathematics, Turkey, Ege University, Science Faculty, Department of Mathematics, Turkey, Ege University, Science Faculty, Department of Mathematics, Turkey
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|