文章基本信息

标题：A software for the one-dimensional cutting stock problem
本地全文：下载
作者：Murat Erşen Berberler ; Murat Erşen Berberler ; Urfat Nuriyev 等
期刊名称：Journal of King Saud University - Science
印刷版ISSN：1018-3647
出版年度：2011
卷号：23
期号：1
页码：69-76
DOI：10.1016/j.jksus.2010.06.009
语种：English
出版社：Elsevier
摘要：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.
关键词：Cutting stock problem; Bin packing problem; Dynamic programming; Heuristic algorithm; Packet program;