Abstract
Packing problems deal with loading of a set of items (objects) into a set of boxes (containers) in order to optimize a performance criterion under various constraints. With the advance of RFID technologies and investments in IT infrastructures companies now have access to the necessary data that can be utilized in cost reduction of packing processes. Therefore bin packing and container loading problems are becoming more popular in recent years. In this research we propose a beam search algorithm to solve a packing problem that we encountered in a real world project. The 3D-MBSBPP (Multiple Bin Sized Bin Packing Problem) that we present and solve has not been analyzed in literature before, to the best of our knowledge. We present the performance of our proposed beam search algorithm in terms of both cost and computational time in comparison to a greedy algorithm and a tree search enumeration algorithm.
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
Akturk, M.S., Kilic, K.: Generating short-term observation schedules for space mission projects. Journal of Intelligent Manufacturing 10(5), 387–404 (1999)
Bisckhof, E.E., Wäscher, G.: Cutting and packing. European Journal of Operational Research 84(3), 503–505 (1995)
Brunetta, L., Grégoire, P.A.: General purpose algorithm for three-dimensional packing. INFORMS Journal on Computing 17(3), 328–338 (2005)
Chung, F., Graham, R., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. ACM Symposium on Parallel Algorithms and Architectures. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, Barcelona, Spain, pp. 103–111 (2004)
Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44, 145–159 (1990)
Dyckhoff, H., Finke, U.: Cutting and Packing in Production and Distribution. Springer, Berlin (1992)
Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and Packing. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 393–412. Wiley, Chichester (1997)
Eley, M.: A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25, 45–60 (2003)
Ivancic, N.J., 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)
Lowerre, B.: The HARPY speech recognition system. Ph.D. Thesis, Carnegie Mellon University, PA (1976)
Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research 48(2), 256–267 (2000)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research 26, 35–62 (1988)
Pisinger, D.: A tree-search heuristic for the container loading problem. Ricerda Operativa 28(87), 31–48 (1998)
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems, Working Paper No. 24. Otto von Guericke University, Magdeburg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ertek, G., Kilic, K. (2006). Decision Support for Packing in Warehouses. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_14
Download citation
DOI: https://doi.org/10.1007/11902140_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)