运筹与管理2017，Vol.26Issue(10)：148-152,5.DOI:10.12005/orms.2017.0246
基于点截集的围堵嫌犯模型
Suspect Encirclement Model Based on Vertex-cut
摘要
Abstract
This paper studies traffic and patrol polices' suspect encirclement problem.This problem is a part of Problem B of 2011 China Undergraduate Mathematical Contest in Modeling.A set of patrol polices stationed on patrol service platforms need to be assigned to some nodes of the road network node set to cut off the suspect's escape route after receiving the report of the incident.This problem is transformed to prevent the suspect from escaping to a fixed node set.Fixing the chosen set,we analyze whether the set is an encirclement to a node.The definition of vertex-cut is expanded.Then,we develop vertex-cut and compact vertex-cut judgement optimization models,rewrite the model on vertex-cut as a set of constraints,and use it to model suspect encirclement problem.Four optimality criteria are used to develop four 0-1 integer programming models,respectively.Numerical examples based on Lingo for some of these models are given.关键词
图论/网络优化/围堵模型/交巡警服务平台/0-1整数规划Key words
graph theory/network optimization/encirclement model/patrol service platform/0-1 integer programming分类
数理科学引用本文复制引用
周伟刚,冯倩倩..基于点截集的围堵嫌犯模型[J].运筹与管理,2017,26(10):148-152,5.基金项目
湖北省教育厅科学技术研究项目(D20162602) （D20162602）
湖北省自然科学基金计划青年基金项目(2014CFB640) （2014CFB640）
国家自然科学基金青年基金(71501064) （71501064）
