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

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

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 cons...

Full description

Bibliographic Details
Main Authors: Rodrigues Marcos Okamura, Cherri Luiz Henrique, Mundim Leandro Resende
Format: Article
Language:English
Published: EDP Sciences 2017-01-01
Series:ITM Web of Conferences
Online Access:https://doi.org/10.1051/itmconf/20171400005
id doaj-34d30aa8e40143fd9205814a2c09d50a
record_format Article
spelling doaj-34d30aa8e40143fd9205814a2c09d50a2021-02-02T08:05:37ZengEDP SciencesITM Web of Conferences2271-20972017-01-01140000510.1051/itmconf/20171400005itmconf_apmod2017_00005MIP models for the irregular strip packing problem: new symmetry breaking constraintsRodrigues Marcos OkamuraCherri Luiz HenriqueMundim Leandro ResendeThe 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.https://doi.org/10.1051/itmconf/20171400005
collection DOAJ
language English
format Article
sources DOAJ
author Rodrigues Marcos Okamura
Cherri Luiz Henrique
Mundim Leandro Resende
spellingShingle Rodrigues Marcos Okamura
Cherri Luiz Henrique
Mundim Leandro Resende
MIP models for the irregular strip packing problem: new symmetry breaking constraints
ITM Web of Conferences
author_facet Rodrigues Marcos Okamura
Cherri Luiz Henrique
Mundim Leandro Resende
author_sort Rodrigues Marcos Okamura
title MIP models for the irregular strip packing problem: new symmetry breaking constraints
title_short MIP models for the irregular strip packing problem: new symmetry breaking constraints
title_full MIP models for the irregular strip packing problem: new symmetry breaking constraints
title_fullStr MIP models for the irregular strip packing problem: new symmetry breaking constraints
title_full_unstemmed MIP models for the irregular strip packing problem: new symmetry breaking constraints
title_sort mip models for the irregular strip packing problem: new symmetry breaking constraints
publisher EDP Sciences
series ITM Web of Conferences
issn 2271-2097
publishDate 2017-01-01
description 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.
url https://doi.org/10.1051/itmconf/20171400005
work_keys_str_mv AT rodriguesmarcosokamura mipmodelsfortheirregularstrippackingproblemnewsymmetrybreakingconstraints
AT cherriluizhenrique mipmodelsfortheirregularstrippackingproblemnewsymmetrybreakingconstraints
AT mundimleandroresende mipmodelsfortheirregularstrippackingproblemnewsymmetrybreakingconstraints
_version_ 1724297892138582016

Similar Items