Nesting problem

• Grant number: 12/18653-8
• Support Opportunities: Scholarships in Brazil - Doctorate
• Start date: March 01, 2013
• End date: May 31, 2016
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Franklina Maria Bragion de Toledo
• Grantee: Luiz Henrique Cherri
• 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
• Associated scholarship(s): 14/10740-4 - Nesting Problem, BE.EP.DR

Abstract

Cutting stock problems have been studied for decades by researchers in operations research. An important problem in this area is the nesting problem. Nesting problems have applications in various different industries. The study consists of cut irregular pieces from a rectangular board with a fixed width and an unlimited length, aiming to reduce the total length of the plate used. Since it is a difficult combinatorial optimization problem, the solution methods presented in the literature are predominantly based on heuristics and few of them are construct using some mathematical formulation. The objective of this work is to develop exact and heuristic methods to solve the nesting problems. The solution methods that we will present are based on a mathematical model recently proposed in the literature.

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

CHERRI, LUIZ H.; MUNDIM, LEANDRO R.; ANDRETTA, MARINA; TOLEDO, FRANKLINA M. B.; OLIVEIRA, JOSE F.; CARRAVILLA, MARIA ANTONIA. Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, v. 253, n. 3, p. 570-583, SEP 16 2016. (10/10133-0, 12/18653-8, 14/10740-4, 13/07375-0)

RODRIGUES, MARCOS OKAMURA; CHERRI, LUIZ HENRIQUE; MUNDIM, LEANDRO RESENDE; HOCHREITER, R. MIP models for the irregular strip packing problem: new symmetry breaking constraints. 12TH INTERNATIONAL CONFERENCE APPLIED MATHEMATICAL PROGRAMMING AND MODELLING-APMOD 2016, v. 14, p. 7-pg., 2017-01-01. (12/18653-8, 14/23900-0, 15/24987-4, 13/07375-0, 10/10133-0)

CHERRI, LUIZ HENRIQUE; CHERRI, ADRIANA CRISTINA; CARRAVILLA, MARIA ANTONIA; OLIVEIRA, JOSE FERNANDO; BRAGION TOLEDO, FRANKLINA MARIA; GONCALVES VIANNA, ANDREA CARLA. An innovative data structure to handle the geometry of nesting problems. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 56, n. 23, p. 7085-7102, 2018. (10/10133-0, 12/18653-8, 14/10740-4)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

CHERRI, Luiz Henrique. Nesting problems. 2016. Doctoral Thesis - Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB) São Carlos.