A new heuristic algorithm for the one-dimensional cutting stock problem

Basit Öğe Kaydı
dc.contributor.authorBerberler M.E.
dc.contributor.authorNuriyev U.G.
dc.date.accessioned2019-10-26T22:31:33Z
dc.date.available2019-10-26T22:31:33Z
dc.date.issued2010
dc.departmentEge Üniversitesien_US
dc.description.abstractThis 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.en_US
dc.identifier.endpage30en_US
dc.identifier.issn1683-3511
dc.identifier.issn1683-3511en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage19en_US
dc.identifier.urihttps://hdl.handle.net/11454/19728
dc.identifier.volume9en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofApplied and Computational Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBin packing problemen_US
dc.subjectCutting stock problemen_US
dc.subjectDynamic programmingen_US
dc.subjectHeuristic algorithmen_US
dc.subjectSubset-sum problemen_US
dc.titleA new heuristic algorithm for the one-dimensional cutting stock problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu