Multiobjectice integer cutting stock problem

• Grant number: 14/22665-7
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate
• Start date: April 01, 2015
• End date: May 01, 2015
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Antonio Carlos Moretti
• Grantee: Angelo Aliano Filho
• Supervisor: Margarida Maria Gonçalves Vaz Pato
• Host Institution: Instituto de Matemática, Estatística e Computação Científica (IMECC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Institution abroad: Universidade de Lisboa, Portugal
• Associated to the scholarship: 13/06035-0 - Multiobjective integer cutting problems, BP.DR

Abstract

The object of this internship is the investigation of methods to solve Multiobjective Integer Cutting Stock Problems. As we know, this problem is of combinatorial nature, characterized in the literature as NP-hard, that motivates the academic community in the research for methods more and more efficient. In literature, there are very few studies that address this problem by opting for classical methods of multi-objective optimization. There is a big trend in research that report experiences with this and other problems via multi-objective evolutionary algorithms. Our intention is to develop techniques of multiobjective programming classic, such as weighted sum, e-constraint, Metrics and Tchebycheff method Beenson to find the exact way the Pareto frontier for this problem. Additionally, the entire approach of multiobjective optimization problems via exact algorithms is still largely treated subject, and thus it is necessary to provide new horizons and tools for the application of these procedures become increasingly viable in practice. With this, we can expand the field of application of these methods and provide new theoretical and practical tools to assist managers in the area of Production Engineering in decision-making frameworks. (AU)