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

被引：7
|
作者：
Rodrigues, Marcos Okamura [1 ]
Cherri, Luiz Henrique [1 ]
Mundim, Leandro Resende [1 ]
机构：
[1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Ave Trabalhador Sao Carlense,400 Ctr, Sao Carlos, SP, Brazil
来源：
12TH INTERNATIONAL CONFERENCE APPLIED MATHEMATICAL PROGRAMMING AND MODELLING-APMOD 2016 | 2017年 / 14卷
基金：
巴西圣保罗研究基金会;
关键词：
PROGRAMMING-MODELS;
D O I：
10.1051/itmconf/20171400005
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页数：7
相关论文
共 50 条
  • [1] A clique covering MIP model for the irregular strip packing problem
    Rodrigues, Marcos Okamura
    Toledo, Franklina M. B.
    COMPUTERS & OPERATIONS RESEARCH, 2017, 87 : 221 - 234
  • [2] A semi-continuous MIP model for the irregular strip packing problem
    Leao, Aline A. S.
    Toledo, Franklina M. B.
    Oliveira, Jose Fernando
    Carravilla, Maria Antonia
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (03) : 712 - 721
  • [3] Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
    Francisco Trespalacios
    Ignacio E. Grossmann
    Annals of Operations Research, 2017, 258 : 747 - 759
  • [4] Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
    Trespalacios, Francisco
    Grossmann, Ignacio E.
    ANNALS OF OPERATIONS RESEARCH, 2017, 258 (02) : 747 - 759
  • [5] Robust mixed-integer linear programming models for the irregular strip packing problem
    Cherri, Luiz H.
    Mundim, Leandro R.
    Andretta, Marina
    Toledo, Franklina M. B.
    Oliveira, Jose F.
    Carravilla, Maria Antonia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (03) : 570 - 583
  • [6] Heuristics for the strip packing problem with unloading constraints
    da Silveira, Jefferson L. M.
    Miyazawa, Flavio K.
    Xavier, Eduardo C.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 991 - 1003
  • [7] Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
    Umetani, Shunji
    Murakami, Shohei
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303 (03) : 1009 - 1026
  • [8] Symmetry-breaking constraints for packing identical rectangles within polyhedra
    R. Andrade
    E. G. Birgin
    Optimization Letters, 2013, 7 : 375 - 405
  • [9] Symmetry-breaking constraints for packing identical rectangles within polyhedra
    Andrade, R.
    Birgin, E. G.
    OPTIMIZATION LETTERS, 2013, 7 (02) : 375 - 405
  • [10] A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands
    de Souza Queiroz, Layane Rodrigues
    Andretta, Marina
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (06) : 3486 - 3513
12345