A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM

AUTOR(ES)

Cherri, Luiz Henrique, Carravilla, Maria Antónia, Toledo, Franklina Maria Bragion

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

2016-12

RESUMO

ABSTRACT The irregular strip packing problem is a common variant of cutting and packing problems. Only a few exact methods have been proposed to solve this problem in the literature. However, several heuristics have been proposed to solve it. Despite the number of proposed heuristics, only a few methods that combine exact and heuristic approaches to solve the problem can be found in the literature. In this paper, a matheuristic is proposed to solve the irregular strip packing problem. The method has three phases in which exact mixed integer programming models from the literature are used to solve the sub-problems. The results show that the matheuristic is less dependent on the instance size and finds equal or better solutions in 87,5% of the cases in shorter computational times compared with the results of other models in the literature. Furthermore, the matheuristic is faster than other heuristics from the literature.

Documentos Relacionados

• A crop model-based approach for sunflower yields
• Model-based evolution of collaborative agent-based systems
• A model-based approach for assessing in vivo combination therapy interactions
• A model-based analysis of microarray experimental error and normalisation
• A model-based predictive control scheme for steal rolling mills using neural networks