多地点协同恐怖袭击下的多目标警务应急物流调度

Multi-objective policing emergency logistics scheduling on multi-location coordinated terrorist attacks

多地点协同恐怖袭击是最新恐怖袭击形式,会造成严重灾难和大范围社会恐慌.面对袭击时,不仅要考虑救援速度,而在警务救援过程中要综合考虑救援效率、救援效果和救援公平性,制定有效的警务应急物流调度方案以达到快速、高效的救援.本文考虑警务应急物流调度的三个目标,分别是未满足需求、最小最大到达时间和掠夺成本,建立了多个地点发生协同恐怖袭击的多个警务资源有效分配救援的多目标非线性规划模型,并利用改进的快速非支配排序遗传算法(NSGA-Ⅱ)对模型进行求解,以某市公安局的警力和医疗部署为基础,以多点同时发生恐怖袭击为背景进行数值实验,结果验证了模型和算法的合理性与有效性,并得出了受袭地点重要程度最短距离优先策略的救援效果较优于最近救援距离优先策略、合理的警务资源调度中心设置对救援调度有较好的效果、警力分散设置有利于减少恐怖袭击带来的影响的结论.

Multi-location coordinated terrorist attack is the latest form of terrorist attacks to lead to serious disasters and the wild range of social panics. The public security agents not only have to consider speed of policing rescue, but also consider many criterions emergency strategies with efficiency of policing rescue, effectiveness of policing rescue and fairness of policing rescue in process of policing emergency logistics scheduling to enable quickly and efficient policing emergency relief to demand points of terrorist attacks. This study proposes improved NSGA-II algorithm to solve policing emergency rescue scheduling model that is non-linear model. The algorithm adjusts policing emergency rescue schedules from policing command center according to the requirements at demand points in order to minimize unsatisfied for resources, max arrival time, and deprivation costs. The proposed algorithm is applied to scenario of coordinated terrorist attacks in city of China to test its performance. Experimental results verify rationality and effectiveness of model and algorithm. The results show that attacking site importance and shortest distance priority rescue strategy is more effective than the nearest rescue distance priority strategy, and reasonable policing resources scheduling center has better effects on rescue scheduling, and decentralization of police can reduce the impact of terrorist attacks.