Study on Two-Dimensional Packing Problem

De Xiang Zhou; Xian Rong Wang; Sheng Da Chen

doi:10.4028/www.scientific.net/AMR.403-408.246

Paper Titles

Data Mining in Conditions Analysis at a Coal-Fired Utility Boiler
p.223

The High Efficient Sediment-Transport Water Volume in the Lower Yellow River
p.228

The Influence of Global Warming to Environmental Abnormal Variation in the Estuary of the Yellow River
p.235

Study on Three-Dimensional Packing Problem
p.241

Study on Two-Dimensional Packing Problem
p.246

Research of Modified MUSIC Algorithm Based on Vector Matrix
p.250

Simplified Three-Dimensional Thermomechanical Applications of Ball Grid Array Package
p.256

A Research of Network Congestion Control Based on Fuzzy PID Arithmetic
p.266

An Empirical Analysis on Industrial Upgrading of Xiqiao Textile Cluster
p.270

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408Study on Two-Dimensional Packing Problem

Study on Two-Dimensional Packing Problem

Abstract:

IHR was proposed in this paper based on HR algorithm which defines reference rectangle and binding layer. It finds the best solution and the best combination of layers through finding all the binding layers and calculating the solution of each combination of layers. Experimental results show that the IHR algorithm in two-dimensional packing problem is better than the HR algorithm, especially for large quantity of data test problem.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

246-249

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.403-408.246

Citation:

Cite this paper

Online since:

November 2011

Authors:

De Xiang Zhou, Xian Rong Wang, Sheng Da Chen

Keywords:

HR Algorithm, IHR Algorithm, Two-Dimensional Packing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P.C. Gilmore, R.E. Gomory. Multistage cutting stock problems of two and more dimensions[J]. Operations Research, 1965, 13: 94-120.

DOI: 10.1287/opre.13.1.94

Google Scholar

[2] A. Bortfeldt,H. Gehring. Applying tabu search to container loading problems[J]. Operations Research Proceedings, 1997: 533-538.

DOI: 10.1007/978-3-642-58891-4_84

Google Scholar

[3] R. Morabito, M. Arenales. An AND/OR graph approach to the container loading problem[J]. International Transactions in Operational Research, 1994, 1: 59–73.

DOI: 10.1016/0969-6016(94)90046-9

Google Scholar

[4] A. LIM, B. RODRIGUES, Y. YANG. 3-D Container Packing Heuristics[J]. Applied Intelligence, 2005, 22: 125-134.

DOI: 10.1007/s10489-005-5601-0

Google Scholar

[5] E. Hopper, B.C.H. Turton. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem[J]. European Journal of Operational Research, 2001, 128: 34-57.

DOI: 10.1016/s0377-2217(99)00357-4

Google Scholar