Abstract
We examine the multiple container loading cost minimization problem (MCLCMP), where the objective is to load products of various types into containers of various sizes so as to minimize the total container cost. We transform the MCLCMP into an extended set cover problem that is formulated using linear integer programming and solve it with a heuristic to generate columns. Experiments on standard bin-packing instances show our approach is superior to prior approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bischoff, E.E., Ratcliff, M.S.W.: Issues in the development of approaches to container loading. OMEGA the International Journal of Management Science 23(4), 377–390 (1995), http://dx.doi.org/10.1016/0305-0483(95)00015-G
Bortfeldt, A.: A heuristic for multiple container loading problems. OR Spectrum 22(2), 239–261 (2000), http://dx.doi.org/10.1007/s002910050104
Eley, M.: Solving container loading problems by block arrangement. European Journal of Operational Research 141(2), 393–409 (2002), http://dx.doi.org/10.1016/S0377-2217(02)00133-9
Eley, M.: A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25(1), 45–60 (2003), http://dx.doi.org/10.1007/s002910200113
Ivancic, N., Mathur, K., Mohanty, B.B.: An integer programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing and Operations Management 2, 268–298 (1989)
Lim, A., Zhang, X.: The container loading problem. In: SAC 2005: Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 913–917. ACM, New York (2005), http://dx.doi.org/10.1145/1066677.1066888
Moura, A., Oliveira, J.F.: A grasp approach to the container-loading problem. IEEE Intelligent Systems 20(4), 50–57 (2005), http://dx.doi.org/10.1109/MIS.2005.57
Scheithauer, G., Terno, J.: The G4-heuristic for the pallet loading problem. Journal of the Operational Research Society 47(4), 511–522 (1996), http://dx.doi.org/10.2307/3010727
Takahara, S.: A simple meta-heuristic approach for the multiple container loading problem. In: SMC 2006: IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 2328–2333 (October 2006), http://dx.doi.org/10.1109/ICSMC.2006.385210
Takahara, S.: A multi-start local search approach to the multiple container loading problem. In: Bednorz, W. (ed.) Advances in Greedy Algorithms, pp. 55–68. IN-TECH, I-TECH Education and Publishing, Zieglergasse 14 1070 Vienna Austria (2008)
Terno, J., Scheithauer, G., Sommerweiß, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. European Journal of Operational Research 123(2), 372–381 (2000), http://dx.doi.org/10.1016/S0377-2217(99)00263-5
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Che, C.H., Huang, W., Lim, A., Zhu, W. (2011). A Heuristic for the Multiple Container Loading Cost Minimization Problem. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-21827-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21826-2
Online ISBN: 978-3-642-21827-9
eBook Packages: Computer ScienceComputer Science (R0)