EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers

Glaucia Maria Bressan iD, Matheus Henrique Pimenta-Zanon iD, Fabio Sakuray iD

Materials · 11.11.2023 · 16 (22) · 7133

DOI: 10.3390/ma16227133 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Materials, online erschienen am 11.11.2023. Verfasst von Glaucia Maria Bressan und 2 weiteren Autor:innen. Beteiligte Einrichtung: Mathematics Department, Universidade Tecnológica Federal do Paraná (UTFPR), Alberto Carazzai, 1640, Cornélio Procópio 86300-000, PR, Brazil. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Cutting problems consist of cutting a set of objects available in stock in order to produce the desired items in specified quantities and sizes. The cutting process can generate leftovers (which can be reused in the case of new demand) or losses (which are discarded). This paper presents a tree-based heuristic method for minimizing the number of cut bars in the one-dimensional cutting process, satisfying the item demand in an unlimited bar quantity of just one type. The results of simulations are compared with the RGRL1 algorithm and with the limiting values for this considered type of problem. The results show that the proposed heuristic reduces processing time and the number of bars needed in the cutting process, while it provides a larger leftover (by grouping losses) for the one-dimensional cutting stock problem. The heuristic contributes to reduction in raw materials or manufacturing costs in industrial processes.

Schlagwörter

Stichwörter der Autor:innen

cutting problemsheuristic proceduresoptimizationusable leftovers

Autor:innen und Institutionen

  • Mathematics Department, Universidade Tecnológica Federal do Paraná (UTFPR), Alberto Carazzai, 1640, Cornélio Procópio 86300-000, PR, Brazil.
  • Computer Science Department, Universidade Tecnológica Federal do Paraná (UTFPR), Alberto Carazzai, 1640, Cornélio Procópio 86300-000, PR, Brazil.
  • Computer Science Department, State University of Londrina (UEL), Rodovia Celso Garcia Cid, Pr 445 Km 380 C.P. 10.011, Londrina 86057-970, PR, Brazil.

ORCID-Profile: Glaucia Maria Bressan, Matheus Henrique Pimenta-Zanon, Fabio Sakuray

Zitieren

APA

Bressan, G. M., Pimenta-Zanon, M. H., & Sakuray, F. (2023). A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers. Materials, 16(22), 7133. https://doi.org/10.3390/ma16227133

Vancouver

Bressan GM, Pimenta-Zanon MH, Sakuray F. A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers. Materials. 2023;16(22):7133. doi:10.3390/ma16227133

BibTeX
@article{Bressan2023,
  author = {Bressan, Glaucia Maria and Pimenta-Zanon, Matheus Henrique and Sakuray, Fabio},
  title = {A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers},
  journal = {Materials},
  year = {2023},
  volume = {16},
  number = {22},
  pages = {7133},
  doi = {10.3390/ma16227133}
}
Kostenlos starten →