An effective quasi-human based heuristic for solving rectangle packing problem

In this paper, we introduce an effective heuristic for solving the classical NP-complete rectangle packing problem. Many effective heuristics implemented for this problem are non-deterministic in nature and the polynomial approximation methodology proposed previously is too laborious for practical problem sizes. The technique we propose lies on the enhancement of techniques developed through long-term working experience by human professionals. Although this is a deterministic algorithm, the results are very encouraging. This algorithm can consistently produce packing densities of over 99% on most randomly generated large examples