Abstract
This paper presents a Less Flexibility First (LFF) based algorithm for solving container loading problems in which boxes of given sizes are to be packed into a single container. The objective is to maximize volume utilization. LFF, firstly introduced in [An effective quasi-human heuristic for solving the rectangle packing problem, European Journal of Operations Research 141 (2002) 341], is an effective deterministic heuristic applied to 2D packing problems and generated up to 99% packing densities. Its usage is now extended to the container loading problem. Objects are packed according to their flexibilities. Less flexible objects are packed to less flexible positions of the container. Pseudo-packing procedures enable improvements on volume utilization. Encouraging packing results with up to 93% volume utilization are obtained in experiments running on benchmark cases from other authors.
This is a preview of subscription content, log in via an institution to check access.
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
A. Bortfeldt, H. Gehring, A hybrid genetic algorithm for the container loading problem, European Journal of Operational Research 131 (2001) 143–161
A. Bortfeldt, H. Gehring, D. Mack, A parallel tabu search algorithmfor solving the container loading problem, Parallel Computing 29 (2003) 641–662
B. K. A. Ngoi, M. L, Tay, E. S. Chua, Applying spatial representation techniques to the container packing problem, International Journal of Production Research 1 (1994) 59–73
C. S. Chen, S. M. Lee, Q. S. Shen, An analytical model for the Container Loading Problem, European Journal of Operational Research 80 (1995) 68–76
D. Pisinger, Heuristic for the container loading problem, European Journal of Operational Research 141 (2002) 982–392
D. Pisinger. The container loading problem, in Proceedins NOAS’ 97, 1997.
D. Y. He, J. A. Cha, Research on solution to complex container loading problem based on genetic algorithm, Proceedings of the First International Conference on Machine Learning and Cybernetics, Beijing (2002)
E. E. Bischoff, B. S. W. Ratcliff, Issues in the development of approaches to container loading, Omega 23 (1995) 377–390
E. E. Bischoff, F. Janetz, M. S. W. Ratcliff, Loading pallets with non-identical items, European Journal of Operational Research 84 (1995) 681–692
H. Gehring, A. Bortfeldt, A genetic algorithm for solving the container loading problem, International Transactions in Operational Research 4 (1997) 401–418
T. H. Loh, A. Y. C. Nee, A packing algorithm for hexahedral boxes, Proceedings of the Conference of Industrial Automation, Singapore (1992) 115–126
Y. L. Wu, W. Q. Huang, S. C. Lau, C. K. Wong and G. H. Young, An effective quasi-human heuristic for solving the rectangle packing problem, European Journal of Operational Research 141 (2002) 341–358
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, YT., Wu, YL. (2005). A Less Flexibility First Based Algorithm for the Container Loading Problem. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_46
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)