Abstract: In this paper, the closed surrounded and blocked set is introduced to explain the situation fully “surrounded”, and a 0-1 integer programming model is established with the shortest at large time and minimum of the police force scheduling. In order to surround and block the criminal suspect rapidly and efficiently, a fast algorithm surrounding and blocking the criminal suspects based on the dynamic closed set is proposed through the application of the shortest priority greedy strategy, and it gets the best solution of surrounding and blocking the suspect. Detailed analyses are carried out on the impact of the escape speed and escape time of criminal suspects on the solution of surrounding and blocking the suspect.

Key words: closed surrounded and blocked set, 0-1 integer programming, shortest priority, greedy algorithm

摘要： 提出了“围堵闭集”的概念来描述完全“围住”的情况，建立了以犯罪嫌疑人在逃时间最短、警力调度最少为目标的0-1整数规划模型。为了实现快速高效围堵，采用最近优先的贪心策略，设计了基于围堵闭集动态调整的高效围堵算法，得到了最佳的围堵方案。对犯罪嫌疑人逃跑速度和报案时间大小对围堵结果的影响进行了详细的分析。

关键词: 围堵闭集, 0-1整数规划, 最近优先, 贪心算法