As a special 2D rectangle packing problem, the 2D rectangle packing area minimization problem with central rectangle (CR-RPAMP) has one or more central rectangles among the candidate items. The central rectangles should be packed near the center of the final layout. At the same time, the length–width ratio of the final layout must be within a reasonable region. The CR-RPAMP has been applied in many areas such as the layout design of semi-submersible platform, farmland irrigation, urban planning. In this study, to improve the performance of heuristic approach for solving the CR-RPAMP, three novel strategies including strategy of filling inner space, strategy of generating inner space and strategy of simplifying packing process, are proposed and combined to form a novel heuristic approach NHACR (Novel Heuristic Approach for CR-RPAMP). The analyses of computational complexity of the proposed NHACR indicate that it has low computational complexity. Based on two famous sets of benchmark instances, the proposed NHACR shows better performance compared with several existing algorithms considering the success rate, the filling rate of final layout and the computing time. Finally, the NHACR is utilized to solve a specific application problem in oil and gas industry and its advantage is further confirmed.

作为特殊的2D矩形填充问题，带有中心矩形的2D矩形填充区域最小化问题（CR-RPAMP）在候选项目中具有一个或多个中心矩形。中央矩形应排在最终布局的中心附近。同时，最终布局的长宽比必须在合理的范围内。CR-RPAMP已应用于许多领域，例如半潜式平台的布局设计，农田灌溉，城市规划。在这项研究中，为了提高启发式方法解决CR-RPAMP的性能，提出了三种新颖的策略，包括填充内部空间的策略，生成内部空间的策略和简化包装过程的策略，并将其组合起来，形成一种新颖的启发式方法NHACR（CR-RPAMP的新颖启发式方法）。对提出的NHACR的计算复杂度的分析表明，它具有较低的计算复杂度。考虑到成功率，最终布局的填充率和计算时间，基于两个著名的基准实例集，与现有的几种算法相比，提出的NHACR表现出更好的性能。最后，将NHACR用于解决石油和天然气工业中的特定应用问题，并进一步证实了其优势。