Advanced search
Start date
Betweenand


Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Full text
Author(s):
Sato, Andre Kubagawa ; Martins, Thiago de Castro ; Guerra Tsuzuki, Marcos de Sales ; IEEE
Total Authors: 4
Document type: Journal article
Source: 6TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND INTELLIGENT SYSTEMS, AND THE 13TH INTERNATIONAL SYMPOSIUM ON ADVANCED INTELLIGENT SYSTEMS; v. N/A, p. 6-pg., 2012-01-01.
Abstract

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm. (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: 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