A heuristic algorithm for the container loading problem with complex loading constraints

被引：9

作者：

Iwasawa, Hiroki ^{[1
]}

Hu, Yannan ^{[2
]}

Hashimoto, Hideki ^{[3
]}

Imahori, Shinji ^{[4
]}

Yagiura, Mutsunori ^{[2
]}

机构：

[1] Nagoya Univ, Grad Sch Engn, Dept Computat Sci & Engn, Chikusa Ku, Nagoya, Aichi 4648603, Japan

[2] Nagoya Univ, Grad Sch Informat Sci, Dept Comp Sci & Math Informat, Chikusa Ku, Nagoya, Aichi 4648601, Japan

[3] Tokyo Univ Marine Sci & Technol, Dept Logist & Informat Engn, Koto Ku, 2-1-6 Etchujima, Tokyo 1358533, Japan

[4] Chuo Univ, Fac Sci & Engn, Dept Informat & Syst Engn, Bunkyo Ku, 1-13-27 Kasuga, Tokyo 1128551, Japan

来源：

JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING | 2016年 / 10卷 / 03期

关键词：

Container loading; Bin packing; Greedy strategy; Challenge Renault/ESICUP; KNAPSACK-PROBLEM;

D O I：

10.1299/jamdsm.2016jamdsm0041

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015. The three-dimensional container loading problem involves packing a set of cuboid items into bins so as to minimize the total volume used. In this paper, we propose an effective approach to solve this problem based on a greedy strategy. We first generate high-quality stacks that consist of some items and then pack these stacks on the floor of bins, considering the resulting problem as a two-dimensional bin packing problem. The proposed algorithm is tested on a series of instances provided for the challenge. The computational results show that the proposed algorithm performs well on these instances.

引用

页数：12

共 9 条

[1]

[Anonymous], 2004, Knapsack Problems, DOI DOI 10.1007/978-3-540-24777-710

[2] ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].