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

发布时间：2018-01-06 14:28

  本文关键词：多地点协同恐怖袭击下的多目标警务应急物流调度　出处：《系统工程理论与实践》2017年10期 　论文类型：期刊论文

  更多相关文章： 多地点 协同恐怖袭击 多目标 警务应急物流调度

【摘要】：多地点协同恐怖袭击是最新恐怖袭击形式,会造成严重灾难和大范围社会恐慌.面对袭击时,不仅要考虑救援速度,而在警务救援过程中要综合考虑救援效率、救援效果和救援公平性,制定有效的警务应急物流调度方案以达到快速、高效的救援.本文考虑警务应急物流调度的三个目标,分别是未满足需求、最小最大到达时间和掠夺成本,建立了多个地点发生协同恐怖袭击的多个警务资源有效分配救援的多目标非线性规划模型,并利用改进的快速非支配排序遗传算法(NSGA-Ⅱ)对模型进行求解,以某市公安局的警力和医疗部署为基础,以多点同时发生恐怖袭击为背景进行数值实验,结果验证了模型和算法的合理性与有效性,并得出了受袭地点重要程度最短距离优先策略的救援效果较优于最近救援距离优先策略、合理的警务资源调度中心设置对救援调度有较好的效果、警力分散设置有利于减少恐怖袭击带来的影响的结论.
[Abstract]:Multi-location coordinated terrorist attack is the latest form of terrorist attacks, which will cause serious disasters and large-scale social panic. In the face of attacks, we should not only consider the speed of rescue, but also consider the efficiency of rescue in the process of police rescue. Rescue effect and rescue fairness, the formulation of an effective police emergency logistics scheduling scheme to achieve rapid and efficient rescue. This paper considers the three objectives of police emergency logistics scheduling, one is not to meet the needs. Minimum maximum arrival time and plunder cost, a multi-objective nonlinear programming model for effective allocation and rescue of multiple police resources with coordinated terrorist attacks in multiple locations is established. The model is solved by an improved genetic algorithm named NSGA- 鈪，

本文编号：1388267