Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A pairwise exact placement algorithm for the irregular nesting problem

Full text
Author(s):
Sato, Andre Kubagawa ; Martins, Thiago de Castro ; Guerra Tsuzuki, Marcos de Sales
Total Authors: 3
Document type: Journal article
Source: INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING; v. 29, n. 11, p. 1177-1189, 2016.
Web of Science Citations: 6
Abstract

The irregular nesting problem, a subset of cutting and packing problems, aims to minimise waste or unoccupied space inside a container and is found in wood, glass, shipbuilding and textile industries. The problem consists in finding the most compact arrangement of two-dimensional items inside a rectangular container without overlap. The length of the container is variable and up to four different orientations are allowed for each item. Overlap is avoided by using a constructive placement heuristic which places items one at a time, without colliding with other items. The proposed algorithm in this work uses a pairwise placement strategy in which one item is always positioned in exact fitting or sliding placements, which are positions where the item movement is restricted. A simulated annealing algorithm controls the placement sequence and guides the search over the solution space. Several placement heuristics were proposed and tests were conducted with benchmark instances. Results show improvement in efficiency and speed over previous works in some cases. (AU)

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: 10/19646-0 - Translating No-Fit Polygons to Create Degenerated Collision Free Region Using Non-Regulerized Boolean Operations
Grantee:André Kubagawa Sato
Support Opportunities: Scholarships in Brazil - Doctorate