MIP models for the irregular strip packing problem: new symmetry breaking constraints

Author(s)

Rodrigues, Marcos Okamura ; Cherri, Luiz Henrique ; Mundim, Leandro Resende ; Hochreiter, R

• Document type: Journal article
• Source: 12TH INTERNATIONAL CONFERENCE APPLIED MATHEMATICAL PROGRAMMING AND MODELLING-APMOD 2016; v. 14, p. 7-pg., 2017-01-01.

Abstract

The irregular strip packing problem consists in minimizing the length used to cut a set of pieces from a board with fixed width. Recently, a mixed integer programming model was proposed for the problem, but it may allow a large number of symmetric solutions. In this paper, new symmetry breaking constraints are proposed to improve the model. Computational experiments were performed for instances with convex pieces. The results show the proposed formulation is better than the previous one for most instances, since it improves lower bounds and reduces run-time and number of nodes explored to prove optimality. (AU)

• FAPESP's process: 12/18653-8 - Nesting problem
• Grantee: Luiz Henrique Cherri
• Support Opportunities: Scholarships in Brazil - Doctorate
• FAPESP's process: 14/23900-0 - Irregular and quasi-polyomino cutting and packing problems
• Grantee: Marcos Okamura Rodrigues
• Support Opportunities: Scholarships in Brazil - Doctorate
• FAPESP's process: 15/24987-4 - Irregular cutting problems: methods and applications
• Grantee: Luiz Henrique Cherri
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
• Grantee: Francisco Louzada Neto
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
• FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
• Grantee: Reinaldo Morabito Neto
• Support Opportunities: Research Projects - Thematic Grants