Modified Greedy Heuristic for the one-dimensional cutting stock problem

Gonçalo R. L. Cerqueira (), Sérgio S. Aguiar () and Marlos Marques ()
Additional contact information
Gonçalo R. L. Cerqueira: State University of Southwest Bahia
Sérgio S. Aguiar: State University of Southwest Bahia
Marlos Marques: State University of Southwest Bahia

Journal of Combinatorial Optimization, 2021, vol. 42, issue 3, No 18, 657-674

Abstract: Abstract One can get an integer solution for the one-dimensional cutting stock problem by means of the constructive or residual heuristic. In this work we propose a change in the Constructive Greedy Heuristic that consists in building a cutting pattern by sorting in descending order the items of pair or odd length, priority being given to those which appear more frequently in the problem, cut from objects in stock with pair or odd length respectively, with the aim of minimizing the quantity of cut objects. Computing tests that were carried out showed the efficiency of the proposed heuristic when compared with other methods in the literature that generate an integer solution for the problem and will be presented at the end of this work.

Keywords: Optimization; Linear programming; Heuristic; Cutting pattern; Bin packing; Column generation (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00695-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:3:d:10.1007_s10878-021-00695-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00695-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().