Antonio Martínez Sykora – A MATHEURISTIC ALGORITHM FOR NESTING PROBLEMS.

Dilluns 20 de Maig, 12:30 hores, Saló de Graus.

Nesting Problem

The two-dimensional irregular strip packing problems, known as Nesting problems, arise in a wide variety of industries like garment, sheet metal cutting, furniture making and shoe manufacturing. We have developed an Iterated Greedy Algorithm based on the reinsertion of the pieces. The IGA uses a constructive algorithm (CA) based on the insertion of the pieces one at a time. Since for each insertion a Mixed Integer Programming (MIP) model is solved to optimality, determined parameters of the CA changes during the IGA in order to adjust the difficulty of the MIP model. Computational results show that IGA is competitive and improve the best known solution on several instances.

Slides

Esta entrada fue publicada en Investigación Operativa. Guarda el enlace permanente.

Deja un comentario

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *


¡IMPORTANTE! Responde a la pregunta: ¿Cuál es el valor de 2 13 ?