Study of models for a problem of irregular cutting problem applied to the steel in...
Methods for the irregular packing and cutting path integrated models
A solution method for the irregular strip-packing problem integrated to the cuttin...
| Full text | |
| Author(s): |
Sato, Andre Kubagawa
[1]
;
Martins, Thiago Castro
[1]
;
Gomes, Antonio Miguel
[2]
;
Guerra Tsuzuki, Marcos Sales
[1]
Total Authors: 4
|
| Affiliation: | [1] Univ Sao Paulo, Escola Politecn, Dept Mech & Mech Syst Engn, Computat Geometry Lab, Ave Prof Mello Moraes, BR-2231 Sao Paulo - Brazil
[2] Univ Porto, INESC TEC, Porto - Portugal
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | European Journal of Operational Research; v. 279, n. 2, p. 657-671, DEC 1 2019. |
| Web of Science Citations: | 1 |
| Abstract | |
Among the most complex problems in the field of 2-dimensional cutting \& packing are irregular packing problems, in which items may have a more complex geometry. These problems are prominent in several areas, including, but not limited to, the textile, shipbuilding and leather industries. They consist in placing a set of items, whose geometry is often represented by simple polygons, into one or more containers such that there is no overlap between items and the utility rate of the container is maximized. In this work, the irregular strip packing problem, an irregular packing variant with a variable length container, is investigated. The placement space is reduced by adopting a rectangular grid and a full search is performed using preprocessed raster penetration maps to efficiently determine the new position of an item. Tests were performed using simple dotted board model cases and irregular strip packing benchmark instances. The comparison of our results with the state of the art solutions showed that the proposed algorithm is very competitive, achieving better or equal compaction in 9 out of 15 instances and improving the average density in 13 instances. Besides the contribution of the new best results, the proposed approach showed the advantage of adopting discrete placement, which can be potentially applied to other irregular packing problems. (C) 2019 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 10/18658-4 - Simulated Annealing Applied to Electrical Impedance Tomography Image Reconstruction |
| Grantee: | Renato Seiji Tavares |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| FAPESP's process: | 10/18913-4 - Study about no-fit polygons translations to create degenerated collision free regions through non regularized Boolean operations |
| Grantee: | Marcos de Sales Guerra Tsuzuki |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 13/26532-9 - Massive parallel algorithm development with GPGPU to create discrete obstructive region mountain |
| Grantee: | Marcos de Sales Guerra Tsuzuki |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 08/11132-7 - Development of non-regularized Boolean operation algorithms on polygonal regions for application in the determination of no-fit polygons |
| Grantee: | Marcos de Sales Guerra Tsuzuki |
| Support Opportunities: | Regular Research Grants |