Abstract
The present paper presents a novel heuristic algorithm, “BBF” algorithm, for the two-dimensional orthogonal rectangular packing problem. The BBF algorithm combines the main ideas of the Best-fit algorithm and the Bricklaying algorithm. Test data shows that the BBF algorithm compares with other heuristic algorithms in terms of both solution quality and efficiency.
This work is partially supported by the Natural Science Foundation of Fujian Province of China Grant #2009J05015 to W. Lin and J. Wang.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coffman Jr., E., Garey, M., Johnson, D.: An application of bin packing to multiprocessor scheduling. SIAM Journal on Computing 7(1), 1–17 (1978)
Coffman, E., Garey, M., Johason, D.: Approximation algorithms for bin packing problems – An update survey. In: Ausiello, G., Lucertini, M., Serafini, P. (eds.) Algorithm Design for Computer System Design, pp. 49–106. Springer, New York (1984)
Coffman Jr., E., Leighton, F.: A provably efficient algorithm for dynamic storage allocation. Journal of Computer and System Sciences 38(1), 2–35 (1989)
Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44(2), 145–159 (1990)
Paull, A.: Linear programming: A key to optimum newsprint production. Pulp Paper Magazine of Canada 57, 85–90 (1956)
Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research 25(1), 30–44 (1977)
Beasley, J.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33(1), 49–64 (1985)
Baker, B., Coffman, E., Rivest, R.L.: Orthogonal packing in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)
Chazelle, B.: The bottom-left bin packing heuristic: An efficient implementation. IEEE Trans. Comput. 32(8), 697–707 (1983)
Liu, D., Teng, H.: An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. European Journal of Operational Reseach 112(2), 413–420 (1999)
Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operatations Research 52(4), 655–671 (2004)
Zhang, D., Han, S., Jiang, Y.: A personification heuristic algorithm for the orthogonal stock-cutting problem. Chinese Journal of Computers 31(3), 509–513 (2008) (in Chinese)
Chen, D., Liu, J., Shang, M.: An intelligent enumerative algorithm for solving rectangle packing problem. Journal of Chongqing University of Post and Telecommunications (Natural Science) 20(4), 379–384 (2008) (in Chinese)
Hopper, E., Turton, B.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128(1), 34–57 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, W., Xu, J., Wang, J., Wu, X. (2011). A Bricklaying Best-Fit Heuristic Algorithm for the Orthogonal Rectangle Packing Problem. In: Zeng, D. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23220-6_81
Download citation
DOI: https://doi.org/10.1007/978-3-642-23220-6_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23219-0
Online ISBN: 978-3-642-23220-6
eBook Packages: Computer ScienceComputer Science (R0)