A approximate algorithm is presented by which satisfactory results of two dimensional optimal layout belonged to NP complete problems can be obtained efficiently and rapidly.

• 摘要针对理论上属于NP完全问题的二维矩形件优化排样问题，构建了一个排样效率高、计算速度快和排样效果好的一种近似算法。