The paper presents a novel and effective heuristic algorithm for the two-dimensional rectangular strippacking problem. This algorithm is mainly based on the bestfit value and tree recursive search rules and selects themaximal fitness rectangle to the packing the space. The computational results on a large number of Benchmarkproblems have shown that this algorithm is more effective than the existing novel algorithm.