动态围堵嫌犯模型  

Dynamic Suspect Encirclement Model

作　　者：冯倩倩 周伟刚 陈仕军 FENG Qianqian;ZHOU Weigang;CHEN Shijun(School of Mathematics and Statistics, Hubei University of Arts and Science, Xiangyang 441053,China)

机构地区：[1]湖北文理学院数学与统计学院,湖北襄阳441053

出　　处：《复杂系统与复杂性科学》2021年第1期48-52,79,共6页Complex Systems and Complexity Science

基　　金：湖北省教育厅科学技术研究基金(D20162602);国家自然科学基金青年基金(71501064)。

摘　　要：研究了根据嫌犯逃跑信息更新调整围堵方案的动态围堵嫌犯问题。嫌犯在路口节点选择下一步逃跑方向时,交巡警获取该信息,并重新调度警力。将网络的边进行分割,在新网络的节点间调度交巡警。假设交巡警与嫌犯的速度相等,速度不相等时只需修改模型的相应部分。建立了重新调度的线性整数规划模型,该模型利用点截集判断优化模型减小包围圈的缺口。基于对逃跑行为的假设,模拟算例表明重新调度模型是有效的。This paper studies the dynamic encirclement problem,in which traffic and patrol polices are reassigned with suspect escape information update.After the suspect decides the escape direction at a node,the reassignment decision is made based on the suspect escape information.We divide the edges of the network and reassign polices among vertices of the new network.We assume the polices and the suspect have the same speed.The model with different speeds can be easily developed by revising the corresponding parts.A linear integer optimization reassignment model is developed,in which the optimization model of vertex cut is used to narrow the gap of potential encirclement.Based on the assumption about the escape rule of the suspect,a numerical example is provided to show the effectiveness of the model.

关 键 词：网络优化 围堵模型 交巡警服务平台 0-1整数规划 

分 类 号：O221.4[理学—运筹学与控制论] N945.15[理学—数学]