| Full text | |
| Author(s): |
Nunes, Wesley H. B.
;
Moreira, Mayron C. O.
;
Andretta, Marina
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021); v. N/A, p. 8-pg., 2021-01-01. |
| Abstract | |
The Nesting problem, or the irregular cutting and packing problem, aims to find the best position of irregular pieces within a board, minimizing the space used by them. The problem's relevance is that it is widely used in the furniture, textile, and footwear industries. We consider a two-dimensional scope with convex and non-convex parts, with continuous rotation. We implement a genetic algorithm that uses five positioning rules, five sorting rules, and two rotation rules to create individuals and populations. Two positioning rules outperformed the others, obtaining promising results compared with the literature. (AU) | |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |