Decision Support for Packing in Warehouses

  • Gürdal Ertek
  • Kemal Kilic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4263)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akturk, M.S., Kilic, K.: Generating short-term observation schedules for space mission projects. Journal of Intelligent Manufacturing 10(5), 387–404 (1999)CrossRefGoogle Scholar
  2. 2.
    Bisckhof, E.E., Wäscher, G.: Cutting and packing. European Journal of Operational Research 84(3), 503–505 (1995)CrossRefGoogle Scholar
  3. 3.
    Brunetta, L., Grégoire, P.A.: General purpose algorithm for three-dimensional packing. INFORMS Journal on Computing 17(3), 328–338 (2005)CrossRefMathSciNetGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44, 145–159 (1990)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Dyckhoff, H., Finke, U.: Cutting and Packing in Production and Distribution. Springer, Berlin (1992)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Eley, M.: A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25, 45–60 (2003)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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)MathSciNetGoogle Scholar
  10. 10.
    Lowerre, B.: The HARPY speech recognition system. Ph.D. Thesis, Carnegie Mellon University, PA (1976)Google Scholar
  11. 11.
    Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Operations Research 48(2), 256–267 (2000)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research 26, 35–62 (1988)CrossRefGoogle Scholar
  13. 13.
    Pisinger, D.: A tree-search heuristic for the container loading problem. Ricerda Operativa 28(87), 31–48 (1998)Google Scholar
  14. 14.
  15. 15.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gürdal Ertek
    • 1
  • Kemal Kilic
    • 1
  1. 1.Faculty of Engineering and Natural SciencesSabanci UniversityOrhanli, Tuzla, IstanbulTurkey

Personalised recommendations