Skip to main content
Conference Proceedings

A bricklaying best-fit heuristic algorithm for the orthogonal rectangle packing problem

Communications in Computer and Information Science (2011) 225 CCIS(PART 2) 638-643
DOI: 10.1007/978-3-642-23220-6_81
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Lin, W., Xu, J., Wang, J., & Wu, X. (2011). A bricklaying best-fit heuristic algorithm for the orthogonal rectangle packing problem. In Communications in Computer and Information Science (Vol. 225 CCIS, pp. 638–643). https://doi.org/10.1007/978-3-642-23220-6_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free