|
|
|
| Dynamic Suspect Encirclement Model |
| FENG Qianqian, ZHOU Weigang, CHEN Shijun
|
| School of Mathematics and Statistics, Hubei University of Arts and Science, Xiangyang 441053,China |
|
|
|
|
Abstract 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.
|
|
Received: 28 May 2020
Published: 28 December 2020
|
|
|
|
|
|
| No related articles found! |
|
|
|
|
