The Heuristic Algorithm of Stacking Layer for the Three-Dimensional Packing of Fixed-Size Cargoes

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 107)

Abstract

According to the actual operation of working people, a heuristic algorithm of stacking layer that meets the requirements of stability and convenience for load-and-unload was proposed. Firstly, choose the stacking direction according to the position of the compartment door. Secondly, optimize the combination of length, width and height along the stacking direction to minimize the remaining space. Finally, optimize each layer’s layout. In each layer’s layout, adopt long-short edge combination mode for each edge. Considering the flatness and stability of loading and unloading, the number of long-short edge is related. Experiment results show that the algorithm can maintain the requirements of stability and convenience of loading and unloading, and also has nice space utilization.

Keywords

Fixed-size cargoes Three-dimensional packing Stacking layer method Heuristic algorithm 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for container loading problem. Eur J Oper Res 131:143–161CrossRefMATHGoogle Scholar
  2. 2.
    Pisinger D (2002) Heuristic for the container loading problem. Eur J Oper Res 141:143–153CrossRefMathSciNetGoogle Scholar
  3. 3.
    Bortfeldt A, Gehring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29(5):641–662CrossRefGoogle Scholar
  4. 4.
    Mack D, Bortfeldt A, Gehring H (2004) A parallel hybrid local search algorithm for the container loading problem. Int Trans Oper Res 11(5):511–533CrossRefMATHGoogle Scholar
  5. 5.
    Gendreau M (2006) A tabu search algorithm for a routing and container loading problem. Transp Sci 40(3):342–350CrossRefMathSciNetGoogle Scholar
  6. 6.
    Crainic T, Perboli G, Tadei R (2009) TS2PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195(3):744–760CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Egeblad J, Pisinger D (2009) Heuristic approaches for the two- and three-dimensional knapsack packing problem. Comput Oper Res 36(4):1026–1049CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Yang H, Shi J (2010) A Hybrid CD/VND algorithm for three-dimensional bin packing. In: The 2nd international conference on computer modeling and simulation. IEEE Press, SanyaGoogle Scholar
  9. 9.
    Almeida AD, Figueiredo MB (2010) A particular approach for the three-dimensional packing problem with additional constraints. Comput Oper Res 37(11):1968–1976CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Bu L, Yin C, Pu Y (2002) A genetic and simulated annealing algorithm for optimal sequential casing of less-than-carload freights. J Southwest Jiaotong Univ 37(5):531–535Google Scholar
  11. 11.
    George JA (1992) A method for solving container packing for a single size of box. J Oper Res Soc 43(4):307–312MATHGoogle Scholar
  12. 12.
    Sui S, Shao W, Gao Z (2005) A Heuristic algorithm for dimensional container packing problem of fixed-size cargoes. Inf Control 34(4):490–494Google Scholar
  13. 13.
    Yang D (2007) Optimum algorithm for container loading one type of objects. J Trans Eng Inf 5(2):17–23Google Scholar
  14. 14.
    Xu L, Ji Z, Xia J (2008) The optimum algorithm for the container loading problem with homogeneous cargoes. J Shangdong Univ (Eng Sci) 38(3):1–4MATHGoogle Scholar
  15. 15.
    Niu Y, Fan Y, Xu E (2004) Method of container loading in order model. Logist Tech 5:47–49Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.School of Computer and Information EngineeringXiamen UniversityXiamenChina
  2. 2.Research Centre of Modern LogisticsJimei UniversityXiamenChina

Personalised recommendations