Multi-Container Loading with Non-Convex 3D Shapes Using a GA/TS Hybrid

被引：0

作者：

Nebel, Philipp ^{[1
]}

Richter, Gunther

Weicker, Karsten ^{[1
]}

机构：

[1] HTWK Leipzig Univ Appl Sci Comp Sci Math & Nat Sc, D-04251 Leipzig, Germany

来源：

PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE | 2012年

关键词：

container loading; 3D packing; genetic algorithm; ALGORITHM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A genetic algorithm is developed for a multi-container problem and integrated into a commercial software product. The considered problem is characterized by specific requirements, e.g. non-convex 3D shapes composed of several cuboids and a broad range of constraints. The algorithm uses the packing list as genotype, the first-fit heuristic for placing the items, and a set of problem-specific operators. The algorithm is tested on simple examples, benchmarks by Bischoff/Ratcliff and Loh/Nee, and real-world customer data. The proposed algorithm proves to be an all-rounder that excels on non-convex problems and delivers acceptable results on regular (benchmark) problems.

引用

页码：1143 / 1150

页数：8

共 17 条

[11] Ikonen I., 1997, P 7 INT C GENETIC AL, P591
[12] Karabulut K, 2004, LECT NOTES COMPUT SC, V3261, P441
[13] Heuristic algorithms for the three-dimensional bin packing problem
Lodi, A
Martello, S
Vigo, D
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 410 - 420
[14] Loh T.H., 1992, Proceedings of the Conference of Industrial Automation, P115
[15] The three-dimensional bin packing problem
Martello, S
Pisinger, D
Vigo, D
[J]. OPERATIONS RESEARCH, 2000, 48 (02) : 256 - 267
[16] Nebel P., 2010, THESIS HTWK LEIPZIG
[17] A maximal-space algorithm for the container loading problem
Parreno, F.
Alvarez-Valdes, R.
Tamarit, J. M.
Oliveira, J. F.
[J]. INFORMS JOURNAL ON COMPUTING, 2008, 20 (03) : 412 - 422

← 1 2 →