An Estimation of Distribution Algorithm for the 3D Bin Packing Problem with Various Bin Sizes

被引：0
|
作者：
Cai, Yaxiong [1 ]
Chen, Huaping [1 ]
Xu, Rui [1 ]
Shao, Hao [2 ]
Li, Xueping [3 ]
机构：
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei 230026, Peoples R China
[2] Shanghai Univ Int Business & Econom, Sch WTO Res & Educ, Shanghai 200336, Peoples R China
[3] Univ Tennessee, Dept Ind & Informat Engn, Knoxville, TN 37996 USA
来源：
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2013 | 2013年 / 8206卷
基金：
中国博士后科学基金; 中国国家自然科学基金;
关键词：
Optimization; Bin packing problem; Estimation of distribution algorithm; Genetic algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The 3D bin packing problem (3DBPP) is a practical problem modeled from modern industry application such as container ship loading and plane cargo management. Unlike traditional bin packing problem where all bins are of the same size, this paper investigates a more general type of 3DBPP with bins of various sizes. We proposed a modified univariate marginal distribution algorithm (UMDA) for solving the problem. A packing strategy derived from a deepest bottom left packing method was employed. The modified UMDA was experimentally compared with CPLEX and a genetic algorithm (GA) approach. The experimental study showed that the proposed algorithm performed better than GA and CPLEX for large-scale instances.
引用
收藏
页码：401 / 408
页数：8
相关论文
共 50 条
  • [41] DUAL BIN PACKING WITH ITEMS OF RANDOM SIZES
    RHEE, WST
    TALAGRAND, M
    MATHEMATICAL PROGRAMMING, 1993, 58 (02) : 229 - 242
  • [42] OPTIMAL BIN PACKING WITH ITEMS OF RANDOM SIZES
    RHEE, WT
    MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 140 - 151
  • [43] A new algorithm for the Bin-Packing problem with fragile objects
    Laabadi, Soukaina
    PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL'16), 2016,
  • [44] A deep reinforcement learning approach for online and concurrent 3D bin packing optimisation with bin replacement strategies
    Tsang, Y. P.
    Mo, D. Y.
    Chung, K. T.
    Lee, C. K. M.
    COMPUTERS IN INDUSTRY, 2025, 164
  • [45] A hybrid chemical reaction optimization algorithm for bin packing problem
    Jiang, Linyan
    Cai, Yong
    Li, Ruihui
    Wang, Taihong
    2017 NINTH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC 2017), VOL 1, 2017, : 153 - 157
  • [46] A New Hybrid Local Search Algorithm on Bin Packing Problem
    Yesil, Cagri
    Turkyilmaz, Hasan
    Korkmaz, Emin Erkan
    2012 12TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS (HIS), 2012, : 161 - 166
  • [47] An effective resolution algorithm for the two dimensional bin packing problem
    Zhou, Yuyu
    Rao, Yunqing
    Zhang, Chaoyong
    Zhang, Guojun
    MATERIALS PROCESSING TECHNOLOGY, PTS 1-4, 2011, 291-294 : 2574 - 2578
  • [48] Missing Data and Their Effect on Algorithm Selection for the Bin Packing Problem
    Carlos Ortiz-Bayliss, Jose
    Karen Garate-Escamilla, Anna
    Terashima-Marin, Hugo
    PATTERN RECOGNITION, MCPR 2024, 2024, 14755 : 34 - 43
  • [49] A branch-and-price algorithm for the temporal bin packing problem
    Dell'Amico, Mauro
    Furini, Fabio
    Iori, Manuel
    COMPUTERS & OPERATIONS RESEARCH, 2020, 114
  • [50] A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
    Elhedhli, Samir
    Li, Lingzi
    Gzara, Mariem
    Naoum-Sawaya, Joe
    INFORMS JOURNAL ON COMPUTING, 2011, 23 (03) : 404 - 415
12345