利用可行域算法求解矩形布局问题，通过调整矩形布入形态，改变其单一的可行域形式增大其解空间。算例结果表明，矩形调整对布局结果影响有规律，利用可行域算法求解矩形布局问题，简便、快捷、灵活、适应性强，从而能够灵活快速地获得更优异的矩形布局排布方案指导工程实践。%In order to solve the rectangle packing problem on the basis of feasible region algorithm, the rectangle pose can be adjusted to change its single feasible region form and expand its space. The result of the numerical example shows that the impact of rectangle pose adjustment to packing problem is regular. Applying the feasible region algorithm to solve rectangle packing problem is simple, fast, flexible and adaptable, and thus a better rectangle packing problem can be obtained to guide the practice.
展开▼
