A lower bound for the non-oriented two-dimensional bin packing problem

被引：43
|
作者：
Dell'Amico, M
Martello, S
Vigo, D
机构：
[1] Univ Modena, DISMI, I-42100 Reggio Emilia, Italy
[2] Univ Bologna, DEIS, I-40136 Bologna, Italy
来源：
DISCRETE APPLIED MATHEMATICS | 2002年 / 118卷 / 1-2期
关键词：
cutting and packing; lower bound; branch-and-bound;
D O I：
10.1016/S0166-218X(01)00253-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given a set of rectangular items, and an unlimited number of identical rectangular bins, we consider the problem of allocating, without overlapping, all the items to the minimum number of bins. We assume that the items may be rotated by 90degrees. The problem is strongly NP-hard, and has several industrial applications. No specific lower bound is known for it, We present a lower bound which explicitly takes into account the possible item rotation. The bound is embedded into an exact branch-and-bound algorithm. The average performance is evaluated through computational experiments. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：13 / 24
页数：12
相关论文
共 50 条
  • [1] A new lower bound for the non-oriented two-dimensional bin-packing problem
    Clautiaux, Francois
    Jouglet, Antoine
    El Hayek, Joseph
    [J]. OPERATIONS RESEARCH LETTERS, 2007, 35 (03) : 365 - 373
  • [2] EPSO for Solving Non-oriented Two-dimensional Bin Packing Problem
    Omar, Mohamed K.
    Ramakrishnan, Kumaran
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 106 - 110
  • [3] 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
  • [4] Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation
    Omar, Mohamed K.
    Ramakrishnan, Kumaran
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (20) : 6002 - 6016
  • [5] 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
  • [6] The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
    Marco A. Boschetti
    Aristide Mingozzi
    [J]. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2003, 1 : 27 - 42
  • [7] The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
    Boschetti, Marco A.
    Mingozzi, Aristide
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2003, 1 (01): : 27 - 42
  • [8] 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
  • [9] Two-dimensional Bin Packing Problem in batch scheduling
    Koblasa, Frantisek
    Vavrousek, Miroslav
    Manlig, Frantisek
    [J]. 33RD INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS (MME 2015), 2015, : 354 - 359
  • [10] Solving CSS-Sprite Packing Problem Using a Transformation to the Probabilistic Non-oriented Bin Packing Problem
    Mahfoudh, Soumaya Sassi
    Bellalouna, Monia
    Horchani, Leila
    [J]. COMPUTATIONAL SCIENCE - ICCS 2018, PT II, 2018, 10861 : 561 - 573
12345