Pattern Generation for Three Dimensional Cutting Stock Problem
| Autor: | Mutia Atika, Bib Paruhum Silalahi, Fahren Bukhari |
|---|---|
| Jazyk: | English<br />Indonesian |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 6, Iss 4, Pp 991-1003 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2597-7512 2614-1175 44055811 |
| DOI: | 10.31764/jtam.v6i4.9933 |
| Popis: | We consider the problem of three-dimensional cutting of a large block that is to be cut into some small block pieces, each with a specific size and request. Pattern generation is an algorithm that has been used to determine cutting patterns in one-dimensional and two-dimensional problems. The purpose of this study is to modify the pattern generation algorithm so that it can be used in three-dimensional problems, and can determine the cutting pattern with the minimum possible cutting residue. The large block will be cut based on the length, width, and height. The rest of the cuts will be cut back if possible to minimize the rest. For three-dimensional problems, we consider the variant in which orthogonal rotation is allowed. By allowing the remainder of the initial cut to be rotated, the dimensions will have six permutations. The result of the calculation using the pattern generation algorithm for three-dimensional problems is that all possible cutting patterns are obtained but there are repetitive patterns because they suggest the same number of cuts. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|