MIP-heuristics for the discrete case of the integrated nesting and cutting path determination problem

- 325821
Extended Abstracts (EA)
Favorite this paper
How to cite this paper?
Abstract

The integrated nesting and cutting path determination problem aims to define a layout for irregular pieces to be cut from larger objects, balancing the material loss during the packing stage and the length of the cutting path performed by the cutting tool. In this article, we propose a MIP-heuristic that solves the integrated problem considering the discrete case where packing is done through a grid of points and cutting is carried out piece by piece.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Estadual Paulista "Júlio de Mesquita Filho" (Unesp)
Track
  • 12. MH – Metaheurístics
Keywords
Nesting problem
Cutting path determination problem
Compromise between solutions