Multiobjective integer cutting problems

Abstract

The object of study this project is the investigation of the Multiobjective Integer Cutting Problems (MICP). As we know, even in simplest version, this problem is of the combinatorial nature, characterized in the literature as NP-Hard, which motivates the academic community in the search for solution methods more efficient. In addition, few studies have been performed with the multi-objective optimization under practical and theoretical, serving as motivation and additional interest to apply and develop new techniques in the field of Operations Research (OR). Among the solution strategies for dealing with MICPs, we point to the exact method of Epsilon-Restricted and Matheuristics, which is a hybridization between metaheuristics and exact classical methods, specialized for solving problems of high complexity. When investigate the MICPs, some formulations are closer to reality and more appropriate methods of resolution will be developed in order to expand the domain of these new methodologies and provide a new theoretical framework to support mainly managers of the Engineering Production in making decisions. (AU)