| Grant number: | 12/21176-7 |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| Start date: | March 01, 2013 |
| End date: | February 29, 2016 |
| Field of knowledge: | Engineering - Production Engineering - Operational Research |
| Principal Investigator: | Franklina Maria Bragion de Toledo |
| Grantee: | Aline Aparecida de Souza Leão |
| Host 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: | 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings, AP.TEM |
Abstract Nesting problems consist of cutting a big object with a fixed width and an infinite length in a set of small pieces with irregular shapes. The objective is to minimise the used length of the big object. This problem arises in a wide variety of industrial applications. However, it has not been extensively studied as the other cutting problems. Due to the difficulty in solving nesting problems, most of the methods proposed in the literature are heuristics. In addition, there exists only one mathematical formulation (integer linear programming) capable of evaluating the optimality gap and proving the optimality for some well known instances. The other mathematical formulations in the literature consist of formulations of subproblems used in heuristics.The purpose of this project is to develop new mathematical formulations for the nesting problem. The development of new mathematical formulations contributes strongly to the existingliterature. Also, it can provide tighter bounds, which is important to evaluate optimality gaps and to make easier the analysis of solution methods. | |
| News published in Agência FAPESP Newsletter about the scholarship: | |
| More itemsLess items | |
| TITULO | |
| Articles published in other media outlets ( ): | |
| More itemsLess items | |
| VEICULO: TITULO (DATA) | |
| VEICULO: TITULO (DATA) | |