A minimal encirclement algorithm for blockade problem with its application

In this paper, it is studied a blockade problem about suspect escape with using graph theory. A minimum encirclement generation algorithm is proposed to convert this problem into a matching problem. Then the specific blockade plan is obtained. As the algorithm is a sort of polynomial time algorithm, it can obtain the global optimum in a relative shorter time compared with other algorithms. A series of evaluation criterion and numerical example are finally simulated to measure the effectiveness of proposed the blockade plan.