The three-dimensional bin packing problem and its practical algorithm

被引:13
|
作者
Jin, ZH [1 ]
Ito, T [1 ]
Ohno, K [1 ]
机构
[1] Nagoya Inst Technol, Dept Syst Engn, Nagoya, Aichi 4668555, Japan
关键词
3D bin packing problem; practical constraints; MIP; sub-volume; tabu search; benchmarking;
D O I
10.1299/jsmec.46.60
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The three-dimensional bin packing problem (3DBPP) is orthogonally to pack a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. It is formulated as a mixed integer program (MIP) that can solve small-sized instances to optimum. For large scale of instances, a composite algorithm, aimed at solving the 3DBPP with several practical constraints, is proposed and evaluated by the lower bound and the test instances available on website. It should be noted that although the computational tests are conducted for the 3DBPP with identical bins, the proposed approach is designed for a general case with heterogeneous bins.
引用
收藏
页码:60 / 66
页数:7
相关论文
共 50 条
  • [21] A global optimization algorithm for the three-dimensional packing problem
    Faina, L
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (02) : 340 - 354
  • [22] Two-layer heuristic for the three-dimensional bin design and packing problem
    Yang, Ying
    Wu, Zili
    Hao, Xiaodeng
    Liu, Huiqiang
    Qi, Mingyao
    ENGINEERING OPTIMIZATION, 2024, 56 (10) : 1601 - 1638
  • [23] Adaptive Sequence-Based Heuristic for the Three-Dimensional Bin Packing Problem
    Oliveira, Oscar
    Matos, Telmo
    Gamboa, Dorabela
    LEARNING AND INTELLIGENT OPTIMIZATION, LION, 2020, 11968 : 69 - 76
  • [24] A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
    Parreno, F.
    Alvarez-Valdes, R.
    Oliveira, J. F.
    Tamarit, J. M.
    ANNALS OF OPERATIONS RESEARCH, 2010, 179 (01) : 203 - 220
  • [25] A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
    F. Parreño
    R. Alvarez-Valdes
    J. F. Oliveira
    J. M. Tamarit
    Annals of Operations Research, 2010, 179 : 203 - 220
  • [26] Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem
    Liu, Yi
    Jiang, Xiaoyun
    COMPLEX & INTELLIGENT SYSTEMS, 2024, 10 (03) : 4055 - 4081
  • [27] A layer-building algorithm for the three-dimensional multiple bin packing problem: a case study in an automotive company
    Saraiva, Rommel D.
    Nepomuceno, Napoleao
    Pinheiro, Placido R.
    IFAC PAPERSONLINE, 2015, 48 (03): : 490 - 495
  • [28] Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem
    Yi Liu
    Xiaoyun Jiang
    Complex & Intelligent Systems, 2024, 10 : 4055 - 4081
  • [29] Optimizing three-dimensional bin packing through simulation
    Dube, Erick
    Kanavathy, Leon R.
    PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON MODELLING, SIMULATION, AND OPTIMIZATION: SCIENCE AND TECHNOLOGY FOR DEVELOPMENT IN THE 21ST CENTURY, 2006, : 1 - +
  • [30] An algorithm for the three-dimensional packing problem with asymptotic performance analysis
    F. K. Miyazawa
    Y. Wakabayashi
    Algorithmica, 1997, 18 : 122 - 144