围堵在逃嫌疑犯的优化模型研究

以某市设置交巡警服务平台的实际数据为基础,建立"递增包围圈"优化模型,采用了先求出随时间递增的包围圈路口节点,再通过0-1整数规划的方法分别求出对应的最大限度节约警力资源的调度方案。针对城区某路口发生重大刑事案件,比较不同时刻包围圈节点数与围堵成功率,给出了一个耗时比较短,包围圈节点数较少,围堵成功率较高的警力调度方案。

Research on the Optimized Model of Containing the Escaping Criminal Suspect

Base on the real data of service platform of traffic and patrol police installation of a certain city, the optimized model called as "increasing encirclement nodes" is created in the first. Secondly, by the method of calculating the position coordinates of encirclement nodes which are increasing with time, then applying the 0-1 integer programming, the dispatching schemes of roads blockade in different time that save police resources maximally are got. Aiming at major criminal case happened in urban intersection, a police dispatching scheme which consumes less time, includes less encirclement nodes and has greater encirclement success rate is presented, through comparing the number of encirclement nodes and encirclement success rates in different time.