Abstract
The container loading problem addresses the question of how to store several three dimensional, rectangular items (e.g. boxes) in one or more containers in such a way that maximum use is made of the container space. The multiple container problem concentrates on the situation where the consignment to be loaded cannot be accommodated in a single container. To minimize the number of required containers the repeated application of a single container approach is often suggested in the literature. In contrast, in this paper an approach based on a set partitioning formulation of the problem is presented. Within this approach a single container algorithm is used to produce alternative loading patterns. This approach easily allows introducing additional aspects, e.g. separation of boxes or complete shipment of boxes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bischoff EE, Ratcliff MSW (1995) Loading multiple pallets. Journal of the Operational Research Society 46: 1322–1336
Terno J, Scheithauer G, Sommerweiß U, Riehme, J (2000) An efficient approach for the multi-pallet loading problem. European Journal of Operational Research 123: 372–381
Eley M (2001) Solving container loading problems by block arrangement. European Journal of Operational Research 141: 393–409
Ivancic N J, Mathur K, Mohanty B B (1989) An integer-programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing and Operations Management 2: 268–298
Mohanty B B, Mathur K, Ivancic N J (1994) Value considerations in three-dimensional packing — A heuristic procedure using the fractional Knapsack problem. European Journal of Operational Research 74: 143–151
Martello S, Pisinger D, Vigo D (1997) The three-dimensional bin packing problem. Technical Report OR-97-6, DIES Operations Research Group, University of Bologna, Bologna. Operations Research (to appear)
Bortfeldt A (2000) Eine Heuristik für Multiple Containerladeprobleme. OR Spektrum 22: 239–262
Gilmore P C, Gomory R E (1961) A linear programming approach to the cutting stock problem. Operations Research 9: 849–859
Bischoff E E, Ratcliff M S W (1995) Issues in the development of approaches to container loading. Omega — International Journal of Management Science 23: 377–390
Martello S, Toth P (1990) Knapsack problems — algorithms and computer implementations. Knapsack problems — algorithms and computer implementations Wiley, New York
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Eley, M. (2005). A bottleneck assignment approach to the multiple container loading problem. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)