A heuristic for multiple container loading problems [Eine Heuristik für Multiple Containerladeprobleme]

被引：14

作者：

Bortfeldt A. ^{[1
]}

机构：

[1] Lehrst. fur Wirtschaftsinformatik, Fachbereich Wirtschaftswissenschaft, Fern Univ. - Gesamthochsch. - Hagen, Profilstraße 8

来源：

OR-Spektrum | 2000年 / 22卷 / 2期

关键词：

Container; Container loading problem; Heuristic; Three-dimensional Bin packing problem; Three-dimensional multiple knapsack problem; Transportation;

D O I：

10.1007/s002910050104

中图分类号：

学科分类号：

摘要：

The paper presents a heuristic for multiple container loading problems. The method is suited for three-dimensional bin packing problems and for three-dimensional knapsack problems as well. In order to select containers to be loaded and boxes to be packed into a chosen container in an appropriate manner the approach includes several selection strategies. A single container is filled by means of an optional procedure that is to be integrated into the overall algorithm. The performance of the heuristic is demonstrated by a numerical comparison with several methods suggested by other authors.

引用

页码：239 / 261

页数：22

共 23 条

[1]

Bischoff, E.E., Ratcliff, M.S.W., Issues in the development of approaches to container loading (1995) Omega, 23, pp. 377-390

[2]

Bischoff, E.E., Ratcliff, M.S.W., Loading multiple pallets (1995) Journal of the Operational Research Society, 46, pp. 1322-1336

[3]

Bischoff, E.E., Janetz, F., Ratcliff, M.S.W., Loading pallets with non-identical items (1995) European Journal of Operational Research, 84, pp. 681-692

[4]

Bortfeldt, A., Gehring, H., Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat (1998) OR-Spektrum, 20, pp. 237-250

[5]

Bortfeldt, A., A genetic algorithm for the container loading problem (1994) Proceedings of the Conference on Adaptive Computing and Information Processing, 2, pp. 25-32. , Unicom Seminars, London

[6]

Bortfeldt, A., (1995) Informierte Graphensuchverfahren und Genetische Algorithmen zur Lösung von Containerbeladeproblemen, , Verlag Dr. Köster, Berlin

[7]

Dyckhoff, H., Finke, U., (1992) Cutting and Packing in Production and Distribution, , Physica, Heidelberg

[8]

Fowler, R.J., Paterson, M.S., Tanimoto, S.L., Optional packing and covering in the plane are NP-complete (1981) Information Processing Letters, 12, pp. 133-137

[9]

Gehring, H., Menschner, K., Meyer, M., A computer-based heuristic for packing pooled shipment containers (1990) European Journal of Operational Research, 44, pp. 277-288

[10]

Gehring, H., Bortfeldt, A., A genetic algorithm for solving the container loading problem (1997) International Transactions in Operational Research, 4 (5-6), pp. 401-418

← 1 2 3 →