A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem

Frederico Dusberger () and Günther R. Raidl ()
Additional contact information
Frederico Dusberger: Tu Wien
Günther R. Raidl: Tu Wien

A chapter in Operations Research Proceedings 2015, 2017, pp 385-391 from Springer

Abstract: Abstract This work focuses on the K-staged two-dimensional cutting stock problem with variable sheet size. High-quality solutions are computed by an efficient beam-search algorithm that exploits the congruency of subpatterns and takes informed decisions on which of the available sheet types to use for the solutions. We extend this algorithm by embedding it in a sequential value-correction framework that runs the algorithm multiple times while adapting element type values in each iteration and thus constitutes a guided diversification process for computing a solution. Experiments demonstrate the effectiveness of the approach and that the sequential value-correction further increases the overall quality of the constructed solutions.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-319-42902-1_52

Ordering information: This item can be ordered from
http://www.springer.com/9783319429021

DOI: 10.1007/978-3-319-42902-1_52

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().