Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5877
Title: A semi-continuous MIP model for the irregular strip packing problem
Authors: Leao,AAS
Toledo,FMB
José Fernando Oliveira
Maria Antónia Carravilla
Issue Date: 2016
Abstract: Solving nesting problems involves the waste minimisation in cutting processes, and therefore it is not only economically relevant for many industries but has also an important environmental impact, as the raw materials that are cut are usually a natural resource. However, very few exact approaches have been proposed in the literature for the nesting problem (also known as irregular packing problem), and the majority of the known approaches are heuristic algorithms, leading to suboptimal solutions. The few mathematical programming models known for this problem can be divided into discrete and continuous models, based on how the placement coordinates of the pieces to be cut are dealt with. In this paper, we propose an innovative semi-continuous mixed-integer programming model for two-dimensional cutting and packing problems with irregular shaped pieces. The model aims to exploit the advantages of the two previous classes of approaches and discretises the [GRAPHICS] -axis while keeping the [GRAPHICS] -coordinate continuous. The board can therefore be seen as a set of stripes. Computational results show that the model, when solved by a commercial solver, can deal with large problems and determine the optimal solution for smaller instances, but as it happens with discrete models, the optimal solution value depends on the discretisation step that is used.
URI: http://repositorio.inesctec.pt/handle/123456789/5877
http://dx.doi.org/10.1080/00207543.2015.1041571
metadata.dc.type: article
Publication
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00G-MZ0.pdf
  Restricted Access
476.47 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.