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 条

[11]

Haessler, R.W., Solving a boxcar loading problem (1979) ORSA/TIMS Conference

[12]

Haessler, R.W., Cost minimisation of multiple-vehicle shipments (1991) International Journal of Physical Distribution & Logistic Management, 21 (7), pp. 37-41

[13]

Horowitz, E., Sahni, S., (1978) Fundamentals of Computer Algorithms, , Computer Science Press, Rockville

[14]

Ivancic, N., Mathur, K., Mohanty, B.B., An integer-programming based heuristic approach to the three-dimensional packing problem (1989) Journal Manufacturing and Operations Management, 2, pp. 268-298

[15]

Kröger, B., Schwenderling, P., Vornberger, O., Genetic packing of rectangles on transputers (1991) Transputing '91. Proceedings of the World Transputer User Group Conference 1991, pp. 593-608. , Welch P, et al. (eds). IOS-Press, Amsterdam Washington DC Tokyo

[16]

Lin, J.-L., Foote, B., Pulat, S., Chang, C.-H., Cheung, J.-Y., Hybrid genetic algorithm for container packing in three dimensions (1993) Proceedings of the 9th IEEE Conference on Artificial Intelligence, pp. 353-358. , IEEE Computer Society Press, Washington DC

[17]

Loh, T.H., Nee, A.Y.C., A packing algorithm for hexahedral boxes (1992) Proceedings of the Conference of Industrial Automation, pp. 115-126. , Singapore 1992

[18]

Martello, S., Pisinger, D., Vigo, D., The three-dimensional bin packing problem (1997) Technical Report OR-97-6, , DEIS Operations Research Group, University of Bologna, Bologna. Operations Research (to appear)

[19]

Mohanty, B.B., Mathur, K., Ivancic, N., Value considerations in three-dimensional packing - A heuristic procedure using the fractional knapsack problem (1994) European Journal of Operational Research, 74, pp. 143-151

[20]

Morabito, R., Arenales, M., An AND/OR-graph approach to the container loading problem (1994) International Transactions in Operational Research, 1 (1), pp. 59-73

← 1 2 3 →