| Grant number: | 15/16298-4 |
| Support type: | Scholarships in Brazil - Master |
| Effective date (Start): | December 01, 2015 |
| Effective date (End): | April 30, 2017 |
| Field of knowledge: | Engineering - Production Engineering |
| Principal Investigator: | Marina Andretta |
| Grantee: | Raquel Akemi Okuno Kitazume da Silva |
| Home Institution: | Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil |
| Associated research grant: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry, AP.CEPID |
Abstract Irregular (non-rectangular and non-circular) cutting problems (or nesting problems) are problems that aim to determine an optimal placement of irregular pieces (items) inside a bigger rectangular or irregular piece (that we will simply call piece), respecting a given item demand. Among these problems, we have the irregular bin packing problems, in which the pieces have a fixed size and we wish to find an optimal placement of the items, satisfying a given demand, using the smallest number of pieces.A particular case of this problem appears when we want to load ships with irregular objects, minimizing the number of ships used to move all the objects. This can be seen as a bidimensional problem in which we wish to find the best placement of all irregular items (objects) into irregular bins (ships) using the smallest amount of bins (ships). However, this problem has an additional constraint: the objects have weights and the ships must keep their balance, which means that besides avoiding overlap between the objects, same placements are not possible, since they might disturb the ships balance.The goal of this project is to study and implement solutions methods for the irregular bin packing problem considering the load balance constraints. These methods will be heuristic and, possibly, exact. | |