破损平面的k-L形覆盖算法

Algorithm of k-L Squared Cover on a Defective Plane

提出了一种求解破损平面k-L形覆盖问题的剪枝搜索算法。该算法先将k-L形分解为顶格和底格的组合,并将整个平面做相应分解构成候选集合,再利用剪枝搜索算法对平面进行搜索,找到相匹配的组合,通过逐步求精的方法以得到接近于最优解的覆盖方案。实验结果表明,该算法在处理小规模破损平面k-L形的覆盖问题上是有效的。

This paper proposed a branching-cutting search algorithm for solving the defective plane covered by k-L squared covers problem.The main idea was to divide k-L squared cover into two pieces of rectangles to consist a set of selection of the plane,then searched matching rectangles and gradually gave the approximate optimized solution by branching-cutting search algorithm.Experimental results demonstrated that the algorithm was effective in solving less large scaled defective plane covering problem.