EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Adaptive Sequence-Based Heuristic for Two-Dimensional Guillotine Cutting and Packing Problems

Óscar Oliveira, Dorabela Gamboa

Computers · 01.04.2026 · 15 (4) · 216

DOI: 10.3390/computers15040216 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers, online erschienen am 01.04.2026. Verfasst von Óscar Oliveira und 1 weiteren Autor:innen. Die Arbeit nennt 54 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper proposes adaptive sequence-based heuristics for solving rectangular two-dimensional guillotine Cutting and Packing Problems (CPPs). These problems are essential in various industrial sectors, aiming to maximise resource utilisation by selecting profitable item subsets or minimise waste by using the fewest possible identical large objects. The core methodology is grounded in the principle that if a specific item sequence generates a high-quality solution, incremental adjustments to that sequence can yield even better outcomes. By iteratively refining item ordering through the BubbleSearch method, the heuristics balance search intensification with the diversification of the solution space. Extensive computational experiments were conducted on benchmark datasets, including SET1, ATP, and CLASS, across multiple problem variants such as the Single Stock-Size Cutting Stock Problem (SSSCSP) and the Single Large Object Placement Problem (SLOPP). The results confirm that these heuristics and their extension with path relinking consistently deliver optimal or near-optimal solutions. These heuristics achieve high performance in computational times that are significantly shorter than existing state-of-the-art methods, demonstrating their robustness, flexibility, and suitability for software transferability and real-world industrial adoption.

Zitieren

APA

Oliveira, Ó., & Gamboa, D. (2026). Adaptive Sequence-Based Heuristic for Two-Dimensional Guillotine Cutting and Packing Problems. Computers, 15(4), 216. https://doi.org/10.3390/computers15040216

Vancouver

Oliveira Ó, Gamboa D. Adaptive Sequence-Based Heuristic for Two-Dimensional Guillotine Cutting and Packing Problems. Computers. 2026;15(4):216. doi:10.3390/computers15040216

BibTeX
@article{Oliveira2026,
  author = {Oliveira, Óscar and Gamboa, Dorabela},
  title = {Adaptive Sequence-Based Heuristic for Two-Dimensional Guillotine Cutting and Packing Problems},
  journal = {Computers},
  year = {2026},
  volume = {15},
  number = {4},
  pages = {216},
  doi = {10.3390/computers15040216}
}
Kostenlos starten →