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
来源：
PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON MODELLING, SIMULATION, AND OPTIMIZATION: SCIENCE AND TECHNOLOGY FOR DEVELOPMENT IN THE 21ST CENTURY | 2006年
关键词：
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 条
  • [41] Using distributed genetic algorithms in three-dimensional bin-packing for rapid prototyping machines
    Lewis, JE
    Ragade, RK
    Kumar, A
    Biles, WE
    Ikonen, IT
    INTELLIGENT SYSTEMS IN DESIGN AND MANUFACTURING, 1998, 3517 : 45 - 53
  • [42] Benchmark dataset and instance generator for real-world three-dimensional bin packing problems
    Osaba, Eneko
    Villar-Rodriguez, Esther
    Romero, Sebastian V.
    DATA IN BRIEF, 2023, 49
  • [43] A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
    Fontaine, Pirmin
    Minner, Stefan
    OPERATIONS RESEARCH, 2023, 71 (01) : 273 - 288
  • [44] MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints
    Paquay, Celia
    Limbourg, Sabine
    Schyns, Michael
    Oliveira, Jose Fernando
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (04) : 1581 - 1592
  • [45] A GRASP/Path Re linking algorithm for two-and three-dimensional multiple bin-size bin packing problems
    Alvarez-Valdes, R.
    Parreno, F.
    Tamarit, J. M.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 3081 - 3090
  • [46] A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints
    Paquay, Celia
    Limbourg, Sabine
    Schyns, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (01) : 52 - 64
  • [47] The three-dimensional rectangular Multiple Bin Size Bin Packing Problem with transportation constraintsA case study in the field of air transportation
    Célia Paquay
    4OR, 2017, 15 : 431 - 432
  • [48] Three-Dimensional Multiple-Bin-Size Bin Packing: A Case Study with a New MILP-Based Upper Bound
    Baazaoui, Mariem
    Hanafi, Said
    Kamoun, Hichem
    OPERATIONAL RESEARCH IN BUSINESS AND ECONOMICS, 2017, : 225 - 234
  • [49] The three-dimensional rectangular Multiple Bin Size Bin Packing Problem with transportation constraints A case study in the field of air transportation
    Paquay, Celia
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2017, 15 (04): : 431 - 432
  • [50] Three dimensional Bin Packing Problem in batch scheduling.
    Koblasa, Frantisek
    Vavrousek, Miroslav
    Manlig, Frantisek
    34TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS (MME 2016), 2016, : 407 - 412
12345