Study on Three-Dimensional Packing Problem

Article Preview

Abstract:

In this paper, the solution of three-dimensional packing problem by using HR algorithm and the process is proposed based on the principle of a detailed analysis of three-dimensional packing problem. In the simulation, we analyze and compare the effect of HR, GA+HR, Bischoff and ALIM algorithm, the results shows that HR runs fast, but the space utilization is low.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

241-245

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] O. Faroe, D. Pisinger , M. Zachariasen. Guided Local Search for Three-Dimensional Bin-Packing Problem[J]. INFORMS Journal on Computing, 2003, 15(3): 267-283.

DOI: 10.1287/ijoc.15.3.267.16080

Google Scholar

[2] E.E. Bischoff, M.D. Marriott. A comparative evaluation of heuristics for container loading[J]. European Journal of Operational Research, 1990, 44: 267-276.

DOI: 10.1016/0377-2217(90)90362-f

Google Scholar

[3] E.E. Bischoff, M.S.W. Ratcliff. Loading multiple pallets[J]. Journal of the Operational Research Society, 1995, 46: 1322-1336.

DOI: 10.1057/jors.1995.181

Google Scholar

[4] Defu Zhang, Yan Kang, Ansheng Deng. A new heuristic recursive algorithm for the strip rectangular packing problem[J]. Computers & Operations Research, 2006, 33(8): 2209-2217.

DOI: 10.1016/j.cor.2005.01.009

Google Scholar

[5] OR-Library, http: /mscmga. ms. ic. ac. uk/info. html.

Google Scholar