This paper presents a deterministic heuristic algorithm for solving the NP-hard two-dimensional rectangular packing problem with the objective of maximizing the filling rate of a rectangular sheet. The key component of the proposed algorithm is a best-fit constructive procedure, according to which, the rectangles are packed into the sheet one by one and each rectangle is packed into the sheet by an angle-occupying placement with maximum fit degree. To further improve the algorithm's searching ability, a look-ahead strategy and a multistart meth...
