Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints

被引:17
|
作者
Lodi, Andrea [1 ]
Monaci, Michele [2 ]
Pietrobuoni, Enrico [1 ]
机构
[1] Univ Bologna, DEI Guglielmo Marconi, Viale Risorgimento 2, I-40136 Bologna, Italy
[2] Univ Padua, DEI, Via Gradenigo 6-A, I-35131 Padua, Italy
关键词
Two-dimensional packing; Guillotine cuts; Heuristic algorithms; Computational experiments; 3-STAGE; MODELS;
D O I
10.1016/j.dam.2015.09.012
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider the variant of the Two-Dimensional Bin Packing Problem in which items have to be obtained by a series of guillotine cuts and cannot be rotated. We present a heuristic algorithm based on partial enumeration, and computationally evaluate its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:40 / 47
页数:8
相关论文
共 50 条
  • [1] Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
    Han, Wei
    Bennell, Julia A.
    Zhao, Xiaozhou
    Song, Xiang
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 230 (03) : 495 - 504
  • [2] Approximation algorithms for the two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    [J]. FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 177 - 184
  • [3] ALGORITHMS FOR THE TWO DIMENSIONAL BIN PACKING PROBLEM WITH PARTIAL CONFLICTS
    Hamdi-Dhaoui, Khaoula
    Labadie, Nacima
    Yalaoui, Alice
    [J]. RAIRO-OPERATIONS RESEARCH, 2012, 46 (01) : 41 - 62
  • [4] A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
    Charalambous, Christoforos
    Fleszar, Krzysztof
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (10) : 1443 - 1451
  • [5] An agent-based approach to the two-dimensional guillotine bin packing problem
    Polyakovsky, Sergey
    M'Hallah, Rym
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 192 (03) : 767 - 781
  • [6] Approximation algorithms for the oriented two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) : 158 - 166
  • [7] The Two Dimensional Bin Packing Problem with Side Constraints
    Seizinger, Markus
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2017, 2018, : 45 - 50
  • [8] Genetic Algorithms for Two Dimensional Bin Packing Problem
    Volna, Eva
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014), 2015, 1648
  • [9] Multi-dimensional bin packing problems with guillotine constraints
    Amossen, Rasmus R.
    Pisinger, David
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1999 - 2006
  • [10] A Memetic Algorithm for the Two-Dimensional Bin-Packing Problem with Partial Conflicts
    Hamdi-Dhaoui, Khaoula
    Labadie, Nacima
    Yalaoui, Alice
    [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 371 - 379