Optimizing three-dimensional bin packing through simulation

被引:0
|
作者
Dube, Erick [1 ]
Kanavathy, Leon R. [2 ]
机构
[1] Univ KwaZulu Natal, Sch Comp Sci, P Bag X54001, ZA-4000 Durban, South Africa
[2] Phoenix, ZA-4068 Durban, South Africa
关键词
simulation; optimization; bin packing; best fit; first fit; rotation;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into a minimum number of three-dimensional rectangular bins. We harness the computing power of the modem day computers to solve this NP-Hard problem that would be otherwise practically extremely difficult. The software tool that we develop using both heuristics and some knapsack problem approach, presents the solutions as a 3D graphical representation of the solution space. The visual and interactive ability of the simulation model provides a disciplined approach to solving the 3D Bin Packing Problem.
引用
收藏
页码:1 / +
页数:2
相关论文
共 50 条
  • [31] Real-Polarized Genetic Algorithm for the Three-Dimensional Bin Packing Problem
    Dornas, Andre Homem
    Cruzeiro Martins, Flavio Vinicius
    Machry Sarubbi, Joao Fernando
    Wanner, Elizabeth Fialho
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 785 - 792
  • [32] 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
  • [33] 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
  • [34] 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
  • [35] A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
    Gregory S. Taylor
    Yupo Chan
    Ghulam Rasool
    Annals of Operations Research, 2017, 251 : 397 - 427
  • [36] A column generation-based heuristic for the three-dimensional bin packing problem with rotation
    Mahvash, Batoul
    Awasthi, Anjali
    Chauhan, Satyaveer
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (01) : 78 - 90
  • [37] A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
    Taylor, Gregory S.
    Chan, Yupo
    Rasool, Ghulam
    ANNALS OF OPERATIONS RESEARCH, 2017, 251 (1-2) : 397 - 427
  • [38] Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
    Hifi, Mhand
    Negre, Stephane
    Wu, Lei
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (01) : 59 - 79
  • [39] Quantifying Three-Dimensional Chromatin Packing through Electron Tomography
    Li, Yue
    Eshein, Adam
    Roth, Eric
    Bleher, Reiner
    Backman, Vadim
    BIOPHYSICAL JOURNAL, 2020, 118 (03) : 334A - 334A
  • [40] Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
    Martello, Silvano
    Pisinger, David
    Vigo, Daniele
    Den Boef, Edgar
    Korst, Jan
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2007, 33 (01):